data_source
stringclasses 3
values | prompt
listlengths 2
2
| reward_model
dict | extra_info
dict |
|---|---|---|---|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Chang Liu, TingTing Hwang, Jason Cong, Taigon Song, Sachin S. Sapatnekar, Ankur Srivastava, David Z. Pan, Sung Kyu Lim, Sheldon X.-D. Tan, Krit Athikulwongse, Mohit Pathak, Young-Joon Lee, Yiyu Shi, Hao Yu\n- Research collaborations between these authors: Chang Liu and Hao Yu, Chang Liu and Sung Kyu Lim, Chang Liu and Young-Joon Lee, Chang Liu and Krit Athikulwongse, Chang Liu and Mohit Pathak, Chang Liu and Ankur Srivastava, Chang Liu and Yiyu Shi, Chang Liu and Taigon Song, TingTing Hwang and Jason Cong, TingTing Hwang and Sachin S. Sapatnekar, TingTing Hwang and Sung Kyu Lim, TingTing Hwang and Mohit Pathak, TingTing Hwang and Yiyu Shi, Jason Cong and Hao Yu, Jason Cong and Sachin S. Sapatnekar, Jason Cong and Ankur Srivastava, Jason Cong and David Z. Pan, Jason Cong and Sung Kyu Lim, Jason Cong and Yiyu Shi, Jason Cong and Young-Joon Lee, Jason Cong and Krit Athikulwongse, Jason Cong and Mohit Pathak, Taigon Song and Ankur Srivastava, Taigon Song and Sung Kyu Lim, Taigon Song and Yiyu Shi, Taigon Song and Young-Joon Lee, Taigon Song and Krit Athikulwongse, Taigon Song and Mohit Pathak, Sachin S. Sapatnekar and Hao Yu, Sachin S. Sapatnekar and Sheldon X.-D. Tan, Sachin S. Sapatnekar and Ankur Srivastava, Sachin S. Sapatnekar and David Z. Pan, Sachin S. Sapatnekar and Sung Kyu Lim, Sachin S. Sapatnekar and Krit Athikulwongse, Sachin S. Sapatnekar and Yiyu Shi, Sachin S. Sapatnekar and Young-Joon Lee, Sachin S. Sapatnekar and Mohit Pathak, Ankur Srivastava and David Z. Pan, Ankur Srivastava and Sung Kyu Lim, Ankur Srivastava and Yiyu Shi, Ankur Srivastava and Young-Joon Lee, Ankur Srivastava and Krit Athikulwongse, Ankur Srivastava and Mohit Pathak, David Z. Pan and Sheldon X.-D. Tan, David Z. Pan and Sung Kyu Lim, David Z. Pan and Young-Joon Lee, David Z. Pan and Krit Athikulwongse, David Z. Pan and Mohit Pathak, David Z. Pan and Yiyu Shi, Sung Kyu Lim and Hao Yu, Sung Kyu Lim and Sheldon X.-D. Tan, Sung Kyu Lim and Yiyu Shi, Sung Kyu Lim and Young-Joon Lee, Sung Kyu Lim and Krit Athikulwongse, Sung Kyu Lim and Mohit Pathak, Sheldon X.-D. Tan and Hao Yu, Sheldon X.-D. Tan and Yiyu Shi, Sheldon X.-D. Tan and Mohit Pathak, Krit Athikulwongse and Hao Yu, Krit Athikulwongse and Yiyu Shi, Krit Athikulwongse and Young-Joon Lee, Krit Athikulwongse and Mohit Pathak, Mohit Pathak and Hao Yu, Mohit Pathak and Yiyu Shi, Mohit Pathak and Young-Joon Lee, Young-Joon Lee and Hao Yu, Young-Joon Lee and Yiyu Shi, Yiyu Shi and Hao Yu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Chang Liu\", \"id\": 51840}, {\"name\": \"TingTing Hwang\", \"id\": 329793}, {\"name\": \"Jason Cong\", \"id\": 87620}, {\"name\": \"Taigon Song\", \"id\": 683113}, {\"name\": \"Sachin S. Sapatnekar\", \"id\": 92683}, {\"name\": \"Ankur Srivastava\", \"id\": 226477}, {\"name\": \"David Z. Pan\", \"id\": 227343}, {\"name\": \"Sung Kyu Lim\", \"id\": 246129}, {\"name\": \"Sheldon X.-D. Tan\", \"id\": 213394}, {\"name\": \"Krit Athikulwongse\", \"id\": 606931}, {\"name\": \"Mohit Pathak\", \"id\": 606932}, {\"name\": \"Young-Joon Lee\", \"id\": 479956}, {\"name\": \"Yiyu Shi\", \"id\": 392529}, {\"name\": \"Hao Yu\", \"id\": 24409}], \"links\": [{\"source\": 51840, \"target\": 24409}, {\"source\": 51840, \"target\": 246129}, {\"source\": 51840, \"target\": 479956}, {\"source\": 51840, \"target\": 606931}, {\"source\": 51840, \"target\": 606932}, {\"source\": 51840, \"target\": 226477}, {\"source\": 51840, \"target\": 392529}, {\"source\": 51840, \"target\": 683113}, {\"source\": 329793, \"target\": 87620}, {\"source\": 329793, \"target\": 92683}, {\"source\": 329793, \"target\": 246129}, {\"source\": 329793, \"target\": 606932}, {\"source\": 329793, \"target\": 392529}, {\"source\": 87620, \"target\": 24409}, {\"source\": 87620, \"target\": 92683}, {\"source\": 87620, \"target\": 226477}, {\"source\": 87620, \"target\": 227343}, {\"source\": 87620, \"target\": 246129}, {\"source\": 87620, \"target\": 392529}, {\"source\": 87620, \"target\": 479956}, {\"source\": 87620, \"target\": 606931}, {\"source\": 87620, \"target\": 606932}, {\"source\": 683113, \"target\": 226477}, {\"source\": 683113, \"target\": 246129}, {\"source\": 683113, \"target\": 392529}, {\"source\": 683113, \"target\": 479956}, {\"source\": 683113, \"target\": 606931}, {\"source\": 683113, \"target\": 606932}, {\"source\": 92683, \"target\": 24409}, {\"source\": 92683, \"target\": 213394}, {\"source\": 92683, \"target\": 226477}, {\"source\": 92683, \"target\": 227343}, {\"source\": 92683, \"target\": 246129}, {\"source\": 92683, \"target\": 606931}, {\"source\": 92683, \"target\": 392529}, {\"source\": 92683, \"target\": 479956}, {\"source\": 92683, \"target\": 606932}, {\"source\": 226477, \"target\": 227343}, {\"source\": 226477, \"target\": 246129}, {\"source\": 226477, \"target\": 392529}, {\"source\": 226477, \"target\": 479956}, {\"source\": 226477, \"target\": 606931}, {\"source\": 226477, \"target\": 606932}, {\"source\": 227343, \"target\": 213394}, {\"source\": 227343, \"target\": 246129}, {\"source\": 227343, \"target\": 479956}, {\"source\": 227343, \"target\": 606931}, {\"source\": 227343, \"target\": 606932}, {\"source\": 227343, \"target\": 392529}, {\"source\": 246129, \"target\": 24409}, {\"source\": 246129, \"target\": 213394}, {\"source\": 246129, \"target\": 392529}, {\"source\": 246129, \"target\": 479956}, {\"source\": 246129, \"target\": 606931}, {\"source\": 246129, \"target\": 606932}, {\"source\": 213394, \"target\": 24409}, {\"source\": 213394, \"target\": 392529}, {\"source\": 213394, \"target\": 606932}, {\"source\": 606931, \"target\": 24409}, {\"source\": 606931, \"target\": 392529}, {\"source\": 606931, \"target\": 479956}, {\"source\": 606931, \"target\": 606932}, {\"source\": 606932, \"target\": 24409}, {\"source\": 606932, \"target\": 392529}, {\"source\": 606932, \"target\": 479956}, {\"source\": 479956, \"target\": 24409}, {\"source\": 479956, \"target\": 392529}, {\"source\": 392529, \"target\": 24409}]}",
"id": 94,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Chang Liu, TingTing Hwang, Jason Cong, Taigon Song, Sachin S. Sapatnekar, Ankur Srivastava, David Z. Pan, Sung Kyu Lim, Sheldon X.-D. Tan, Krit Athikulwongse, Mohit Pathak, Young-Joon Lee, Yiyu Shi, Hao Yu\n- Research collaborations between these authors: Chang Liu and Hao Yu, Chang Liu and Sung Kyu Lim, Chang Liu and Young-Joon Lee, Chang Liu and Krit Athikulwongse, Chang Liu and Mohit Pathak, Chang Liu and Ankur Srivastava, Chang Liu and Yiyu Shi, Chang Liu and Taigon Song, TingTing Hwang and Jason Cong, TingTing Hwang and Sachin S. Sapatnekar, TingTing Hwang and Sung Kyu Lim, TingTing Hwang and Mohit Pathak, TingTing Hwang and Yiyu Shi, Jason Cong and Hao Yu, Jason Cong and Sachin S. Sapatnekar, Jason Cong and Ankur Srivastava, Jason Cong and David Z. Pan, Jason Cong and Sung Kyu Lim, Jason Cong and Yiyu Shi, Jason Cong and Young-Joon Lee, Jason Cong and Krit Athikulwongse, Jason Cong and Mohit Pathak, Taigon Song and Ankur Srivastava, Taigon Song and Sung Kyu Lim, Taigon Song and Yiyu Shi, Taigon Song and Young-Joon Lee, Taigon Song and Krit Athikulwongse, Taigon Song and Mohit Pathak, Sachin S. Sapatnekar and Hao Yu, Sachin S. Sapatnekar and Sheldon X.-D. Tan, Sachin S. Sapatnekar and Ankur Srivastava, Sachin S. Sapatnekar and David Z. Pan, Sachin S. Sapatnekar and Sung Kyu Lim, Sachin S. Sapatnekar and Krit Athikulwongse, Sachin S. Sapatnekar and Yiyu Shi, Sachin S. Sapatnekar and Young-Joon Lee, Sachin S. Sapatnekar and Mohit Pathak, Ankur Srivastava and David Z. Pan, Ankur Srivastava and Sung Kyu Lim, Ankur Srivastava and Yiyu Shi, Ankur Srivastava and Young-Joon Lee, Ankur Srivastava and Krit Athikulwongse, Ankur Srivastava and Mohit Pathak, David Z. Pan and Sheldon X.-D. Tan, David Z. Pan and Sung Kyu Lim, David Z. Pan and Young-Joon Lee, David Z. Pan and Krit Athikulwongse, David Z. Pan and Mohit Pathak, David Z. Pan and Yiyu Shi, Sung Kyu Lim and Hao Yu, Sung Kyu Lim and Sheldon X.-D. Tan, Sung Kyu Lim and Yiyu Shi, Sung Kyu Lim and Young-Joon Lee, Sung Kyu Lim and Krit Athikulwongse, Sung Kyu Lim and Mohit Pathak, Sheldon X.-D. Tan and Hao Yu, Sheldon X.-D. Tan and Yiyu Shi, Sheldon X.-D. Tan and Mohit Pathak, Krit Athikulwongse and Hao Yu, Krit Athikulwongse and Yiyu Shi, Krit Athikulwongse and Young-Joon Lee, Krit Athikulwongse and Mohit Pathak, Mohit Pathak and Hao Yu, Mohit Pathak and Yiyu Shi, Mohit Pathak and Young-Joon Lee, Young-Joon Lee and Hao Yu, Young-Joon Lee and Yiyu Shi, Yiyu Shi and Hao Yu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Michael W. Mahoney, Gary L. Miller, Daniel A. Spielman, Aaron Sidford, Christopher Musco, Cameron Musco, Yin Tat Lee, Xiangrui Meng, Michael B. Cohen, Huy L. Nguyen, Christos Boutsidis, Edo Liberty, Santosh Vempala, David P. Woodruff\n- Research collaborations between these authors: Michael W. Mahoney and Gary L. Miller, Michael W. Mahoney and David P. Woodruff, Michael W. Mahoney and Santosh Vempala, Michael W. Mahoney and Xiangrui Meng, Michael W. Mahoney and Christos Boutsidis, Michael W. Mahoney and Edo Liberty, Michael W. Mahoney and Daniel A. Spielman, Michael W. Mahoney and Yin Tat Lee, Michael W. Mahoney and Huy L. Nguyen, Michael W. Mahoney and Michael B. Cohen, Michael W. Mahoney and Aaron Sidford, Michael W. Mahoney and Cameron Musco, Michael W. Mahoney and Christopher Musco, Gary L. Miller and Daniel A. Spielman, Gary L. Miller and Yin Tat Lee, Gary L. Miller and Aaron Sidford, Gary L. Miller and David P. Woodruff, Gary L. Miller and Christos Boutsidis, Gary L. Miller and Michael B. Cohen, Gary L. Miller and Cameron Musco, Gary L. Miller and Christopher Musco, Daniel A. Spielman and David P. Woodruff, Daniel A. Spielman and Santosh Vempala, Daniel A. Spielman and Aaron Sidford, Daniel A. Spielman and Christos Boutsidis, Daniel A. Spielman and Yin Tat Lee, Daniel A. Spielman and Michael B. Cohen, Daniel A. Spielman and Cameron Musco, Daniel A. Spielman and Christopher Musco, Aaron Sidford and David P. Woodruff, Aaron Sidford and Yin Tat Lee, Aaron Sidford and Michael B. Cohen, Aaron Sidford and Santosh Vempala, Aaron Sidford and Huy L. Nguyen, Aaron Sidford and Cameron Musco, Aaron Sidford and Christopher Musco, Christopher Musco and David P. Woodruff, Christopher Musco and Yin Tat Lee, Christopher Musco and Michael B. Cohen, Christopher Musco and Cameron Musco, Christopher Musco and Santosh Vempala, Christopher Musco and Xiangrui Meng, Christopher Musco and Christos Boutsidis, Christopher Musco and Huy L. Nguyen, Cameron Musco and David P. Woodruff, Cameron Musco and Yin Tat Lee, Cameron Musco and Michael B. Cohen, Cameron Musco and Santosh Vempala, Cameron Musco and Xiangrui Meng, Cameron Musco and Christos Boutsidis, Cameron Musco and Edo Liberty, Cameron Musco and Huy L. Nguyen, Yin Tat Lee and David P. Woodruff, Yin Tat Lee and Santosh Vempala, Yin Tat Lee and Michael B. Cohen, Xiangrui Meng and David P. Woodruff, Xiangrui Meng and Michael B. Cohen, Michael B. Cohen and David P. Woodruff, Michael B. Cohen and Santosh Vempala, Michael B. Cohen and Christos Boutsidis, Michael B. Cohen and Edo Liberty, Michael B. Cohen and Huy L. Nguyen, Huy L. Nguyen and David P. Woodruff, Huy L. Nguyen and Christos Boutsidis, Christos Boutsidis and David P. Woodruff, Christos Boutsidis and Santosh Vempala, Christos Boutsidis and Edo Liberty, Edo Liberty and David P. Woodruff, Santosh Vempala and David P. Woodruff.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Daniel A. Spielman\", \"id\": 70179}, {\"name\": \"Michael W. Mahoney\", \"id\": 148739}, {\"name\": \"Gary L. Miller\", \"id\": 5315}, {\"name\": \"Aaron Sidford\", \"id\": 424454}, {\"name\": \"Christopher Musco\", \"id\": 722344}, {\"name\": \"Cameron Musco\", \"id\": 461000}, {\"name\": \"Yin Tat Lee\", \"id\": 194186}, {\"name\": \"Xiangrui Meng\", \"id\": 23468}, {\"name\": \"Michael B. Cohen\", \"id\": 196270}, {\"name\": \"Huy L. Nguyen\", \"id\": 230932}, {\"name\": \"Christos Boutsidis\", \"id\": 75673}, {\"name\": \"Edo Liberty\", \"id\": 75674}, {\"name\": \"Santosh Vempala\", \"id\": 21949}, {\"name\": \"David P. Woodruff\", \"id\": 12669}], \"links\": [{\"source\": 70179, \"target\": 5315}, {\"source\": 70179, \"target\": 12669}, {\"source\": 70179, \"target\": 21949}, {\"source\": 70179, \"target\": 424454}, {\"source\": 70179, \"target\": 75673}, {\"source\": 70179, \"target\": 148739}, {\"source\": 70179, \"target\": 194186}, {\"source\": 70179, \"target\": 196270}, {\"source\": 70179, \"target\": 461000}, {\"source\": 70179, \"target\": 722344}, {\"source\": 148739, \"target\": 5315}, {\"source\": 148739, \"target\": 12669}, {\"source\": 148739, \"target\": 21949}, {\"source\": 148739, \"target\": 23468}, {\"source\": 148739, \"target\": 75673}, {\"source\": 148739, \"target\": 75674}, {\"source\": 148739, \"target\": 194186}, {\"source\": 148739, \"target\": 230932}, {\"source\": 148739, \"target\": 196270}, {\"source\": 148739, \"target\": 424454}, {\"source\": 148739, \"target\": 461000}, {\"source\": 148739, \"target\": 722344}, {\"source\": 5315, \"target\": 194186}, {\"source\": 5315, \"target\": 424454}, {\"source\": 5315, \"target\": 12669}, {\"source\": 5315, \"target\": 75673}, {\"source\": 5315, \"target\": 196270}, {\"source\": 5315, \"target\": 461000}, {\"source\": 5315, \"target\": 722344}, {\"source\": 424454, \"target\": 12669}, {\"source\": 424454, \"target\": 194186}, {\"source\": 424454, \"target\": 196270}, {\"source\": 424454, \"target\": 21949}, {\"source\": 424454, \"target\": 230932}, {\"source\": 424454, \"target\": 461000}, {\"source\": 424454, \"target\": 722344}, {\"source\": 722344, \"target\": 12669}, {\"source\": 722344, \"target\": 194186}, {\"source\": 722344, \"target\": 196270}, {\"source\": 722344, \"target\": 461000}, {\"source\": 722344, \"target\": 21949}, {\"source\": 722344, \"target\": 23468}, {\"source\": 722344, \"target\": 75673}, {\"source\": 722344, \"target\": 230932}, {\"source\": 461000, \"target\": 12669}, {\"source\": 461000, \"target\": 194186}, {\"source\": 461000, \"target\": 196270}, {\"source\": 461000, \"target\": 21949}, {\"source\": 461000, \"target\": 23468}, {\"source\": 461000, \"target\": 75673}, {\"source\": 461000, \"target\": 75674}, {\"source\": 461000, \"target\": 230932}, {\"source\": 194186, \"target\": 12669}, {\"source\": 194186, \"target\": 21949}, {\"source\": 194186, \"target\": 196270}, {\"source\": 23468, \"target\": 12669}, {\"source\": 23468, \"target\": 196270}, {\"source\": 196270, \"target\": 12669}, {\"source\": 196270, \"target\": 21949}, {\"source\": 196270, \"target\": 75673}, {\"source\": 196270, \"target\": 75674}, {\"source\": 196270, \"target\": 230932}, {\"source\": 230932, \"target\": 12669}, {\"source\": 230932, \"target\": 75673}, {\"source\": 75673, \"target\": 12669}, {\"source\": 75673, \"target\": 21949}, {\"source\": 75673, \"target\": 75674}, {\"source\": 75674, \"target\": 12669}, {\"source\": 21949, \"target\": 12669}]}",
"id": 664,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Michael W. Mahoney, Gary L. Miller, Daniel A. Spielman, Aaron Sidford, Christopher Musco, Cameron Musco, Yin Tat Lee, Xiangrui Meng, Michael B. Cohen, Huy L. Nguyen, Christos Boutsidis, Edo Liberty, Santosh Vempala, David P. Woodruff\n- Research collaborations between these authors: Michael W. Mahoney and Gary L. Miller, Michael W. Mahoney and David P. Woodruff, Michael W. Mahoney and Santosh Vempala, Michael W. Mahoney and Xiangrui Meng, Michael W. Mahoney and Christos Boutsidis, Michael W. Mahoney and Edo Liberty, Michael W. Mahoney and Daniel A. Spielman, Michael W. Mahoney and Yin Tat Lee, Michael W. Mahoney and Huy L. Nguyen, Michael W. Mahoney and Michael B. Cohen, Michael W. Mahoney and Aaron Sidford, Michael W. Mahoney and Cameron Musco, Michael W. Mahoney and Christopher Musco, Gary L. Miller and Daniel A. Spielman, Gary L. Miller and Yin Tat Lee, Gary L. Miller and Aaron Sidford, Gary L. Miller and David P. Woodruff, Gary L. Miller and Christos Boutsidis, Gary L. Miller and Michael B. Cohen, Gary L. Miller and Cameron Musco, Gary L. Miller and Christopher Musco, Daniel A. Spielman and David P. Woodruff, Daniel A. Spielman and Santosh Vempala, Daniel A. Spielman and Aaron Sidford, Daniel A. Spielman and Christos Boutsidis, Daniel A. Spielman and Yin Tat Lee, Daniel A. Spielman and Michael B. Cohen, Daniel A. Spielman and Cameron Musco, Daniel A. Spielman and Christopher Musco, Aaron Sidford and David P. Woodruff, Aaron Sidford and Yin Tat Lee, Aaron Sidford and Michael B. Cohen, Aaron Sidford and Santosh Vempala, Aaron Sidford and Huy L. Nguyen, Aaron Sidford and Cameron Musco, Aaron Sidford and Christopher Musco, Christopher Musco and David P. Woodruff, Christopher Musco and Yin Tat Lee, Christopher Musco and Michael B. Cohen, Christopher Musco and Cameron Musco, Christopher Musco and Santosh Vempala, Christopher Musco and Xiangrui Meng, Christopher Musco and Christos Boutsidis, Christopher Musco and Huy L. Nguyen, Cameron Musco and David P. Woodruff, Cameron Musco and Yin Tat Lee, Cameron Musco and Michael B. Cohen, Cameron Musco and Santosh Vempala, Cameron Musco and Xiangrui Meng, Cameron Musco and Christos Boutsidis, Cameron Musco and Edo Liberty, Cameron Musco and Huy L. Nguyen, Yin Tat Lee and David P. Woodruff, Yin Tat Lee and Santosh Vempala, Yin Tat Lee and Michael B. Cohen, Xiangrui Meng and David P. Woodruff, Xiangrui Meng and Michael B. Cohen, Michael B. Cohen and David P. Woodruff, Michael B. Cohen and Santosh Vempala, Michael B. Cohen and Christos Boutsidis, Michael B. Cohen and Edo Liberty, Michael B. Cohen and Huy L. Nguyen, Huy L. Nguyen and David P. Woodruff, Huy L. Nguyen and Christos Boutsidis, Christos Boutsidis and David P. Woodruff, Christos Boutsidis and Santosh Vempala, Christos Boutsidis and Edo Liberty, Edo Liberty and David P. Woodruff, Santosh Vempala and David P. Woodruff.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Yen-Yu Chen, Ramón Hervás, Yuan-Hsiang Lin, Patrick Chow-In Ko, José Bravo, Gwo-Jen Jan, Yuan-Ting Zhang, Kevin Hung, Hailiang Mei, Ing Widya, Rita Paradiso, Kong-Pang Pun, Guang-Zhong Yang, Upkar Varshney\n- Research collaborations between these authors: Yen-Yu Chen and Hailiang Mei, Ramón Hervás and José Bravo, Ramón Hervás and Hailiang Mei, Ramón Hervás and Ing Widya, Yuan-Hsiang Lin and Hailiang Mei, Patrick Chow-In Ko and Hailiang Mei, José Bravo and Hailiang Mei, José Bravo and Ing Widya, Gwo-Jen Jan and Hailiang Mei, Yuan-Ting Zhang and Guang-Zhong Yang, Yuan-Ting Zhang and Upkar Varshney, Yuan-Ting Zhang and Kong-Pang Pun, Yuan-Ting Zhang and Rita Paradiso, Yuan-Ting Zhang and Kevin Hung, Yuan-Ting Zhang and Hailiang Mei, Yuan-Ting Zhang and Ing Widya, Kevin Hung and Guang-Zhong Yang, Kevin Hung and Upkar Varshney, Kevin Hung and Hailiang Mei, Kevin Hung and Ing Widya, Hailiang Mei and Ing Widya, Kong-Pang Pun and Guang-Zhong Yang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Yen-Yu Chen\", \"id\": 514944}, {\"name\": \"Yuan-Hsiang Lin\", \"id\": 466501}, {\"name\": \"Ram\\u00f3n Herv\\u00e1s\", \"id\": 38917}, {\"name\": \"Patrick Chow-In Ko\", \"id\": 962118}, {\"name\": \"Jos\\u00e9 Bravo\", \"id\": 38919}, {\"name\": \"Gwo-Jen Jan\", \"id\": 630985}, {\"name\": \"Yuan-Ting Zhang\", \"id\": 281516}, {\"name\": \"Kevin Hung\", \"id\": 776142}, {\"name\": \"Hailiang Mei\", \"id\": 310421}, {\"name\": \"Ing Widya\", \"id\": 310422}, {\"name\": \"Rita Paradiso\", \"id\": 413911}, {\"name\": \"Kong-Pang Pun\", \"id\": 200473}, {\"name\": \"Guang-Zhong Yang\", \"id\": 5851}, {\"name\": \"Upkar Varshney\", \"id\": 7709}], \"links\": [{\"source\": 514944, \"target\": 310421}, {\"source\": 466501, \"target\": 310421}, {\"source\": 38917, \"target\": 38919}, {\"source\": 38917, \"target\": 310421}, {\"source\": 38917, \"target\": 310422}, {\"source\": 962118, \"target\": 310421}, {\"source\": 38919, \"target\": 310421}, {\"source\": 38919, \"target\": 310422}, {\"source\": 630985, \"target\": 310421}, {\"source\": 281516, \"target\": 5851}, {\"source\": 281516, \"target\": 7709}, {\"source\": 281516, \"target\": 200473}, {\"source\": 281516, \"target\": 413911}, {\"source\": 281516, \"target\": 776142}, {\"source\": 281516, \"target\": 310421}, {\"source\": 281516, \"target\": 310422}, {\"source\": 776142, \"target\": 5851}, {\"source\": 776142, \"target\": 7709}, {\"source\": 776142, \"target\": 310421}, {\"source\": 776142, \"target\": 310422}, {\"source\": 310421, \"target\": 310422}, {\"source\": 200473, \"target\": 5851}]}",
"id": 1630,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Yen-Yu Chen, Ramón Hervás, Yuan-Hsiang Lin, Patrick Chow-In Ko, José Bravo, Gwo-Jen Jan, Yuan-Ting Zhang, Kevin Hung, Hailiang Mei, Ing Widya, Rita Paradiso, Kong-Pang Pun, Guang-Zhong Yang, Upkar Varshney\n- Research collaborations between these authors: Yen-Yu Chen and Hailiang Mei, Ramón Hervás and José Bravo, Ramón Hervás and Hailiang Mei, Ramón Hervás and Ing Widya, Yuan-Hsiang Lin and Hailiang Mei, Patrick Chow-In Ko and Hailiang Mei, José Bravo and Hailiang Mei, José Bravo and Ing Widya, Gwo-Jen Jan and Hailiang Mei, Yuan-Ting Zhang and Guang-Zhong Yang, Yuan-Ting Zhang and Upkar Varshney, Yuan-Ting Zhang and Kong-Pang Pun, Yuan-Ting Zhang and Rita Paradiso, Yuan-Ting Zhang and Kevin Hung, Yuan-Ting Zhang and Hailiang Mei, Yuan-Ting Zhang and Ing Widya, Kevin Hung and Guang-Zhong Yang, Kevin Hung and Upkar Varshney, Kevin Hung and Hailiang Mei, Kevin Hung and Ing Widya, Hailiang Mei and Ing Widya, Kong-Pang Pun and Guang-Zhong Yang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Raymond W. Yeung, Shweta Agrawal, Maria-Anna Fengou, Georgia N. Athanasiou, Georgios Mantas, Rudolf Ahlswede, Dimitrios K. Lymberopoulos, Michelle Effros, Jonathan Rodriguez, Yawen Wei, Peng Zhang, Xiaodong Lin, Jun Shi, Sachin Katti\n- Research collaborations between these authors: Raymond W. Yeung and Peng Zhang, Raymond W. Yeung and Rudolf Ahlswede, Raymond W. Yeung and Michelle Effros, Raymond W. Yeung and Sachin Katti, Raymond W. Yeung and Jonathan Rodriguez, Raymond W. Yeung and Georgios Mantas, Shweta Agrawal and Jonathan Rodriguez, Shweta Agrawal and Georgios Mantas, Maria-Anna Fengou and Georgios Mantas, Maria-Anna Fengou and Dimitrios K. Lymberopoulos, Maria-Anna Fengou and Georgia N. Athanasiou, Georgia N. Athanasiou and Georgios Mantas, Georgia N. Athanasiou and Dimitrios K. Lymberopoulos, Georgios Mantas and Jonathan Rodriguez, Georgios Mantas and Peng Zhang, Georgios Mantas and Rudolf Ahlswede, Georgios Mantas and Michelle Effros, Georgios Mantas and Dimitrios K. Lymberopoulos, Georgios Mantas and Jun Shi, Georgios Mantas and Xiaodong Lin, Georgios Mantas and Yawen Wei, Georgios Mantas and Sachin Katti, Rudolf Ahlswede and Jonathan Rodriguez, Rudolf Ahlswede and Michelle Effros, Rudolf Ahlswede and Sachin Katti, Michelle Effros and Jonathan Rodriguez, Michelle Effros and Jun Shi, Michelle Effros and Sachin Katti, Jonathan Rodriguez and Peng Zhang, Jonathan Rodriguez and Jun Shi, Jonathan Rodriguez and Xiaodong Lin, Jonathan Rodriguez and Yawen Wei, Jonathan Rodriguez and Sachin Katti, Peng Zhang and Xiaodong Lin, Peng Zhang and Sachin Katti.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Xiaodong Lin\", \"id\": 215517}, {\"name\": \"Shweta Agrawal\", \"id\": 99621}, {\"name\": \"Maria-Anna Fengou\", \"id\": 134930}, {\"name\": \"Georgia N. Athanasiou\", \"id\": 134931}, {\"name\": \"Georgios Mantas\", \"id\": 134932}, {\"name\": \"Rudolf Ahlswede\", \"id\": 52949}, {\"name\": \"Dimitrios K. Lymberopoulos\", \"id\": 134934}, {\"name\": \"Michelle Effros\", \"id\": 124308}, {\"name\": \"Sachin Katti\", \"id\": 294623}, {\"name\": \"Jonathan Rodriguez\", \"id\": 62938}, {\"name\": \"Raymond W. Yeung\", \"id\": 31420}, {\"name\": \"Yawen Wei\", \"id\": 239933}, {\"name\": \"Jun Shi\", \"id\": 159518}, {\"name\": \"Peng Zhang\", \"id\": 1055}], \"links\": [{\"source\": 215517, \"target\": 1055}, {\"source\": 215517, \"target\": 62938}, {\"source\": 215517, \"target\": 134932}, {\"source\": 99621, \"target\": 62938}, {\"source\": 99621, \"target\": 134932}, {\"source\": 134930, \"target\": 134932}, {\"source\": 134930, \"target\": 134934}, {\"source\": 134930, \"target\": 134931}, {\"source\": 134931, \"target\": 134932}, {\"source\": 134931, \"target\": 134934}, {\"source\": 134932, \"target\": 62938}, {\"source\": 134932, \"target\": 1055}, {\"source\": 134932, \"target\": 31420}, {\"source\": 134932, \"target\": 52949}, {\"source\": 134932, \"target\": 124308}, {\"source\": 134932, \"target\": 134934}, {\"source\": 134932, \"target\": 159518}, {\"source\": 134932, \"target\": 239933}, {\"source\": 134932, \"target\": 294623}, {\"source\": 52949, \"target\": 31420}, {\"source\": 52949, \"target\": 62938}, {\"source\": 52949, \"target\": 124308}, {\"source\": 52949, \"target\": 294623}, {\"source\": 124308, \"target\": 31420}, {\"source\": 124308, \"target\": 62938}, {\"source\": 124308, \"target\": 159518}, {\"source\": 124308, \"target\": 294623}, {\"source\": 294623, \"target\": 1055}, {\"source\": 294623, \"target\": 31420}, {\"source\": 294623, \"target\": 62938}, {\"source\": 62938, \"target\": 1055}, {\"source\": 62938, \"target\": 31420}, {\"source\": 62938, \"target\": 159518}, {\"source\": 62938, \"target\": 239933}, {\"source\": 31420, \"target\": 1055}]}",
"id": 114,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Raymond W. Yeung, Shweta Agrawal, Maria-Anna Fengou, Georgia N. Athanasiou, Georgios Mantas, Rudolf Ahlswede, Dimitrios K. Lymberopoulos, Michelle Effros, Jonathan Rodriguez, Yawen Wei, Peng Zhang, Xiaodong Lin, Jun Shi, Sachin Katti\n- Research collaborations between these authors: Raymond W. Yeung and Peng Zhang, Raymond W. Yeung and Rudolf Ahlswede, Raymond W. Yeung and Michelle Effros, Raymond W. Yeung and Sachin Katti, Raymond W. Yeung and Jonathan Rodriguez, Raymond W. Yeung and Georgios Mantas, Shweta Agrawal and Jonathan Rodriguez, Shweta Agrawal and Georgios Mantas, Maria-Anna Fengou and Georgios Mantas, Maria-Anna Fengou and Dimitrios K. Lymberopoulos, Maria-Anna Fengou and Georgia N. Athanasiou, Georgia N. Athanasiou and Georgios Mantas, Georgia N. Athanasiou and Dimitrios K. Lymberopoulos, Georgios Mantas and Jonathan Rodriguez, Georgios Mantas and Peng Zhang, Georgios Mantas and Rudolf Ahlswede, Georgios Mantas and Michelle Effros, Georgios Mantas and Dimitrios K. Lymberopoulos, Georgios Mantas and Jun Shi, Georgios Mantas and Xiaodong Lin, Georgios Mantas and Yawen Wei, Georgios Mantas and Sachin Katti, Rudolf Ahlswede and Jonathan Rodriguez, Rudolf Ahlswede and Michelle Effros, Rudolf Ahlswede and Sachin Katti, Michelle Effros and Jonathan Rodriguez, Michelle Effros and Jun Shi, Michelle Effros and Sachin Katti, Jonathan Rodriguez and Peng Zhang, Jonathan Rodriguez and Jun Shi, Jonathan Rodriguez and Xiaodong Lin, Jonathan Rodriguez and Yawen Wei, Jonathan Rodriguez and Sachin Katti, Peng Zhang and Xiaodong Lin, Peng Zhang and Sachin Katti.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Joachim Kupke, Li-Hsuan Chen, Ralf Klasing, Georg Schnitger, Andreas Sprock, Bang Ye Wu, Juraj Hromkovič, Peter Widmayer, Guido Proietti, Sebastian Seibert, Selim G. Akl, Jozef Jirásek, Jérôme Monnot, Alexander Okhotin\n- Research collaborations between these authors: Joachim Kupke and Juraj Hromkovič, Joachim Kupke and Jérôme Monnot, Joachim Kupke and Sebastian Seibert, Li-Hsuan Chen and Bang Ye Wu, Li-Hsuan Chen and Juraj Hromkovič, Li-Hsuan Chen and Ralf Klasing, Li-Hsuan Chen and Sebastian Seibert, Ralf Klasing and Peter Widmayer, Ralf Klasing and Juraj Hromkovič, Ralf Klasing and Guido Proietti, Ralf Klasing and Sebastian Seibert, Ralf Klasing and Bang Ye Wu, Georg Schnitger and Selim G. Akl, Georg Schnitger and Alexander Okhotin, Georg Schnitger and Juraj Hromkovič, Georg Schnitger and Jozef Jirásek, Georg Schnitger and Sebastian Seibert, Andreas Sprock and Juraj Hromkovič, Andreas Sprock and Peter Widmayer, Andreas Sprock and Sebastian Seibert, Andreas Sprock and Jérôme Monnot, Bang Ye Wu and Juraj Hromkovič, Bang Ye Wu and Guido Proietti, Bang Ye Wu and Sebastian Seibert, Juraj Hromkovič and Peter Widmayer, Juraj Hromkovič and Guido Proietti, Juraj Hromkovič and Sebastian Seibert, Juraj Hromkovič and Jérôme Monnot, Peter Widmayer and Guido Proietti, Peter Widmayer and Sebastian Seibert, Peter Widmayer and Jérôme Monnot, Guido Proietti and Sebastian Seibert, Guido Proietti and Jérôme Monnot, Sebastian Seibert and Selim G. Akl, Sebastian Seibert and Alexander Okhotin, Sebastian Seibert and Jozef Jirásek, Sebastian Seibert and Jérôme Monnot, Selim G. Akl and Alexander Okhotin.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Joachim Kupke\", \"id\": 126304}, {\"name\": \"Li-Hsuan Chen\", \"id\": 370852}, {\"name\": \"Ralf Klasing\", \"id\": 32933}, {\"name\": \"Georg Schnitger\", \"id\": 266951}, {\"name\": \"Andreas Sprock\", \"id\": 86987}, {\"name\": \"Bang Ye Wu\", \"id\": 36588}, {\"name\": \"Juraj Hromkovi\\u010d\", \"id\": 22733}, {\"name\": \"Peter Widmayer\", \"id\": 5198}, {\"name\": \"Guido Proietti\", \"id\": 25872}, {\"name\": \"Sebastian Seibert\", \"id\": 132212}, {\"name\": \"Selim G. Akl\", \"id\": 886}, {\"name\": \"Jozef Jir\\u00e1sek\", \"id\": 32568}, {\"name\": \"J\\u00e9r\\u00f4me Monnot\", \"id\": 89177}, {\"name\": \"Alexander Okhotin\", \"id\": 1499}], \"links\": [{\"source\": 126304, \"target\": 22733}, {\"source\": 126304, \"target\": 89177}, {\"source\": 126304, \"target\": 132212}, {\"source\": 370852, \"target\": 36588}, {\"source\": 370852, \"target\": 22733}, {\"source\": 370852, \"target\": 32933}, {\"source\": 370852, \"target\": 132212}, {\"source\": 32933, \"target\": 5198}, {\"source\": 32933, \"target\": 22733}, {\"source\": 32933, \"target\": 25872}, {\"source\": 32933, \"target\": 132212}, {\"source\": 32933, \"target\": 36588}, {\"source\": 266951, \"target\": 886}, {\"source\": 266951, \"target\": 1499}, {\"source\": 266951, \"target\": 22733}, {\"source\": 266951, \"target\": 32568}, {\"source\": 266951, \"target\": 132212}, {\"source\": 86987, \"target\": 22733}, {\"source\": 86987, \"target\": 5198}, {\"source\": 86987, \"target\": 132212}, {\"source\": 86987, \"target\": 89177}, {\"source\": 36588, \"target\": 22733}, {\"source\": 36588, \"target\": 25872}, {\"source\": 36588, \"target\": 132212}, {\"source\": 22733, \"target\": 5198}, {\"source\": 22733, \"target\": 25872}, {\"source\": 22733, \"target\": 132212}, {\"source\": 22733, \"target\": 89177}, {\"source\": 5198, \"target\": 25872}, {\"source\": 5198, \"target\": 132212}, {\"source\": 5198, \"target\": 89177}, {\"source\": 25872, \"target\": 132212}, {\"source\": 25872, \"target\": 89177}, {\"source\": 132212, \"target\": 886}, {\"source\": 132212, \"target\": 1499}, {\"source\": 132212, \"target\": 32568}, {\"source\": 132212, \"target\": 89177}, {\"source\": 886, \"target\": 1499}]}",
"id": 600,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Joachim Kupke, Li-Hsuan Chen, Ralf Klasing, Georg Schnitger, Andreas Sprock, Bang Ye Wu, Juraj Hromkovič, Peter Widmayer, Guido Proietti, Sebastian Seibert, Selim G. Akl, Jozef Jirásek, Jérôme Monnot, Alexander Okhotin\n- Research collaborations between these authors: Joachim Kupke and Juraj Hromkovič, Joachim Kupke and Jérôme Monnot, Joachim Kupke and Sebastian Seibert, Li-Hsuan Chen and Bang Ye Wu, Li-Hsuan Chen and Juraj Hromkovič, Li-Hsuan Chen and Ralf Klasing, Li-Hsuan Chen and Sebastian Seibert, Ralf Klasing and Peter Widmayer, Ralf Klasing and Juraj Hromkovič, Ralf Klasing and Guido Proietti, Ralf Klasing and Sebastian Seibert, Ralf Klasing and Bang Ye Wu, Georg Schnitger and Selim G. Akl, Georg Schnitger and Alexander Okhotin, Georg Schnitger and Juraj Hromkovič, Georg Schnitger and Jozef Jirásek, Georg Schnitger and Sebastian Seibert, Andreas Sprock and Juraj Hromkovič, Andreas Sprock and Peter Widmayer, Andreas Sprock and Sebastian Seibert, Andreas Sprock and Jérôme Monnot, Bang Ye Wu and Juraj Hromkovič, Bang Ye Wu and Guido Proietti, Bang Ye Wu and Sebastian Seibert, Juraj Hromkovič and Peter Widmayer, Juraj Hromkovič and Guido Proietti, Juraj Hromkovič and Sebastian Seibert, Juraj Hromkovič and Jérôme Monnot, Peter Widmayer and Guido Proietti, Peter Widmayer and Sebastian Seibert, Peter Widmayer and Jérôme Monnot, Guido Proietti and Sebastian Seibert, Guido Proietti and Jérôme Monnot, Sebastian Seibert and Selim G. Akl, Sebastian Seibert and Alexander Okhotin, Sebastian Seibert and Jozef Jirásek, Sebastian Seibert and Jérôme Monnot, Selim G. Akl and Alexander Okhotin.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Denis V. Efimov, Elio Usai, Antonella Ferrara, Elisabetta Punta, Laurentiu Hetel, Jaime A. Moreno, Yuri B. Shtessel, Alexander S. Poznyak, Christopher Edwards, Giorgio Bartolini, Tullio Zolezzi, Sarah K. Spurgeon, Leonid Fridman, Arie Levant\n- Research collaborations between these authors: Denis V. Efimov and Christopher Edwards, Denis V. Efimov and Alexander S. Poznyak, Denis V. Efimov and Sarah K. Spurgeon, Denis V. Efimov and Leonid Fridman, Denis V. Efimov and Jaime A. Moreno, Denis V. Efimov and Arie Levant, Elio Usai and Alexander S. Poznyak, Elio Usai and Antonella Ferrara, Elio Usai and Sarah K. Spurgeon, Elio Usai and Yuri B. Shtessel, Elio Usai and Leonid Fridman, Elio Usai and Elisabetta Punta, Elio Usai and Jaime A. Moreno, Elio Usai and Christopher Edwards, Elio Usai and Arie Levant, Elio Usai and Giorgio Bartolini, Antonella Ferrara and Alexander S. Poznyak, Antonella Ferrara and Christopher Edwards, Antonella Ferrara and Yuri B. Shtessel, Antonella Ferrara and Leonid Fridman, Antonella Ferrara and Jaime A. Moreno, Antonella Ferrara and Arie Levant, Antonella Ferrara and Giorgio Bartolini, Antonella Ferrara and Elisabetta Punta, Elisabetta Punta and Leonid Fridman, Elisabetta Punta and Laurentiu Hetel, Elisabetta Punta and Christopher Edwards, Elisabetta Punta and Sarah K. Spurgeon, Elisabetta Punta and Arie Levant, Elisabetta Punta and Giorgio Bartolini, Elisabetta Punta and Tullio Zolezzi, Laurentiu Hetel and Giorgio Bartolini, Laurentiu Hetel and Tullio Zolezzi, Jaime A. Moreno and Christopher Edwards, Jaime A. Moreno and Yuri B. Shtessel, Jaime A. Moreno and Leonid Fridman, Jaime A. Moreno and Alexander S. Poznyak, Jaime A. Moreno and Arie Levant, Jaime A. Moreno and Giorgio Bartolini, Yuri B. Shtessel and Christopher Edwards, Yuri B. Shtessel and Alexander S. Poznyak, Yuri B. Shtessel and Sarah K. Spurgeon, Yuri B. Shtessel and Leonid Fridman, Yuri B. Shtessel and Arie Levant, Alexander S. Poznyak and Christopher Edwards, Alexander S. Poznyak and Sarah K. Spurgeon, Alexander S. Poznyak and Leonid Fridman, Alexander S. Poznyak and Arie Levant, Alexander S. Poznyak and Giorgio Bartolini, Christopher Edwards and Sarah K. Spurgeon, Christopher Edwards and Leonid Fridman, Christopher Edwards and Arie Levant, Christopher Edwards and Giorgio Bartolini, Giorgio Bartolini and Sarah K. Spurgeon, Giorgio Bartolini and Leonid Fridman, Giorgio Bartolini and Arie Levant, Giorgio Bartolini and Tullio Zolezzi, Tullio Zolezzi and Leonid Fridman, Tullio Zolezzi and Arie Levant, Sarah K. Spurgeon and Leonid Fridman, Sarah K. Spurgeon and Arie Levant, Leonid Fridman and Arie Levant.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Denis V. Efimov\", \"id\": 199810}, {\"name\": \"Elio Usai\", \"id\": 471654}, {\"name\": \"Antonella Ferrara\", \"id\": 260491}, {\"name\": \"Elisabetta Punta\", \"id\": 406796}, {\"name\": \"Laurentiu Hetel\", \"id\": 348397}, {\"name\": \"Jaime A. Moreno\", \"id\": 452974}, {\"name\": \"Yuri B. Shtessel\", \"id\": 285649}, {\"name\": \"Alexander S. Poznyak\", \"id\": 196148}, {\"name\": \"Christopher Edwards\", \"id\": 17558}, {\"name\": \"Giorgio Bartolini\", \"id\": 594616}, {\"name\": \"Tullio Zolezzi\", \"id\": 594617}, {\"name\": \"Sarah K. Spurgeon\", \"id\": 264186}, {\"name\": \"Leonid Fridman\", \"id\": 346814}, {\"name\": \"Arie Levant\", \"id\": 486303}], \"links\": [{\"source\": 199810, \"target\": 17558}, {\"source\": 199810, \"target\": 196148}, {\"source\": 199810, \"target\": 264186}, {\"source\": 199810, \"target\": 346814}, {\"source\": 199810, \"target\": 452974}, {\"source\": 199810, \"target\": 486303}, {\"source\": 471654, \"target\": 196148}, {\"source\": 471654, \"target\": 260491}, {\"source\": 471654, \"target\": 264186}, {\"source\": 471654, \"target\": 285649}, {\"source\": 471654, \"target\": 346814}, {\"source\": 471654, \"target\": 406796}, {\"source\": 471654, \"target\": 452974}, {\"source\": 471654, \"target\": 17558}, {\"source\": 471654, \"target\": 486303}, {\"source\": 471654, \"target\": 594616}, {\"source\": 260491, \"target\": 196148}, {\"source\": 260491, \"target\": 17558}, {\"source\": 260491, \"target\": 285649}, {\"source\": 260491, \"target\": 346814}, {\"source\": 260491, \"target\": 452974}, {\"source\": 260491, \"target\": 486303}, {\"source\": 260491, \"target\": 594616}, {\"source\": 260491, \"target\": 406796}, {\"source\": 406796, \"target\": 346814}, {\"source\": 406796, \"target\": 348397}, {\"source\": 406796, \"target\": 17558}, {\"source\": 406796, \"target\": 264186}, {\"source\": 406796, \"target\": 486303}, {\"source\": 406796, \"target\": 594616}, {\"source\": 406796, \"target\": 594617}, {\"source\": 348397, \"target\": 594616}, {\"source\": 348397, \"target\": 594617}, {\"source\": 452974, \"target\": 17558}, {\"source\": 452974, \"target\": 285649}, {\"source\": 452974, \"target\": 346814}, {\"source\": 452974, \"target\": 196148}, {\"source\": 452974, \"target\": 486303}, {\"source\": 452974, \"target\": 594616}, {\"source\": 285649, \"target\": 17558}, {\"source\": 285649, \"target\": 196148}, {\"source\": 285649, \"target\": 264186}, {\"source\": 285649, \"target\": 346814}, {\"source\": 285649, \"target\": 486303}, {\"source\": 196148, \"target\": 17558}, {\"source\": 196148, \"target\": 264186}, {\"source\": 196148, \"target\": 346814}, {\"source\": 196148, \"target\": 486303}, {\"source\": 196148, \"target\": 594616}, {\"source\": 17558, \"target\": 264186}, {\"source\": 17558, \"target\": 346814}, {\"source\": 17558, \"target\": 486303}, {\"source\": 17558, \"target\": 594616}, {\"source\": 594616, \"target\": 264186}, {\"source\": 594616, \"target\": 346814}, {\"source\": 594616, \"target\": 486303}, {\"source\": 594616, \"target\": 594617}, {\"source\": 594617, \"target\": 346814}, {\"source\": 594617, \"target\": 486303}, {\"source\": 264186, \"target\": 346814}, {\"source\": 264186, \"target\": 486303}, {\"source\": 346814, \"target\": 486303}]}",
"id": 2502,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Denis V. Efimov, Elio Usai, Antonella Ferrara, Elisabetta Punta, Laurentiu Hetel, Jaime A. Moreno, Yuri B. Shtessel, Alexander S. Poznyak, Christopher Edwards, Giorgio Bartolini, Tullio Zolezzi, Sarah K. Spurgeon, Leonid Fridman, Arie Levant\n- Research collaborations between these authors: Denis V. Efimov and Christopher Edwards, Denis V. Efimov and Alexander S. Poznyak, Denis V. Efimov and Sarah K. Spurgeon, Denis V. Efimov and Leonid Fridman, Denis V. Efimov and Jaime A. Moreno, Denis V. Efimov and Arie Levant, Elio Usai and Alexander S. Poznyak, Elio Usai and Antonella Ferrara, Elio Usai and Sarah K. Spurgeon, Elio Usai and Yuri B. Shtessel, Elio Usai and Leonid Fridman, Elio Usai and Elisabetta Punta, Elio Usai and Jaime A. Moreno, Elio Usai and Christopher Edwards, Elio Usai and Arie Levant, Elio Usai and Giorgio Bartolini, Antonella Ferrara and Alexander S. Poznyak, Antonella Ferrara and Christopher Edwards, Antonella Ferrara and Yuri B. Shtessel, Antonella Ferrara and Leonid Fridman, Antonella Ferrara and Jaime A. Moreno, Antonella Ferrara and Arie Levant, Antonella Ferrara and Giorgio Bartolini, Antonella Ferrara and Elisabetta Punta, Elisabetta Punta and Leonid Fridman, Elisabetta Punta and Laurentiu Hetel, Elisabetta Punta and Christopher Edwards, Elisabetta Punta and Sarah K. Spurgeon, Elisabetta Punta and Arie Levant, Elisabetta Punta and Giorgio Bartolini, Elisabetta Punta and Tullio Zolezzi, Laurentiu Hetel and Giorgio Bartolini, Laurentiu Hetel and Tullio Zolezzi, Jaime A. Moreno and Christopher Edwards, Jaime A. Moreno and Yuri B. Shtessel, Jaime A. Moreno and Leonid Fridman, Jaime A. Moreno and Alexander S. Poznyak, Jaime A. Moreno and Arie Levant, Jaime A. Moreno and Giorgio Bartolini, Yuri B. Shtessel and Christopher Edwards, Yuri B. Shtessel and Alexander S. Poznyak, Yuri B. Shtessel and Sarah K. Spurgeon, Yuri B. Shtessel and Leonid Fridman, Yuri B. Shtessel and Arie Levant, Alexander S. Poznyak and Christopher Edwards, Alexander S. Poznyak and Sarah K. Spurgeon, Alexander S. Poznyak and Leonid Fridman, Alexander S. Poznyak and Arie Levant, Alexander S. Poznyak and Giorgio Bartolini, Christopher Edwards and Sarah K. Spurgeon, Christopher Edwards and Leonid Fridman, Christopher Edwards and Arie Levant, Christopher Edwards and Giorgio Bartolini, Giorgio Bartolini and Sarah K. Spurgeon, Giorgio Bartolini and Leonid Fridman, Giorgio Bartolini and Arie Levant, Giorgio Bartolini and Tullio Zolezzi, Tullio Zolezzi and Leonid Fridman, Tullio Zolezzi and Arie Levant, Sarah K. Spurgeon and Leonid Fridman, Sarah K. Spurgeon and Arie Levant, Leonid Fridman and Arie Levant.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jongdae Jung, Stephen Se, Sebastian Thrun, Mario E. Munich, Su-Yong An, Neil D. Lawrence, Woo Yeon Jeong, Jens-Steffen Gutmann, Se-Young Oh, Wolfram Burgard, Christoph Stiller, Philip Fong, Seongsoo Lee, Jae Bok Song\n- Research collaborations between these authors: Jongdae Jung and Wolfram Burgard, Jongdae Jung and Sebastian Thrun, Jongdae Jung and Mario E. Munich, Jongdae Jung and Jens-Steffen Gutmann, Jongdae Jung and Philip Fong, Stephen Se and Wolfram Burgard, Stephen Se and Jae Bok Song, Stephen Se and Su-Yong An, Stephen Se and Se-Young Oh, Sebastian Thrun and Wolfram Burgard, Sebastian Thrun and Christoph Stiller, Sebastian Thrun and Mario E. Munich, Sebastian Thrun and Jens-Steffen Gutmann, Sebastian Thrun and Jae Bok Song, Sebastian Thrun and Philip Fong, Sebastian Thrun and Su-Yong An, Sebastian Thrun and Se-Young Oh, Sebastian Thrun and Seongsoo Lee, Mario E. Munich and Wolfram Burgard, Mario E. Munich and Neil D. Lawrence, Mario E. Munich and Jens-Steffen Gutmann, Mario E. Munich and Philip Fong, Mario E. Munich and Woo Yeon Jeong, Su-Yong An and Wolfram Burgard, Su-Yong An and Se-Young Oh, Su-Yong An and Woo Yeon Jeong, Neil D. Lawrence and Wolfram Burgard, Neil D. Lawrence and Jens-Steffen Gutmann, Neil D. Lawrence and Philip Fong, Woo Yeon Jeong and Jens-Steffen Gutmann, Woo Yeon Jeong and Jae Bok Song, Woo Yeon Jeong and Philip Fong, Woo Yeon Jeong and Se-Young Oh, Woo Yeon Jeong and Seongsoo Lee, Jens-Steffen Gutmann and Wolfram Burgard, Jens-Steffen Gutmann and Philip Fong, Se-Young Oh and Wolfram Burgard, Wolfram Burgard and Christoph Stiller, Wolfram Burgard and Philip Fong, Wolfram Burgard and Jae Bok Song, Wolfram Burgard and Seongsoo Lee, Christoph Stiller and Philip Fong.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Stephen Se\", \"id\": 676770}, {\"name\": \"Jongdae Jung\", \"id\": 67426}, {\"name\": \"Sebastian Thrun\", \"id\": 54500}, {\"name\": \"Mario E. Munich\", \"id\": 85894}, {\"name\": \"Su-Yong An\", \"id\": 211722}, {\"name\": \"Neil D. Lawrence\", \"id\": 108490}, {\"name\": \"Woo Yeon Jeong\", \"id\": 943244}, {\"name\": \"Jens-Steffen Gutmann\", \"id\": 125196}, {\"name\": \"Se-Young Oh\", \"id\": 211724}, {\"name\": \"Wolfram Burgard\", \"id\": 3120}, {\"name\": \"Christoph Stiller\", \"id\": 70449}, {\"name\": \"Philip Fong\", \"id\": 202938}, {\"name\": \"Seongsoo Lee\", \"id\": 222172}, {\"name\": \"Jae Bok Song\", \"id\": 135966}], \"links\": [{\"source\": 676770, \"target\": 3120}, {\"source\": 676770, \"target\": 135966}, {\"source\": 676770, \"target\": 211722}, {\"source\": 676770, \"target\": 211724}, {\"source\": 67426, \"target\": 3120}, {\"source\": 67426, \"target\": 54500}, {\"source\": 67426, \"target\": 85894}, {\"source\": 67426, \"target\": 125196}, {\"source\": 67426, \"target\": 202938}, {\"source\": 54500, \"target\": 3120}, {\"source\": 54500, \"target\": 70449}, {\"source\": 54500, \"target\": 85894}, {\"source\": 54500, \"target\": 125196}, {\"source\": 54500, \"target\": 135966}, {\"source\": 54500, \"target\": 202938}, {\"source\": 54500, \"target\": 211722}, {\"source\": 54500, \"target\": 211724}, {\"source\": 54500, \"target\": 222172}, {\"source\": 85894, \"target\": 3120}, {\"source\": 85894, \"target\": 108490}, {\"source\": 85894, \"target\": 125196}, {\"source\": 85894, \"target\": 202938}, {\"source\": 85894, \"target\": 943244}, {\"source\": 211722, \"target\": 3120}, {\"source\": 211722, \"target\": 211724}, {\"source\": 211722, \"target\": 943244}, {\"source\": 108490, \"target\": 3120}, {\"source\": 108490, \"target\": 125196}, {\"source\": 108490, \"target\": 202938}, {\"source\": 943244, \"target\": 125196}, {\"source\": 943244, \"target\": 135966}, {\"source\": 943244, \"target\": 202938}, {\"source\": 943244, \"target\": 211724}, {\"source\": 943244, \"target\": 222172}, {\"source\": 125196, \"target\": 3120}, {\"source\": 125196, \"target\": 202938}, {\"source\": 211724, \"target\": 3120}, {\"source\": 3120, \"target\": 70449}, {\"source\": 3120, \"target\": 202938}, {\"source\": 3120, \"target\": 135966}, {\"source\": 3120, \"target\": 222172}, {\"source\": 70449, \"target\": 202938}]}",
"id": 767,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jongdae Jung, Stephen Se, Sebastian Thrun, Mario E. Munich, Su-Yong An, Neil D. Lawrence, Woo Yeon Jeong, Jens-Steffen Gutmann, Se-Young Oh, Wolfram Burgard, Christoph Stiller, Philip Fong, Seongsoo Lee, Jae Bok Song\n- Research collaborations between these authors: Jongdae Jung and Wolfram Burgard, Jongdae Jung and Sebastian Thrun, Jongdae Jung and Mario E. Munich, Jongdae Jung and Jens-Steffen Gutmann, Jongdae Jung and Philip Fong, Stephen Se and Wolfram Burgard, Stephen Se and Jae Bok Song, Stephen Se and Su-Yong An, Stephen Se and Se-Young Oh, Sebastian Thrun and Wolfram Burgard, Sebastian Thrun and Christoph Stiller, Sebastian Thrun and Mario E. Munich, Sebastian Thrun and Jens-Steffen Gutmann, Sebastian Thrun and Jae Bok Song, Sebastian Thrun and Philip Fong, Sebastian Thrun and Su-Yong An, Sebastian Thrun and Se-Young Oh, Sebastian Thrun and Seongsoo Lee, Mario E. Munich and Wolfram Burgard, Mario E. Munich and Neil D. Lawrence, Mario E. Munich and Jens-Steffen Gutmann, Mario E. Munich and Philip Fong, Mario E. Munich and Woo Yeon Jeong, Su-Yong An and Wolfram Burgard, Su-Yong An and Se-Young Oh, Su-Yong An and Woo Yeon Jeong, Neil D. Lawrence and Wolfram Burgard, Neil D. Lawrence and Jens-Steffen Gutmann, Neil D. Lawrence and Philip Fong, Woo Yeon Jeong and Jens-Steffen Gutmann, Woo Yeon Jeong and Jae Bok Song, Woo Yeon Jeong and Philip Fong, Woo Yeon Jeong and Se-Young Oh, Woo Yeon Jeong and Seongsoo Lee, Jens-Steffen Gutmann and Wolfram Burgard, Jens-Steffen Gutmann and Philip Fong, Se-Young Oh and Wolfram Burgard, Wolfram Burgard and Christoph Stiller, Wolfram Burgard and Philip Fong, Wolfram Burgard and Jae Bok Song, Wolfram Burgard and Seongsoo Lee, Christoph Stiller and Philip Fong.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Werner Esswein, Jörg Becker, Ron Weber, Gunnar Dietz, Martin Juhrisch, Michael Räckers, Yair Wand, Daniel Pfeiffer, Richard Braun, Michael Rosemann, John Mylopoulos, Marco Pistore, Peter F. Green, Andreas Gehlert\n- Research collaborations between these authors: Werner Esswein and Gunnar Dietz, Werner Esswein and Martin Juhrisch, Werner Esswein and Jörg Becker, Werner Esswein and Michael Rosemann, Werner Esswein and Peter F. Green, Werner Esswein and Yair Wand, Werner Esswein and Daniel Pfeiffer, Werner Esswein and Richard Braun, Werner Esswein and Andreas Gehlert, Jörg Becker and Michael Rosemann, Jörg Becker and Peter F. Green, Jörg Becker and Yair Wand, Jörg Becker and Ron Weber, Jörg Becker and Daniel Pfeiffer, Jörg Becker and Michael Räckers, Jörg Becker and Andreas Gehlert, Jörg Becker and Gunnar Dietz, Jörg Becker and Martin Juhrisch, Ron Weber and Michael Rosemann, Ron Weber and Peter F. Green, Ron Weber and Yair Wand, Ron Weber and Daniel Pfeiffer, Ron Weber and Michael Räckers, Ron Weber and Andreas Gehlert, Gunnar Dietz and Martin Juhrisch, Gunnar Dietz and Daniel Pfeiffer, Gunnar Dietz and Michael Räckers, Gunnar Dietz and Andreas Gehlert, Martin Juhrisch and Yair Wand, Martin Juhrisch and Daniel Pfeiffer, Martin Juhrisch and Michael Räckers, Martin Juhrisch and Andreas Gehlert, Michael Räckers and Daniel Pfeiffer, Michael Räckers and Michael Rosemann, Michael Räckers and Peter F. Green, Michael Räckers and Andreas Gehlert, Yair Wand and Michael Rosemann, Yair Wand and Peter F. Green, Yair Wand and Daniel Pfeiffer, Yair Wand and Richard Braun, Yair Wand and Andreas Gehlert, Daniel Pfeiffer and Michael Rosemann, Daniel Pfeiffer and Andreas Gehlert, Daniel Pfeiffer and Richard Braun, Richard Braun and Andreas Gehlert, Michael Rosemann and Peter F. Green, Michael Rosemann and Andreas Gehlert, John Mylopoulos and Marco Pistore, John Mylopoulos and Andreas Gehlert, Marco Pistore and Andreas Gehlert, Peter F. Green and Andreas Gehlert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Werner Esswein\", \"id\": 52448}, {\"name\": \"J\\u00f6rg Becker\", \"id\": 704}, {\"name\": \"Ron Weber\", \"id\": 36581}, {\"name\": \"Gunnar Dietz\", \"id\": 16781}, {\"name\": \"Martin Juhrisch\", \"id\": 16782}, {\"name\": \"Michael R\\u00e4ckers\", \"id\": 62384}, {\"name\": \"Yair Wand\", \"id\": 15122}, {\"name\": \"Daniel Pfeiffer\", \"id\": 51571}, {\"name\": \"Richard Braun\", \"id\": 83348}, {\"name\": \"Michael Rosemann\", \"id\": 5173}, {\"name\": \"John Mylopoulos\", \"id\": 3283}, {\"name\": \"Peter F. Green\", \"id\": 9882}, {\"name\": \"Marco Pistore\", \"id\": 7898}, {\"name\": \"Andreas Gehlert\", \"id\": 83836}], \"links\": [{\"source\": 52448, \"target\": 16781}, {\"source\": 52448, \"target\": 16782}, {\"source\": 52448, \"target\": 704}, {\"source\": 52448, \"target\": 5173}, {\"source\": 52448, \"target\": 9882}, {\"source\": 52448, \"target\": 15122}, {\"source\": 52448, \"target\": 51571}, {\"source\": 52448, \"target\": 83348}, {\"source\": 52448, \"target\": 83836}, {\"source\": 704, \"target\": 5173}, {\"source\": 704, \"target\": 9882}, {\"source\": 704, \"target\": 15122}, {\"source\": 704, \"target\": 36581}, {\"source\": 704, \"target\": 51571}, {\"source\": 704, \"target\": 62384}, {\"source\": 704, \"target\": 83836}, {\"source\": 704, \"target\": 16781}, {\"source\": 704, \"target\": 16782}, {\"source\": 36581, \"target\": 5173}, {\"source\": 36581, \"target\": 9882}, {\"source\": 36581, \"target\": 15122}, {\"source\": 36581, \"target\": 51571}, {\"source\": 36581, \"target\": 62384}, {\"source\": 36581, \"target\": 83836}, {\"source\": 16781, \"target\": 16782}, {\"source\": 16781, \"target\": 51571}, {\"source\": 16781, \"target\": 62384}, {\"source\": 16781, \"target\": 83836}, {\"source\": 16782, \"target\": 15122}, {\"source\": 16782, \"target\": 51571}, {\"source\": 16782, \"target\": 62384}, {\"source\": 16782, \"target\": 83836}, {\"source\": 62384, \"target\": 51571}, {\"source\": 62384, \"target\": 5173}, {\"source\": 62384, \"target\": 9882}, {\"source\": 62384, \"target\": 83836}, {\"source\": 15122, \"target\": 5173}, {\"source\": 15122, \"target\": 9882}, {\"source\": 15122, \"target\": 51571}, {\"source\": 15122, \"target\": 83348}, {\"source\": 15122, \"target\": 83836}, {\"source\": 51571, \"target\": 5173}, {\"source\": 51571, \"target\": 83836}, {\"source\": 51571, \"target\": 83348}, {\"source\": 83348, \"target\": 83836}, {\"source\": 5173, \"target\": 9882}, {\"source\": 5173, \"target\": 83836}, {\"source\": 3283, \"target\": 7898}, {\"source\": 3283, \"target\": 83836}, {\"source\": 9882, \"target\": 83836}, {\"source\": 7898, \"target\": 83836}]}",
"id": 882,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Werner Esswein, Jörg Becker, Ron Weber, Gunnar Dietz, Martin Juhrisch, Michael Räckers, Yair Wand, Daniel Pfeiffer, Richard Braun, Michael Rosemann, John Mylopoulos, Marco Pistore, Peter F. Green, Andreas Gehlert\n- Research collaborations between these authors: Werner Esswein and Gunnar Dietz, Werner Esswein and Martin Juhrisch, Werner Esswein and Jörg Becker, Werner Esswein and Michael Rosemann, Werner Esswein and Peter F. Green, Werner Esswein and Yair Wand, Werner Esswein and Daniel Pfeiffer, Werner Esswein and Richard Braun, Werner Esswein and Andreas Gehlert, Jörg Becker and Michael Rosemann, Jörg Becker and Peter F. Green, Jörg Becker and Yair Wand, Jörg Becker and Ron Weber, Jörg Becker and Daniel Pfeiffer, Jörg Becker and Michael Räckers, Jörg Becker and Andreas Gehlert, Jörg Becker and Gunnar Dietz, Jörg Becker and Martin Juhrisch, Ron Weber and Michael Rosemann, Ron Weber and Peter F. Green, Ron Weber and Yair Wand, Ron Weber and Daniel Pfeiffer, Ron Weber and Michael Räckers, Ron Weber and Andreas Gehlert, Gunnar Dietz and Martin Juhrisch, Gunnar Dietz and Daniel Pfeiffer, Gunnar Dietz and Michael Räckers, Gunnar Dietz and Andreas Gehlert, Martin Juhrisch and Yair Wand, Martin Juhrisch and Daniel Pfeiffer, Martin Juhrisch and Michael Räckers, Martin Juhrisch and Andreas Gehlert, Michael Räckers and Daniel Pfeiffer, Michael Räckers and Michael Rosemann, Michael Räckers and Peter F. Green, Michael Räckers and Andreas Gehlert, Yair Wand and Michael Rosemann, Yair Wand and Peter F. Green, Yair Wand and Daniel Pfeiffer, Yair Wand and Richard Braun, Yair Wand and Andreas Gehlert, Daniel Pfeiffer and Michael Rosemann, Daniel Pfeiffer and Andreas Gehlert, Daniel Pfeiffer and Richard Braun, Richard Braun and Andreas Gehlert, Michael Rosemann and Peter F. Green, Michael Rosemann and Andreas Gehlert, John Mylopoulos and Marco Pistore, John Mylopoulos and Andreas Gehlert, Marco Pistore and Andreas Gehlert, Peter F. Green and Andreas Gehlert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Mark Brown, Sara Price, Cordelia Schmid, Laura Malinverni, Takehiro Inohara, Miin-Shen Yang, Vincent Lepetit, Paddy Nixon, Michael Brady, Timor Kadir, Luis Ferraz, Francesc Moreno-Noguer, Bieke Zaman, Vero Vanden Abeele\n- Research collaborations between these authors: Mark Brown and Michael Brady, Mark Brown and Francesc Moreno-Noguer, Mark Brown and Timor Kadir, Mark Brown and Sara Price, Sara Price and Paddy Nixon, Sara Price and Vero Vanden Abeele, Sara Price and Bieke Zaman, Sara Price and Laura Malinverni, Cordelia Schmid and Vincent Lepetit, Cordelia Schmid and Michael Brady, Cordelia Schmid and Francesc Moreno-Noguer, Cordelia Schmid and Timor Kadir, Cordelia Schmid and Luis Ferraz, Vincent Lepetit and Francesc Moreno-Noguer, Vincent Lepetit and Timor Kadir, Vincent Lepetit and Luis Ferraz, Michael Brady and Timor Kadir, Timor Kadir and Luis Ferraz, Luis Ferraz and Francesc Moreno-Noguer, Bieke Zaman and Vero Vanden Abeele.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Mark Brown\", \"id\": 194240}, {\"name\": \"Sara Price\", \"id\": 302785}, {\"name\": \"Cordelia Schmid\", \"id\": 46147}, {\"name\": \"Laura Malinverni\", \"id\": 677125}, {\"name\": \"Takehiro Inohara\", \"id\": 211115}, {\"name\": \"Miin-Shen Yang\", \"id\": 65103}, {\"name\": \"Vincent Lepetit\", \"id\": 69551}, {\"name\": \"Paddy Nixon\", \"id\": 24047}, {\"name\": \"Michael Brady\", \"id\": 82322}, {\"name\": \"Timor Kadir\", \"id\": 288980}, {\"name\": \"Luis Ferraz\", \"id\": 155766}, {\"name\": \"Francesc Moreno-Noguer\", \"id\": 189851}, {\"name\": \"Bieke Zaman\", \"id\": 374459}, {\"name\": \"Vero Vanden Abeele\", \"id\": 148574}], \"links\": [{\"source\": 194240, \"target\": 82322}, {\"source\": 194240, \"target\": 189851}, {\"source\": 194240, \"target\": 288980}, {\"source\": 194240, \"target\": 302785}, {\"source\": 302785, \"target\": 24047}, {\"source\": 302785, \"target\": 148574}, {\"source\": 302785, \"target\": 374459}, {\"source\": 302785, \"target\": 677125}, {\"source\": 46147, \"target\": 69551}, {\"source\": 46147, \"target\": 82322}, {\"source\": 46147, \"target\": 189851}, {\"source\": 46147, \"target\": 288980}, {\"source\": 46147, \"target\": 155766}, {\"source\": 69551, \"target\": 189851}, {\"source\": 69551, \"target\": 288980}, {\"source\": 69551, \"target\": 155766}, {\"source\": 82322, \"target\": 288980}, {\"source\": 288980, \"target\": 155766}, {\"source\": 155766, \"target\": 189851}, {\"source\": 374459, \"target\": 148574}]}",
"id": 2449,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Mark Brown, Sara Price, Cordelia Schmid, Laura Malinverni, Takehiro Inohara, Miin-Shen Yang, Vincent Lepetit, Paddy Nixon, Michael Brady, Timor Kadir, Luis Ferraz, Francesc Moreno-Noguer, Bieke Zaman, Vero Vanden Abeele\n- Research collaborations between these authors: Mark Brown and Michael Brady, Mark Brown and Francesc Moreno-Noguer, Mark Brown and Timor Kadir, Mark Brown and Sara Price, Sara Price and Paddy Nixon, Sara Price and Vero Vanden Abeele, Sara Price and Bieke Zaman, Sara Price and Laura Malinverni, Cordelia Schmid and Vincent Lepetit, Cordelia Schmid and Michael Brady, Cordelia Schmid and Francesc Moreno-Noguer, Cordelia Schmid and Timor Kadir, Cordelia Schmid and Luis Ferraz, Vincent Lepetit and Francesc Moreno-Noguer, Vincent Lepetit and Timor Kadir, Vincent Lepetit and Luis Ferraz, Michael Brady and Timor Kadir, Timor Kadir and Luis Ferraz, Luis Ferraz and Francesc Moreno-Noguer, Bieke Zaman and Vero Vanden Abeele.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Péter Kacsuk, Tristan Glatard, Natacha Beck, Nicholas Ayache, D. Louis Collins, Robert Woitsch, Carl Kesselman, Sílvia Delgado Olabarriaga, Reza Adalat, Ewa Deelman, Johan Montagnat, Gurmeet Singh, Alan C. Evans, Samir Das\n- Research collaborations between these authors: Péter Kacsuk and Carl Kesselman, Péter Kacsuk and Ewa Deelman, Péter Kacsuk and Johan Montagnat, Péter Kacsuk and Gurmeet Singh, Péter Kacsuk and Sílvia Delgado Olabarriaga, Péter Kacsuk and Tristan Glatard, Péter Kacsuk and Alan C. Evans, Péter Kacsuk and Samir Das, Péter Kacsuk and Reza Adalat, Péter Kacsuk and Natacha Beck, Tristan Glatard and Ewa Deelman, Tristan Glatard and Johan Montagnat, Tristan Glatard and Sílvia Delgado Olabarriaga, Tristan Glatard and Nicholas Ayache, Tristan Glatard and Carl Kesselman, Tristan Glatard and Gurmeet Singh, Tristan Glatard and Alan C. Evans, Tristan Glatard and Samir Das, Tristan Glatard and Reza Adalat, Tristan Glatard and Natacha Beck, Natacha Beck and Alan C. Evans, Natacha Beck and Reza Adalat, Natacha Beck and Johan Montagnat, Natacha Beck and Sílvia Delgado Olabarriaga, Nicholas Ayache and D. Louis Collins, Nicholas Ayache and Johan Montagnat, Nicholas Ayache and Alan C. Evans, D. Louis Collins and Alan C. Evans, D. Louis Collins and Samir Das, D. Louis Collins and Reza Adalat, Carl Kesselman and Ewa Deelman, Carl Kesselman and Gurmeet Singh, Carl Kesselman and Johan Montagnat, Carl Kesselman and Sílvia Delgado Olabarriaga, Sílvia Delgado Olabarriaga and Johan Montagnat, Sílvia Delgado Olabarriaga and Ewa Deelman, Sílvia Delgado Olabarriaga and Gurmeet Singh, Sílvia Delgado Olabarriaga and Alan C. Evans, Sílvia Delgado Olabarriaga and Samir Das, Sílvia Delgado Olabarriaga and Reza Adalat, Reza Adalat and Alan C. Evans, Reza Adalat and Samir Das, Reza Adalat and Ewa Deelman, Reza Adalat and Johan Montagnat, Ewa Deelman and Johan Montagnat, Ewa Deelman and Gurmeet Singh, Ewa Deelman and Alan C. Evans, Johan Montagnat and Alan C. Evans, Johan Montagnat and Samir Das, Alan C. Evans and Samir Das.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"P\\u00e9ter Kacsuk\", \"id\": 54466}, {\"name\": \"Tristan Glatard\", \"id\": 194371}, {\"name\": \"Natacha Beck\", \"id\": 936484}, {\"name\": \"Nicholas Ayache\", \"id\": 740}, {\"name\": \"D. Louis Collins\", \"id\": 10723}, {\"name\": \"Robert Woitsch\", \"id\": 33766}, {\"name\": \"Carl Kesselman\", \"id\": 33608}, {\"name\": \"S\\u00edlvia Delgado Olabarriaga\", \"id\": 171369}, {\"name\": \"Reza Adalat\", \"id\": 433706}, {\"name\": \"Ewa Deelman\", \"id\": 59402}, {\"name\": \"Samir Das\", \"id\": 433695}, {\"name\": \"Johan Montagnat\", \"id\": 163567}, {\"name\": \"Alan C. Evans\", \"id\": 237339}, {\"name\": \"Gurmeet Singh\", \"id\": 172927}], \"links\": [{\"source\": 54466, \"target\": 33608}, {\"source\": 54466, \"target\": 59402}, {\"source\": 54466, \"target\": 163567}, {\"source\": 54466, \"target\": 172927}, {\"source\": 54466, \"target\": 171369}, {\"source\": 54466, \"target\": 194371}, {\"source\": 54466, \"target\": 237339}, {\"source\": 54466, \"target\": 433695}, {\"source\": 54466, \"target\": 433706}, {\"source\": 54466, \"target\": 936484}, {\"source\": 194371, \"target\": 59402}, {\"source\": 194371, \"target\": 163567}, {\"source\": 194371, \"target\": 171369}, {\"source\": 194371, \"target\": 740}, {\"source\": 194371, \"target\": 33608}, {\"source\": 194371, \"target\": 172927}, {\"source\": 194371, \"target\": 237339}, {\"source\": 194371, \"target\": 433695}, {\"source\": 194371, \"target\": 433706}, {\"source\": 194371, \"target\": 936484}, {\"source\": 936484, \"target\": 237339}, {\"source\": 936484, \"target\": 433706}, {\"source\": 936484, \"target\": 163567}, {\"source\": 936484, \"target\": 171369}, {\"source\": 740, \"target\": 10723}, {\"source\": 740, \"target\": 163567}, {\"source\": 740, \"target\": 237339}, {\"source\": 10723, \"target\": 237339}, {\"source\": 10723, \"target\": 433695}, {\"source\": 10723, \"target\": 433706}, {\"source\": 33608, \"target\": 59402}, {\"source\": 33608, \"target\": 172927}, {\"source\": 33608, \"target\": 163567}, {\"source\": 33608, \"target\": 171369}, {\"source\": 171369, \"target\": 163567}, {\"source\": 171369, \"target\": 59402}, {\"source\": 171369, \"target\": 172927}, {\"source\": 171369, \"target\": 237339}, {\"source\": 171369, \"target\": 433695}, {\"source\": 171369, \"target\": 433706}, {\"source\": 433706, \"target\": 237339}, {\"source\": 433706, \"target\": 433695}, {\"source\": 433706, \"target\": 59402}, {\"source\": 433706, \"target\": 163567}, {\"source\": 59402, \"target\": 163567}, {\"source\": 59402, \"target\": 172927}, {\"source\": 59402, \"target\": 237339}, {\"source\": 433695, \"target\": 237339}, {\"source\": 433695, \"target\": 163567}, {\"source\": 163567, \"target\": 237339}]}",
"id": 500,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Péter Kacsuk, Tristan Glatard, Natacha Beck, Nicholas Ayache, D. Louis Collins, Robert Woitsch, Carl Kesselman, Sílvia Delgado Olabarriaga, Reza Adalat, Ewa Deelman, Johan Montagnat, Gurmeet Singh, Alan C. Evans, Samir Das\n- Research collaborations between these authors: Péter Kacsuk and Carl Kesselman, Péter Kacsuk and Ewa Deelman, Péter Kacsuk and Johan Montagnat, Péter Kacsuk and Gurmeet Singh, Péter Kacsuk and Sílvia Delgado Olabarriaga, Péter Kacsuk and Tristan Glatard, Péter Kacsuk and Alan C. Evans, Péter Kacsuk and Samir Das, Péter Kacsuk and Reza Adalat, Péter Kacsuk and Natacha Beck, Tristan Glatard and Ewa Deelman, Tristan Glatard and Johan Montagnat, Tristan Glatard and Sílvia Delgado Olabarriaga, Tristan Glatard and Nicholas Ayache, Tristan Glatard and Carl Kesselman, Tristan Glatard and Gurmeet Singh, Tristan Glatard and Alan C. Evans, Tristan Glatard and Samir Das, Tristan Glatard and Reza Adalat, Tristan Glatard and Natacha Beck, Natacha Beck and Alan C. Evans, Natacha Beck and Reza Adalat, Natacha Beck and Johan Montagnat, Natacha Beck and Sílvia Delgado Olabarriaga, Nicholas Ayache and D. Louis Collins, Nicholas Ayache and Johan Montagnat, Nicholas Ayache and Alan C. Evans, D. Louis Collins and Alan C. Evans, D. Louis Collins and Samir Das, D. Louis Collins and Reza Adalat, Carl Kesselman and Ewa Deelman, Carl Kesselman and Gurmeet Singh, Carl Kesselman and Johan Montagnat, Carl Kesselman and Sílvia Delgado Olabarriaga, Sílvia Delgado Olabarriaga and Johan Montagnat, Sílvia Delgado Olabarriaga and Ewa Deelman, Sílvia Delgado Olabarriaga and Gurmeet Singh, Sílvia Delgado Olabarriaga and Alan C. Evans, Sílvia Delgado Olabarriaga and Samir Das, Sílvia Delgado Olabarriaga and Reza Adalat, Reza Adalat and Alan C. Evans, Reza Adalat and Samir Das, Reza Adalat and Ewa Deelman, Reza Adalat and Johan Montagnat, Ewa Deelman and Johan Montagnat, Ewa Deelman and Gurmeet Singh, Ewa Deelman and Alan C. Evans, Johan Montagnat and Alan C. Evans, Johan Montagnat and Samir Das, Alan C. Evans and Samir Das.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ja-Ling Wu, Jitendra Malik, Josep Lladós, Jiri Matas, Eenjun Hwang, Liu Wenyin, Kuok Wai He, David M. Blei, Vesa T. Peltonen, Feng Su, Faisal Shafait, Byeong-jun Han, Michael I. Jordan, Antti Eronen\n- Research collaborations between these authors: Ja-Ling Wu and Feng Su, Jitendra Malik and Faisal Shafait, Jitendra Malik and Josep Lladós, Jitendra Malik and Michael I. Jordan, Jitendra Malik and Feng Su, Jitendra Malik and David M. Blei, Jitendra Malik and Jiri Matas, Josep Lladós and Faisal Shafait, Josep Lladós and Liu Wenyin, Josep Lladós and Jiri Matas, Josep Lladós and Feng Su, Jiri Matas and Faisal Shafait, Jiri Matas and Eenjun Hwang, Jiri Matas and Feng Su, Eenjun Hwang and Byeong-jun Han, Eenjun Hwang and Feng Su, Liu Wenyin and Feng Su, Kuok Wai He and Feng Su, David M. Blei and Feng Su, David M. Blei and Michael I. Jordan, Vesa T. Peltonen and Feng Su, Vesa T. Peltonen and Antti Eronen, Feng Su and Faisal Shafait, Feng Su and Michael I. Jordan, Feng Su and Antti Eronen, Feng Su and Byeong-jun Han.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Ja-Ling Wu\", \"id\": 35490}, {\"name\": \"Jitendra Malik\", \"id\": 32931}, {\"name\": \"Josep Llad\\u00f3s\", \"id\": 10565}, {\"name\": \"Jiri Matas\", \"id\": 164518}, {\"name\": \"Eenjun Hwang\", \"id\": 19818}, {\"name\": \"Liu Wenyin\", \"id\": 23883}, {\"name\": \"Kuok Wai He\", \"id\": 1038188}, {\"name\": \"David M. Blei\", \"id\": 80075}, {\"name\": \"Vesa T. Peltonen\", \"id\": 857262}, {\"name\": \"Feng Su\", \"id\": 41584}, {\"name\": \"Faisal Shafait\", \"id\": 6386}, {\"name\": \"Byeong-jun Han\", \"id\": 623922}, {\"name\": \"Michael I. Jordan\", \"id\": 49878}, {\"name\": \"Antti Eronen\", \"id\": 309215}], \"links\": [{\"source\": 35490, \"target\": 41584}, {\"source\": 32931, \"target\": 6386}, {\"source\": 32931, \"target\": 10565}, {\"source\": 32931, \"target\": 49878}, {\"source\": 32931, \"target\": 41584}, {\"source\": 32931, \"target\": 80075}, {\"source\": 32931, \"target\": 164518}, {\"source\": 10565, \"target\": 6386}, {\"source\": 10565, \"target\": 23883}, {\"source\": 10565, \"target\": 164518}, {\"source\": 10565, \"target\": 41584}, {\"source\": 164518, \"target\": 6386}, {\"source\": 164518, \"target\": 19818}, {\"source\": 164518, \"target\": 41584}, {\"source\": 19818, \"target\": 623922}, {\"source\": 19818, \"target\": 41584}, {\"source\": 23883, \"target\": 41584}, {\"source\": 1038188, \"target\": 41584}, {\"source\": 80075, \"target\": 41584}, {\"source\": 80075, \"target\": 49878}, {\"source\": 857262, \"target\": 41584}, {\"source\": 857262, \"target\": 309215}, {\"source\": 41584, \"target\": 6386}, {\"source\": 41584, \"target\": 49878}, {\"source\": 41584, \"target\": 309215}, {\"source\": 41584, \"target\": 623922}]}",
"id": 2521,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ja-Ling Wu, Jitendra Malik, Josep Lladós, Jiri Matas, Eenjun Hwang, Liu Wenyin, Kuok Wai He, David M. Blei, Vesa T. Peltonen, Feng Su, Faisal Shafait, Byeong-jun Han, Michael I. Jordan, Antti Eronen\n- Research collaborations between these authors: Ja-Ling Wu and Feng Su, Jitendra Malik and Faisal Shafait, Jitendra Malik and Josep Lladós, Jitendra Malik and Michael I. Jordan, Jitendra Malik and Feng Su, Jitendra Malik and David M. Blei, Jitendra Malik and Jiri Matas, Josep Lladós and Faisal Shafait, Josep Lladós and Liu Wenyin, Josep Lladós and Jiri Matas, Josep Lladós and Feng Su, Jiri Matas and Faisal Shafait, Jiri Matas and Eenjun Hwang, Jiri Matas and Feng Su, Eenjun Hwang and Byeong-jun Han, Eenjun Hwang and Feng Su, Liu Wenyin and Feng Su, Kuok Wai He and Feng Su, David M. Blei and Feng Su, David M. Blei and Michael I. Jordan, Vesa T. Peltonen and Feng Su, Vesa T. Peltonen and Antti Eronen, Feng Su and Faisal Shafait, Feng Su and Michael I. Jordan, Feng Su and Antti Eronen, Feng Su and Byeong-jun Han.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jingjing Jin, Maulik Shukla, Cathy H. Wu, Leszek Rychlewski, Amos Marc Bairoch, Richard L. Stevens, Rolf Apweiler, Gordon D. Pusch, Tatiana Tatusova, Hyun Seung Yoo, Bruno W. S. Sobral, Mihai Surdeanu, Veronika Vonstein, Chunhong Mao\n- Research collaborations between these authors: Jingjing Jin and Bruno W. S. Sobral, Jingjing Jin and Rolf Apweiler, Maulik Shukla and Bruno W. S. Sobral, Maulik Shukla and Richard L. Stevens, Maulik Shukla and Chunhong Mao, Maulik Shukla and Tatiana Tatusova, Maulik Shukla and Gordon D. Pusch, Maulik Shukla and Veronika Vonstein, Maulik Shukla and Hyun Seung Yoo, Cathy H. Wu and Bruno W. S. Sobral, Cathy H. Wu and Rolf Apweiler, Cathy H. Wu and Amos Marc Bairoch, Cathy H. Wu and Tatiana Tatusova, Leszek Rychlewski and Rolf Apweiler, Leszek Rychlewski and Amos Marc Bairoch, Amos Marc Bairoch and Bruno W. S. Sobral, Amos Marc Bairoch and Rolf Apweiler, Amos Marc Bairoch and Tatiana Tatusova, Richard L. Stevens and Bruno W. S. Sobral, Richard L. Stevens and Tatiana Tatusova, Richard L. Stevens and Gordon D. Pusch, Richard L. Stevens and Veronika Vonstein, Richard L. Stevens and Chunhong Mao, Richard L. Stevens and Hyun Seung Yoo, Rolf Apweiler and Bruno W. S. Sobral, Rolf Apweiler and Tatiana Tatusova, Gordon D. Pusch and Chunhong Mao, Gordon D. Pusch and Bruno W. S. Sobral, Gordon D. Pusch and Tatiana Tatusova, Gordon D. Pusch and Veronika Vonstein, Gordon D. Pusch and Hyun Seung Yoo, Tatiana Tatusova and Bruno W. S. Sobral, Tatiana Tatusova and Chunhong Mao, Tatiana Tatusova and Veronika Vonstein, Tatiana Tatusova and Hyun Seung Yoo, Hyun Seung Yoo and Bruno W. S. Sobral, Hyun Seung Yoo and Chunhong Mao, Hyun Seung Yoo and Veronika Vonstein, Bruno W. S. Sobral and Chunhong Mao, Bruno W. S. Sobral and Mihai Surdeanu, Bruno W. S. Sobral and Veronika Vonstein, Mihai Surdeanu and Chunhong Mao, Veronika Vonstein and Chunhong Mao.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Jingjing Jin\", \"id\": 170305}, {\"name\": \"Maulik Shukla\", \"id\": 216419}, {\"name\": \"Cathy H. Wu\", \"id\": 48740}, {\"name\": \"Leszek Rychlewski\", \"id\": 210919}, {\"name\": \"Amos Marc Bairoch\", \"id\": 285293}, {\"name\": \"Richard L. Stevens\", \"id\": 59918}, {\"name\": \"Rolf Apweiler\", \"id\": 128465}, {\"name\": \"Gordon D. Pusch\", \"id\": 599381}, {\"name\": \"Tatiana Tatusova\", \"id\": 299543}, {\"name\": \"Hyun Seung Yoo\", \"id\": 599386}, {\"name\": \"Bruno W. S. Sobral\", \"id\": 29851}, {\"name\": \"Mihai Surdeanu\", \"id\": 116829}, {\"name\": \"Veronika Vonstein\", \"id\": 599383}, {\"name\": \"Chunhong Mao\", \"id\": 97023}], \"links\": [{\"source\": 170305, \"target\": 29851}, {\"source\": 170305, \"target\": 128465}, {\"source\": 216419, \"target\": 29851}, {\"source\": 216419, \"target\": 59918}, {\"source\": 216419, \"target\": 97023}, {\"source\": 216419, \"target\": 299543}, {\"source\": 216419, \"target\": 599381}, {\"source\": 216419, \"target\": 599383}, {\"source\": 216419, \"target\": 599386}, {\"source\": 48740, \"target\": 29851}, {\"source\": 48740, \"target\": 128465}, {\"source\": 48740, \"target\": 285293}, {\"source\": 48740, \"target\": 299543}, {\"source\": 210919, \"target\": 128465}, {\"source\": 210919, \"target\": 285293}, {\"source\": 285293, \"target\": 29851}, {\"source\": 285293, \"target\": 128465}, {\"source\": 285293, \"target\": 299543}, {\"source\": 59918, \"target\": 29851}, {\"source\": 59918, \"target\": 299543}, {\"source\": 59918, \"target\": 599381}, {\"source\": 59918, \"target\": 599383}, {\"source\": 59918, \"target\": 97023}, {\"source\": 59918, \"target\": 599386}, {\"source\": 128465, \"target\": 29851}, {\"source\": 128465, \"target\": 299543}, {\"source\": 599381, \"target\": 97023}, {\"source\": 599381, \"target\": 29851}, {\"source\": 599381, \"target\": 299543}, {\"source\": 599381, \"target\": 599383}, {\"source\": 599381, \"target\": 599386}, {\"source\": 299543, \"target\": 29851}, {\"source\": 299543, \"target\": 97023}, {\"source\": 299543, \"target\": 599383}, {\"source\": 299543, \"target\": 599386}, {\"source\": 599386, \"target\": 29851}, {\"source\": 599386, \"target\": 97023}, {\"source\": 599386, \"target\": 599383}, {\"source\": 29851, \"target\": 97023}, {\"source\": 29851, \"target\": 116829}, {\"source\": 29851, \"target\": 599383}, {\"source\": 116829, \"target\": 97023}, {\"source\": 599383, \"target\": 97023}]}",
"id": 843,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jingjing Jin, Maulik Shukla, Cathy H. Wu, Leszek Rychlewski, Amos Marc Bairoch, Richard L. Stevens, Rolf Apweiler, Gordon D. Pusch, Tatiana Tatusova, Hyun Seung Yoo, Bruno W. S. Sobral, Mihai Surdeanu, Veronika Vonstein, Chunhong Mao\n- Research collaborations between these authors: Jingjing Jin and Bruno W. S. Sobral, Jingjing Jin and Rolf Apweiler, Maulik Shukla and Bruno W. S. Sobral, Maulik Shukla and Richard L. Stevens, Maulik Shukla and Chunhong Mao, Maulik Shukla and Tatiana Tatusova, Maulik Shukla and Gordon D. Pusch, Maulik Shukla and Veronika Vonstein, Maulik Shukla and Hyun Seung Yoo, Cathy H. Wu and Bruno W. S. Sobral, Cathy H. Wu and Rolf Apweiler, Cathy H. Wu and Amos Marc Bairoch, Cathy H. Wu and Tatiana Tatusova, Leszek Rychlewski and Rolf Apweiler, Leszek Rychlewski and Amos Marc Bairoch, Amos Marc Bairoch and Bruno W. S. Sobral, Amos Marc Bairoch and Rolf Apweiler, Amos Marc Bairoch and Tatiana Tatusova, Richard L. Stevens and Bruno W. S. Sobral, Richard L. Stevens and Tatiana Tatusova, Richard L. Stevens and Gordon D. Pusch, Richard L. Stevens and Veronika Vonstein, Richard L. Stevens and Chunhong Mao, Richard L. Stevens and Hyun Seung Yoo, Rolf Apweiler and Bruno W. S. Sobral, Rolf Apweiler and Tatiana Tatusova, Gordon D. Pusch and Chunhong Mao, Gordon D. Pusch and Bruno W. S. Sobral, Gordon D. Pusch and Tatiana Tatusova, Gordon D. Pusch and Veronika Vonstein, Gordon D. Pusch and Hyun Seung Yoo, Tatiana Tatusova and Bruno W. S. Sobral, Tatiana Tatusova and Chunhong Mao, Tatiana Tatusova and Veronika Vonstein, Tatiana Tatusova and Hyun Seung Yoo, Hyun Seung Yoo and Bruno W. S. Sobral, Hyun Seung Yoo and Chunhong Mao, Hyun Seung Yoo and Veronika Vonstein, Bruno W. S. Sobral and Chunhong Mao, Bruno W. S. Sobral and Mihai Surdeanu, Bruno W. S. Sobral and Veronika Vonstein, Mihai Surdeanu and Chunhong Mao, Veronika Vonstein and Chunhong Mao.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Lilly Christina, Bhavik B. Vachhani, Tomi Kinnunen, Mohammadi Zaki, K.S.R. Murty, Daniel Erro, Nora Barroso, Swaran Lata, Haizhou Li, Kewal D. Malde, Shubham Sharma, Tanvina B. Patel, Hemant A. Patil, Xavier Anguera\n- Research collaborations between these authors: Lilly Christina and Hemant A. Patil, Bhavik B. Vachhani and Hemant A. Patil, Bhavik B. Vachhani and Shubham Sharma, Bhavik B. Vachhani and Tanvina B. Patel, Bhavik B. Vachhani and Mohammadi Zaki, Tomi Kinnunen and Daniel Erro, Tomi Kinnunen and Haizhou Li, Tomi Kinnunen and Hemant A. Patil, Tomi Kinnunen and Tanvina B. Patel, Mohammadi Zaki and Hemant A. Patil, Mohammadi Zaki and Nora Barroso, Mohammadi Zaki and Tanvina B. Patel, K.S.R. Murty and Hemant A. Patil, Daniel Erro and Haizhou Li, Daniel Erro and Hemant A. Patil, Daniel Erro and Tanvina B. Patel, Nora Barroso and Hemant A. Patil, Swaran Lata and Hemant A. Patil, Haizhou Li and Xavier Anguera, Haizhou Li and Hemant A. Patil, Haizhou Li and Tanvina B. Patel, Kewal D. Malde and Hemant A. Patil, Kewal D. Malde and Shubham Sharma, Shubham Sharma and Hemant A. Patil, Tanvina B. Patel and Hemant A. Patil, Hemant A. Patil and Xavier Anguera.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Lilly Christina\", \"id\": 646115}, {\"name\": \"Bhavik B. Vachhani\", \"id\": 741796}, {\"name\": \"Tomi Kinnunen\", \"id\": 27686}, {\"name\": \"Mohammadi Zaki\", \"id\": 508743}, {\"name\": \"K.S.R. Murty\", \"id\": 985385}, {\"name\": \"Daniel Erro\", \"id\": 8009}, {\"name\": \"Nora Barroso\", \"id\": 70926}, {\"name\": \"Swaran Lata\", \"id\": 646127}, {\"name\": \"Haizhou Li\", \"id\": 11537}, {\"name\": \"Kewal D. Malde\", \"id\": 142100}, {\"name\": \"Shubham Sharma\", \"id\": 48247}, {\"name\": \"Tanvina B. Patel\", \"id\": 387708}, {\"name\": \"Hemant A. Patil\", \"id\": 37053}, {\"name\": \"Xavier Anguera\", \"id\": 10846}], \"links\": [{\"source\": 646115, \"target\": 37053}, {\"source\": 741796, \"target\": 37053}, {\"source\": 741796, \"target\": 48247}, {\"source\": 741796, \"target\": 387708}, {\"source\": 741796, \"target\": 508743}, {\"source\": 27686, \"target\": 8009}, {\"source\": 27686, \"target\": 11537}, {\"source\": 27686, \"target\": 37053}, {\"source\": 27686, \"target\": 387708}, {\"source\": 508743, \"target\": 37053}, {\"source\": 508743, \"target\": 70926}, {\"source\": 508743, \"target\": 387708}, {\"source\": 985385, \"target\": 37053}, {\"source\": 8009, \"target\": 11537}, {\"source\": 8009, \"target\": 37053}, {\"source\": 8009, \"target\": 387708}, {\"source\": 70926, \"target\": 37053}, {\"source\": 646127, \"target\": 37053}, {\"source\": 11537, \"target\": 10846}, {\"source\": 11537, \"target\": 37053}, {\"source\": 11537, \"target\": 387708}, {\"source\": 142100, \"target\": 37053}, {\"source\": 142100, \"target\": 48247}, {\"source\": 48247, \"target\": 37053}, {\"source\": 387708, \"target\": 37053}, {\"source\": 37053, \"target\": 10846}]}",
"id": 2211,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Lilly Christina, Bhavik B. Vachhani, Tomi Kinnunen, Mohammadi Zaki, K.S.R. Murty, Daniel Erro, Nora Barroso, Swaran Lata, Haizhou Li, Kewal D. Malde, Shubham Sharma, Tanvina B. Patel, Hemant A. Patil, Xavier Anguera\n- Research collaborations between these authors: Lilly Christina and Hemant A. Patil, Bhavik B. Vachhani and Hemant A. Patil, Bhavik B. Vachhani and Shubham Sharma, Bhavik B. Vachhani and Tanvina B. Patel, Bhavik B. Vachhani and Mohammadi Zaki, Tomi Kinnunen and Daniel Erro, Tomi Kinnunen and Haizhou Li, Tomi Kinnunen and Hemant A. Patil, Tomi Kinnunen and Tanvina B. Patel, Mohammadi Zaki and Hemant A. Patil, Mohammadi Zaki and Nora Barroso, Mohammadi Zaki and Tanvina B. Patel, K.S.R. Murty and Hemant A. Patil, Daniel Erro and Haizhou Li, Daniel Erro and Hemant A. Patil, Daniel Erro and Tanvina B. Patel, Nora Barroso and Hemant A. Patil, Swaran Lata and Hemant A. Patil, Haizhou Li and Xavier Anguera, Haizhou Li and Hemant A. Patil, Haizhou Li and Tanvina B. Patel, Kewal D. Malde and Hemant A. Patil, Kewal D. Malde and Shubham Sharma, Shubham Sharma and Hemant A. Patil, Tanvina B. Patel and Hemant A. Patil, Hemant A. Patil and Xavier Anguera.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Takehiro Mori, Teijiro Isokawa, Akira Hirose, Hideo Masuda, Haruhiko Nishimura, Nobuyuki Matsui, Ferdinand Peper, Jitao Sun, Yasuaki Kuroe, Yuriko Taniguchi, Robert Babuska, Yu Shibuya, Kazuyoshi Murata, B. De Schutter\n- Research collaborations between these authors: Takehiro Mori and Teijiro Isokawa, Takehiro Mori and Nobuyuki Matsui, Takehiro Mori and Haruhiko Nishimura, Takehiro Mori and Yasuaki Kuroe, Takehiro Mori and Yuriko Taniguchi, Teijiro Isokawa and Ferdinand Peper, Teijiro Isokawa and Nobuyuki Matsui, Teijiro Isokawa and Haruhiko Nishimura, Teijiro Isokawa and Yasuaki Kuroe, Akira Hirose and Yasuaki Kuroe, Hideo Masuda and Yu Shibuya, Hideo Masuda and Kazuyoshi Murata, Hideo Masuda and Yasuaki Kuroe, Haruhiko Nishimura and Ferdinand Peper, Haruhiko Nishimura and Nobuyuki Matsui, Haruhiko Nishimura and Yasuaki Kuroe, Nobuyuki Matsui and Ferdinand Peper, Nobuyuki Matsui and Yasuaki Kuroe, Jitao Sun and Yasuaki Kuroe, Yasuaki Kuroe and Yu Shibuya, Yasuaki Kuroe and Kazuyoshi Murata, Yasuaki Kuroe and Robert Babuska, Yasuaki Kuroe and Yuriko Taniguchi, Yasuaki Kuroe and B. De Schutter, Robert Babuska and B. De Schutter, Yu Shibuya and Kazuyoshi Murata.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Takehiro Mori\", \"id\": 331840}, {\"name\": \"Teijiro Isokawa\", \"id\": 24385}, {\"name\": \"Akira Hirose\", \"id\": 70592}, {\"name\": \"Hideo Masuda\", \"id\": 346019}, {\"name\": \"Haruhiko Nishimura\", \"id\": 41188}, {\"name\": \"Nobuyuki Matsui\", \"id\": 24388}, {\"name\": \"Ferdinand Peper\", \"id\": 24387}, {\"name\": \"Jitao Sun\", \"id\": 197390}, {\"name\": \"Yasuaki Kuroe\", \"id\": 191727}, {\"name\": \"Yuriko Taniguchi\", \"id\": 297650}, {\"name\": \"Robert Babuska\", \"id\": 42996}, {\"name\": \"Yu Shibuya\", \"id\": 37819}, {\"name\": \"Kazuyoshi Murata\", \"id\": 37821}, {\"name\": \"B. De Schutter\", \"id\": 300670}], \"links\": [{\"source\": 331840, \"target\": 24385}, {\"source\": 331840, \"target\": 24388}, {\"source\": 331840, \"target\": 41188}, {\"source\": 331840, \"target\": 191727}, {\"source\": 331840, \"target\": 297650}, {\"source\": 24385, \"target\": 24387}, {\"source\": 24385, \"target\": 24388}, {\"source\": 24385, \"target\": 41188}, {\"source\": 24385, \"target\": 191727}, {\"source\": 70592, \"target\": 191727}, {\"source\": 346019, \"target\": 37819}, {\"source\": 346019, \"target\": 37821}, {\"source\": 346019, \"target\": 191727}, {\"source\": 41188, \"target\": 24387}, {\"source\": 41188, \"target\": 24388}, {\"source\": 41188, \"target\": 191727}, {\"source\": 24388, \"target\": 24387}, {\"source\": 24388, \"target\": 191727}, {\"source\": 197390, \"target\": 191727}, {\"source\": 191727, \"target\": 37819}, {\"source\": 191727, \"target\": 37821}, {\"source\": 191727, \"target\": 42996}, {\"source\": 191727, \"target\": 297650}, {\"source\": 191727, \"target\": 300670}, {\"source\": 42996, \"target\": 300670}, {\"source\": 37819, \"target\": 37821}]}",
"id": 1396,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Takehiro Mori, Teijiro Isokawa, Akira Hirose, Hideo Masuda, Haruhiko Nishimura, Nobuyuki Matsui, Ferdinand Peper, Jitao Sun, Yasuaki Kuroe, Yuriko Taniguchi, Robert Babuska, Yu Shibuya, Kazuyoshi Murata, B. De Schutter\n- Research collaborations between these authors: Takehiro Mori and Teijiro Isokawa, Takehiro Mori and Nobuyuki Matsui, Takehiro Mori and Haruhiko Nishimura, Takehiro Mori and Yasuaki Kuroe, Takehiro Mori and Yuriko Taniguchi, Teijiro Isokawa and Ferdinand Peper, Teijiro Isokawa and Nobuyuki Matsui, Teijiro Isokawa and Haruhiko Nishimura, Teijiro Isokawa and Yasuaki Kuroe, Akira Hirose and Yasuaki Kuroe, Hideo Masuda and Yu Shibuya, Hideo Masuda and Kazuyoshi Murata, Hideo Masuda and Yasuaki Kuroe, Haruhiko Nishimura and Ferdinand Peper, Haruhiko Nishimura and Nobuyuki Matsui, Haruhiko Nishimura and Yasuaki Kuroe, Nobuyuki Matsui and Ferdinand Peper, Nobuyuki Matsui and Yasuaki Kuroe, Jitao Sun and Yasuaki Kuroe, Yasuaki Kuroe and Yu Shibuya, Yasuaki Kuroe and Kazuyoshi Murata, Yasuaki Kuroe and Robert Babuska, Yasuaki Kuroe and Yuriko Taniguchi, Yasuaki Kuroe and B. De Schutter, Robert Babuska and B. De Schutter, Yu Shibuya and Kazuyoshi Murata.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Kuk-Hyun Han, Kenli Li, Ayodele Lasisi, Juan C. Caicedo, Metin N. Gurcan, Dharmendra Sharma, David A. Forsyth, Achim Streit, Hongli Zhang, Howard Jay Siegel, Fabio A. González, Dipankar Dasgupta, Manoj Rameshchandra Thakur, Scott Shenker\n- Research collaborations between these authors: Kuk-Hyun Han and Kenli Li, Kenli Li and Howard Jay Siegel, Kenli Li and Ayodele Lasisi, Kenli Li and Achim Streit, Kenli Li and Scott Shenker, Ayodele Lasisi and Fabio A. González, Ayodele Lasisi and Dipankar Dasgupta, Juan C. Caicedo and Fabio A. González, Juan C. Caicedo and David A. Forsyth, Metin N. Gurcan and Fabio A. González, Dharmendra Sharma and Dipankar Dasgupta, David A. Forsyth and Fabio A. González, Hongli Zhang and Fabio A. González, Hongli Zhang and Dipankar Dasgupta, Hongli Zhang and Scott Shenker, Fabio A. González and Dipankar Dasgupta, Dipankar Dasgupta and Manoj Rameshchandra Thakur.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Kuk-Hyun Han\", \"id\": 245890}, {\"name\": \"Kenli Li\", \"id\": 171108}, {\"name\": \"Ayodele Lasisi\", \"id\": 137958}, {\"name\": \"Juan C. Caicedo\", \"id\": 70215}, {\"name\": \"Metin N. Gurcan\", \"id\": 58568}, {\"name\": \"Dharmendra Sharma\", \"id\": 28839}, {\"name\": \"David A. Forsyth\", \"id\": 34218}, {\"name\": \"Achim Streit\", \"id\": 6827}, {\"name\": \"Hongli Zhang\", \"id\": 20838}, {\"name\": \"Howard Jay Siegel\", \"id\": 5998}, {\"name\": \"Fabio A. Gonz\\u00e1lez\", \"id\": 1903}, {\"name\": \"Dipankar Dasgupta\", \"id\": 1904}, {\"name\": \"Manoj Rameshchandra Thakur\", \"id\": 334235}, {\"name\": \"Scott Shenker\", \"id\": 32157}], \"links\": [{\"source\": 245890, \"target\": 171108}, {\"source\": 171108, \"target\": 5998}, {\"source\": 171108, \"target\": 137958}, {\"source\": 171108, \"target\": 6827}, {\"source\": 171108, \"target\": 32157}, {\"source\": 137958, \"target\": 1903}, {\"source\": 137958, \"target\": 1904}, {\"source\": 70215, \"target\": 1903}, {\"source\": 70215, \"target\": 34218}, {\"source\": 58568, \"target\": 1903}, {\"source\": 28839, \"target\": 1904}, {\"source\": 34218, \"target\": 1903}, {\"source\": 20838, \"target\": 1903}, {\"source\": 20838, \"target\": 1904}, {\"source\": 20838, \"target\": 32157}, {\"source\": 1903, \"target\": 1904}, {\"source\": 1904, \"target\": 334235}]}",
"id": 1623,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Kuk-Hyun Han, Kenli Li, Ayodele Lasisi, Juan C. Caicedo, Metin N. Gurcan, Dharmendra Sharma, David A. Forsyth, Achim Streit, Hongli Zhang, Howard Jay Siegel, Fabio A. González, Dipankar Dasgupta, Manoj Rameshchandra Thakur, Scott Shenker\n- Research collaborations between these authors: Kuk-Hyun Han and Kenli Li, Kenli Li and Howard Jay Siegel, Kenli Li and Ayodele Lasisi, Kenli Li and Achim Streit, Kenli Li and Scott Shenker, Ayodele Lasisi and Fabio A. González, Ayodele Lasisi and Dipankar Dasgupta, Juan C. Caicedo and Fabio A. González, Juan C. Caicedo and David A. Forsyth, Metin N. Gurcan and Fabio A. González, Dharmendra Sharma and Dipankar Dasgupta, David A. Forsyth and Fabio A. González, Hongli Zhang and Fabio A. González, Hongli Zhang and Dipankar Dasgupta, Hongli Zhang and Scott Shenker, Fabio A. González and Dipankar Dasgupta, Dipankar Dasgupta and Manoj Rameshchandra Thakur.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: G. Sahoo, Yugal Kumar, Babak Amiri, Hossein Nezamabadi-pour, Jin-Yi Cai, Celal Ozturk, Abdolreza Hatamlou, Ponnuthurai N. Suganthan, Anima Naik, Suresh Chandra Satapathy, Anil K. Jain, Dervis Karaboga, Fengqin Yang, I-Wei Kao\n- Research collaborations between these authors: G. Sahoo and Yugal Kumar, G. Sahoo and Anil K. Jain, G. Sahoo and Hossein Nezamabadi-pour, G. Sahoo and Dervis Karaboga, G. Sahoo and Celal Ozturk, G. Sahoo and Abdolreza Hatamlou, G. Sahoo and Fengqin Yang, G. Sahoo and Babak Amiri, G. Sahoo and I-Wei Kao, Yugal Kumar and Anima Naik, Yugal Kumar and Suresh Chandra Satapathy, Yugal Kumar and Anil K. Jain, Yugal Kumar and Hossein Nezamabadi-pour, Yugal Kumar and Dervis Karaboga, Yugal Kumar and Celal Ozturk, Yugal Kumar and Abdolreza Hatamlou, Yugal Kumar and Fengqin Yang, Yugal Kumar and Babak Amiri, Yugal Kumar and I-Wei Kao, Babak Amiri and Abdolreza Hatamlou, Hossein Nezamabadi-pour and Ponnuthurai N. Suganthan, Hossein Nezamabadi-pour and Anil K. Jain, Hossein Nezamabadi-pour and Dervis Karaboga, Hossein Nezamabadi-pour and Fengqin Yang, Hossein Nezamabadi-pour and Abdolreza Hatamlou, Jin-Yi Cai and Fengqin Yang, Celal Ozturk and Ponnuthurai N. Suganthan, Celal Ozturk and Dervis Karaboga, Abdolreza Hatamlou and Anil K. Jain, Abdolreza Hatamlou and Dervis Karaboga, Ponnuthurai N. Suganthan and Anima Naik, Ponnuthurai N. Suganthan and Suresh Chandra Satapathy, Ponnuthurai N. Suganthan and Dervis Karaboga, Anima Naik and Suresh Chandra Satapathy.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"G. Sahoo\", \"id\": 108416}, {\"name\": \"Yugal Kumar\", \"id\": 32353}, {\"name\": \"Babak Amiri\", \"id\": 590116}, {\"name\": \"Hossein Nezamabadi-pour\", \"id\": 71272}, {\"name\": \"Fengqin Yang\", \"id\": 433625}, {\"name\": \"Celal Ozturk\", \"id\": 304110}, {\"name\": \"Abdolreza Hatamlou\", \"id\": 357999}, {\"name\": \"Ponnuthurai N. Suganthan\", \"id\": 27376}, {\"name\": \"Anima Naik\", \"id\": 17203}, {\"name\": \"Suresh Chandra Satapathy\", \"id\": 17204}, {\"name\": \"Anil K. Jain\", \"id\": 28181}, {\"name\": \"Dervis Karaboga\", \"id\": 87960}, {\"name\": \"Jin-Yi Cai\", \"id\": 50585}, {\"name\": \"I-Wei Kao\", \"id\": 607582}], \"links\": [{\"source\": 108416, \"target\": 32353}, {\"source\": 108416, \"target\": 28181}, {\"source\": 108416, \"target\": 71272}, {\"source\": 108416, \"target\": 87960}, {\"source\": 108416, \"target\": 304110}, {\"source\": 108416, \"target\": 357999}, {\"source\": 108416, \"target\": 433625}, {\"source\": 108416, \"target\": 590116}, {\"source\": 108416, \"target\": 607582}, {\"source\": 32353, \"target\": 17203}, {\"source\": 32353, \"target\": 17204}, {\"source\": 32353, \"target\": 28181}, {\"source\": 32353, \"target\": 71272}, {\"source\": 32353, \"target\": 87960}, {\"source\": 32353, \"target\": 304110}, {\"source\": 32353, \"target\": 357999}, {\"source\": 32353, \"target\": 433625}, {\"source\": 32353, \"target\": 590116}, {\"source\": 32353, \"target\": 607582}, {\"source\": 590116, \"target\": 357999}, {\"source\": 71272, \"target\": 27376}, {\"source\": 71272, \"target\": 28181}, {\"source\": 71272, \"target\": 87960}, {\"source\": 71272, \"target\": 433625}, {\"source\": 71272, \"target\": 357999}, {\"source\": 433625, \"target\": 50585}, {\"source\": 304110, \"target\": 27376}, {\"source\": 304110, \"target\": 87960}, {\"source\": 357999, \"target\": 28181}, {\"source\": 357999, \"target\": 87960}, {\"source\": 27376, \"target\": 17203}, {\"source\": 27376, \"target\": 17204}, {\"source\": 27376, \"target\": 87960}, {\"source\": 17203, \"target\": 17204}]}",
"id": 368,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: G. Sahoo, Yugal Kumar, Babak Amiri, Hossein Nezamabadi-pour, Jin-Yi Cai, Celal Ozturk, Abdolreza Hatamlou, Ponnuthurai N. Suganthan, Anima Naik, Suresh Chandra Satapathy, Anil K. Jain, Dervis Karaboga, Fengqin Yang, I-Wei Kao\n- Research collaborations between these authors: G. Sahoo and Yugal Kumar, G. Sahoo and Anil K. Jain, G. Sahoo and Hossein Nezamabadi-pour, G. Sahoo and Dervis Karaboga, G. Sahoo and Celal Ozturk, G. Sahoo and Abdolreza Hatamlou, G. Sahoo and Fengqin Yang, G. Sahoo and Babak Amiri, G. Sahoo and I-Wei Kao, Yugal Kumar and Anima Naik, Yugal Kumar and Suresh Chandra Satapathy, Yugal Kumar and Anil K. Jain, Yugal Kumar and Hossein Nezamabadi-pour, Yugal Kumar and Dervis Karaboga, Yugal Kumar and Celal Ozturk, Yugal Kumar and Abdolreza Hatamlou, Yugal Kumar and Fengqin Yang, Yugal Kumar and Babak Amiri, Yugal Kumar and I-Wei Kao, Babak Amiri and Abdolreza Hatamlou, Hossein Nezamabadi-pour and Ponnuthurai N. Suganthan, Hossein Nezamabadi-pour and Anil K. Jain, Hossein Nezamabadi-pour and Dervis Karaboga, Hossein Nezamabadi-pour and Fengqin Yang, Hossein Nezamabadi-pour and Abdolreza Hatamlou, Jin-Yi Cai and Fengqin Yang, Celal Ozturk and Ponnuthurai N. Suganthan, Celal Ozturk and Dervis Karaboga, Abdolreza Hatamlou and Anil K. Jain, Abdolreza Hatamlou and Dervis Karaboga, Ponnuthurai N. Suganthan and Anima Naik, Ponnuthurai N. Suganthan and Suresh Chandra Satapathy, Ponnuthurai N. Suganthan and Dervis Karaboga, Anima Naik and Suresh Chandra Satapathy.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hiroaki Kitano, Minoru Kanehisa, Intawat Nookaew, Bernhard O. Palsson, Costas D. Maranas, Michael Hucka, Falk Schreiber, Roded Sharan, Peter D. Karp, Mario Latendresse, Jens Nielsen, Suzanne M. Paley, Patrick F. Suthers, Daniel Weaver\n- Research collaborations between these authors: Hiroaki Kitano and Falk Schreiber, Hiroaki Kitano and Michael Hucka, Hiroaki Kitano and Jens Nielsen, Hiroaki Kitano and Bernhard O. Palsson, Hiroaki Kitano and Intawat Nookaew, Minoru Kanehisa and Falk Schreiber, Minoru Kanehisa and Roded Sharan, Minoru Kanehisa and Jens Nielsen, Minoru Kanehisa and Peter D. Karp, Minoru Kanehisa and Mario Latendresse, Minoru Kanehisa and Bernhard O. Palsson, Minoru Kanehisa and Costas D. Maranas, Minoru Kanehisa and Suzanne M. Paley, Intawat Nookaew and Jens Nielsen, Intawat Nookaew and Michael Hucka, Intawat Nookaew and Bernhard O. Palsson, Bernhard O. Palsson and Roded Sharan, Bernhard O. Palsson and Jens Nielsen, Bernhard O. Palsson and Peter D. Karp, Bernhard O. Palsson and Michael Hucka, Bernhard O. Palsson and Costas D. Maranas, Bernhard O. Palsson and Suzanne M. Paley, Bernhard O. Palsson and Daniel Weaver, Bernhard O. Palsson and Patrick F. Suthers, Costas D. Maranas and Peter D. Karp, Costas D. Maranas and Daniel Weaver, Costas D. Maranas and Jens Nielsen, Costas D. Maranas and Mario Latendresse, Costas D. Maranas and Patrick F. Suthers, Costas D. Maranas and Suzanne M. Paley, Michael Hucka and Falk Schreiber, Michael Hucka and Jens Nielsen, Falk Schreiber and Peter D. Karp, Falk Schreiber and Suzanne M. Paley, Peter D. Karp and Mario Latendresse, Peter D. Karp and Suzanne M. Paley, Peter D. Karp and Daniel Weaver, Peter D. Karp and Patrick F. Suthers, Mario Latendresse and Suzanne M. Paley, Mario Latendresse and Daniel Weaver, Suzanne M. Paley and Daniel Weaver, Suzanne M. Paley and Patrick F. Suthers.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Hiroaki Kitano\", \"id\": 98208}, {\"name\": \"Minoru Kanehisa\", \"id\": 388642}, {\"name\": \"Intawat Nookaew\", \"id\": 529797}, {\"name\": \"Costas D. Maranas\", \"id\": 553415}, {\"name\": \"Michael Hucka\", \"id\": 333288}, {\"name\": \"Falk Schreiber\", \"id\": 81352}, {\"name\": \"Roded Sharan\", \"id\": 114859}, {\"name\": \"Peter D. Karp\", \"id\": 303887}, {\"name\": \"Mario Latendresse\", \"id\": 391601}, {\"name\": \"Jens Nielsen\", \"id\": 235411}, {\"name\": \"Bernhard O. Palsson\", \"id\": 398458}, {\"name\": \"Patrick F. Suthers\", \"id\": 603517}, {\"name\": \"Daniel Weaver\", \"id\": 460382}, {\"name\": \"Suzanne M. Paley\", \"id\": 669594}], \"links\": [{\"source\": 98208, \"target\": 81352}, {\"source\": 98208, \"target\": 333288}, {\"source\": 98208, \"target\": 235411}, {\"source\": 98208, \"target\": 398458}, {\"source\": 98208, \"target\": 529797}, {\"source\": 388642, \"target\": 81352}, {\"source\": 388642, \"target\": 114859}, {\"source\": 388642, \"target\": 235411}, {\"source\": 388642, \"target\": 303887}, {\"source\": 388642, \"target\": 391601}, {\"source\": 388642, \"target\": 398458}, {\"source\": 388642, \"target\": 553415}, {\"source\": 388642, \"target\": 669594}, {\"source\": 529797, \"target\": 235411}, {\"source\": 529797, \"target\": 333288}, {\"source\": 529797, \"target\": 398458}, {\"source\": 553415, \"target\": 303887}, {\"source\": 553415, \"target\": 398458}, {\"source\": 553415, \"target\": 460382}, {\"source\": 553415, \"target\": 235411}, {\"source\": 553415, \"target\": 391601}, {\"source\": 553415, \"target\": 603517}, {\"source\": 553415, \"target\": 669594}, {\"source\": 333288, \"target\": 81352}, {\"source\": 333288, \"target\": 235411}, {\"source\": 333288, \"target\": 398458}, {\"source\": 81352, \"target\": 303887}, {\"source\": 81352, \"target\": 669594}, {\"source\": 114859, \"target\": 398458}, {\"source\": 303887, \"target\": 391601}, {\"source\": 303887, \"target\": 669594}, {\"source\": 303887, \"target\": 398458}, {\"source\": 303887, \"target\": 460382}, {\"source\": 303887, \"target\": 603517}, {\"source\": 391601, \"target\": 669594}, {\"source\": 391601, \"target\": 460382}, {\"source\": 235411, \"target\": 398458}, {\"source\": 398458, \"target\": 669594}, {\"source\": 398458, \"target\": 460382}, {\"source\": 398458, \"target\": 603517}, {\"source\": 603517, \"target\": 669594}, {\"source\": 460382, \"target\": 669594}]}",
"id": 2973,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hiroaki Kitano, Minoru Kanehisa, Intawat Nookaew, Bernhard O. Palsson, Costas D. Maranas, Michael Hucka, Falk Schreiber, Roded Sharan, Peter D. Karp, Mario Latendresse, Jens Nielsen, Suzanne M. Paley, Patrick F. Suthers, Daniel Weaver\n- Research collaborations between these authors: Hiroaki Kitano and Falk Schreiber, Hiroaki Kitano and Michael Hucka, Hiroaki Kitano and Jens Nielsen, Hiroaki Kitano and Bernhard O. Palsson, Hiroaki Kitano and Intawat Nookaew, Minoru Kanehisa and Falk Schreiber, Minoru Kanehisa and Roded Sharan, Minoru Kanehisa and Jens Nielsen, Minoru Kanehisa and Peter D. Karp, Minoru Kanehisa and Mario Latendresse, Minoru Kanehisa and Bernhard O. Palsson, Minoru Kanehisa and Costas D. Maranas, Minoru Kanehisa and Suzanne M. Paley, Intawat Nookaew and Jens Nielsen, Intawat Nookaew and Michael Hucka, Intawat Nookaew and Bernhard O. Palsson, Bernhard O. Palsson and Roded Sharan, Bernhard O. Palsson and Jens Nielsen, Bernhard O. Palsson and Peter D. Karp, Bernhard O. Palsson and Michael Hucka, Bernhard O. Palsson and Costas D. Maranas, Bernhard O. Palsson and Suzanne M. Paley, Bernhard O. Palsson and Daniel Weaver, Bernhard O. Palsson and Patrick F. Suthers, Costas D. Maranas and Peter D. Karp, Costas D. Maranas and Daniel Weaver, Costas D. Maranas and Jens Nielsen, Costas D. Maranas and Mario Latendresse, Costas D. Maranas and Patrick F. Suthers, Costas D. Maranas and Suzanne M. Paley, Michael Hucka and Falk Schreiber, Michael Hucka and Jens Nielsen, Falk Schreiber and Peter D. Karp, Falk Schreiber and Suzanne M. Paley, Peter D. Karp and Mario Latendresse, Peter D. Karp and Suzanne M. Paley, Peter D. Karp and Daniel Weaver, Peter D. Karp and Patrick F. Suthers, Mario Latendresse and Suzanne M. Paley, Mario Latendresse and Daniel Weaver, Suzanne M. Paley and Daniel Weaver, Suzanne M. Paley and Patrick F. Suthers.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Andreas F. Molisch, Ashutosh Sabharwal, Juha Laurila, Ghassan Dahman, Merouane Debbah, Ernst Bonek, Takehiko Kobayashi, Pertti Vainikainen, Fredrik Tufvesson, Ove Edfors, Nicolai Czink, Johan Karedal, Fredrik Rusek, Martin Toeltsch\n- Research collaborations between these authors: Andreas F. Molisch and Merouane Debbah, Andreas F. Molisch and Nicolai Czink, Andreas F. Molisch and Fredrik Rusek, Andreas F. Molisch and Ernst Bonek, Andreas F. Molisch and Ashutosh Sabharwal, Andreas F. Molisch and Pertti Vainikainen, Andreas F. Molisch and Fredrik Tufvesson, Andreas F. Molisch and Martin Toeltsch, Andreas F. Molisch and Juha Laurila, Andreas F. Molisch and Johan Karedal, Andreas F. Molisch and Ghassan Dahman, Ashutosh Sabharwal and Fredrik Rusek, Ashutosh Sabharwal and Fredrik Tufvesson, Juha Laurila and Fredrik Tufvesson, Juha Laurila and Ghassan Dahman, Juha Laurila and Johan Karedal, Ghassan Dahman and Fredrik Rusek, Ghassan Dahman and Ernst Bonek, Ghassan Dahman and Pertti Vainikainen, Ghassan Dahman and Fredrik Tufvesson, Ghassan Dahman and Ove Edfors, Ghassan Dahman and Martin Toeltsch, Merouane Debbah and Nicolai Czink, Merouane Debbah and Fredrik Rusek, Merouane Debbah and Ernst Bonek, Merouane Debbah and Pertti Vainikainen, Merouane Debbah and Fredrik Tufvesson, Merouane Debbah and Ove Edfors, Ernst Bonek and Nicolai Czink, Ernst Bonek and Pertti Vainikainen, Ernst Bonek and Fredrik Tufvesson, Ernst Bonek and Johan Karedal, Pertti Vainikainen and Nicolai Czink, Pertti Vainikainen and Fredrik Tufvesson, Pertti Vainikainen and Johan Karedal, Fredrik Tufvesson and Nicolai Czink, Fredrik Tufvesson and Fredrik Rusek, Fredrik Tufvesson and Ove Edfors, Fredrik Tufvesson and Martin Toeltsch, Fredrik Tufvesson and Johan Karedal, Ove Edfors and Fredrik Rusek, Nicolai Czink and Martin Toeltsch, Nicolai Czink and Johan Karedal, Johan Karedal and Martin Toeltsch.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Andreas F. Molisch\", \"id\": 254049}, {\"name\": \"Ashutosh Sabharwal\", \"id\": 186402}, {\"name\": \"Juha Laurila\", \"id\": 746664}, {\"name\": \"Ghassan Dahman\", \"id\": 414890}, {\"name\": \"Merouane Debbah\", \"id\": 57101}, {\"name\": \"Takehiko Kobayashi\", \"id\": 291629}, {\"name\": \"Pertti Vainikainen\", \"id\": 273296}, {\"name\": \"Fredrik Tufvesson\", \"id\": 358195}, {\"name\": \"Ove Edfors\", \"id\": 358196}, {\"name\": \"Nicolai Czink\", \"id\": 114966}, {\"name\": \"Ernst Bonek\", \"id\": 153592}, {\"name\": \"Johan Karedal\", \"id\": 885816}, {\"name\": \"Fredrik Rusek\", \"id\": 146556}, {\"name\": \"Martin Toeltsch\", \"id\": 458654}], \"links\": [{\"source\": 254049, \"target\": 57101}, {\"source\": 254049, \"target\": 114966}, {\"source\": 254049, \"target\": 146556}, {\"source\": 254049, \"target\": 153592}, {\"source\": 254049, \"target\": 186402}, {\"source\": 254049, \"target\": 273296}, {\"source\": 254049, \"target\": 358195}, {\"source\": 254049, \"target\": 458654}, {\"source\": 254049, \"target\": 746664}, {\"source\": 254049, \"target\": 885816}, {\"source\": 254049, \"target\": 414890}, {\"source\": 186402, \"target\": 146556}, {\"source\": 186402, \"target\": 358195}, {\"source\": 746664, \"target\": 358195}, {\"source\": 746664, \"target\": 414890}, {\"source\": 746664, \"target\": 885816}, {\"source\": 414890, \"target\": 146556}, {\"source\": 414890, \"target\": 153592}, {\"source\": 414890, \"target\": 273296}, {\"source\": 414890, \"target\": 358195}, {\"source\": 414890, \"target\": 358196}, {\"source\": 414890, \"target\": 458654}, {\"source\": 57101, \"target\": 114966}, {\"source\": 57101, \"target\": 146556}, {\"source\": 57101, \"target\": 153592}, {\"source\": 57101, \"target\": 273296}, {\"source\": 57101, \"target\": 358195}, {\"source\": 57101, \"target\": 358196}, {\"source\": 273296, \"target\": 114966}, {\"source\": 273296, \"target\": 153592}, {\"source\": 273296, \"target\": 358195}, {\"source\": 273296, \"target\": 885816}, {\"source\": 358195, \"target\": 114966}, {\"source\": 358195, \"target\": 146556}, {\"source\": 358195, \"target\": 153592}, {\"source\": 358195, \"target\": 358196}, {\"source\": 358195, \"target\": 458654}, {\"source\": 358195, \"target\": 885816}, {\"source\": 358196, \"target\": 146556}, {\"source\": 114966, \"target\": 153592}, {\"source\": 114966, \"target\": 458654}, {\"source\": 114966, \"target\": 885816}, {\"source\": 153592, \"target\": 885816}, {\"source\": 885816, \"target\": 458654}]}",
"id": 358,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Andreas F. Molisch, Ashutosh Sabharwal, Juha Laurila, Ghassan Dahman, Merouane Debbah, Ernst Bonek, Takehiko Kobayashi, Pertti Vainikainen, Fredrik Tufvesson, Ove Edfors, Nicolai Czink, Johan Karedal, Fredrik Rusek, Martin Toeltsch\n- Research collaborations between these authors: Andreas F. Molisch and Merouane Debbah, Andreas F. Molisch and Nicolai Czink, Andreas F. Molisch and Fredrik Rusek, Andreas F. Molisch and Ernst Bonek, Andreas F. Molisch and Ashutosh Sabharwal, Andreas F. Molisch and Pertti Vainikainen, Andreas F. Molisch and Fredrik Tufvesson, Andreas F. Molisch and Martin Toeltsch, Andreas F. Molisch and Juha Laurila, Andreas F. Molisch and Johan Karedal, Andreas F. Molisch and Ghassan Dahman, Ashutosh Sabharwal and Fredrik Rusek, Ashutosh Sabharwal and Fredrik Tufvesson, Juha Laurila and Fredrik Tufvesson, Juha Laurila and Ghassan Dahman, Juha Laurila and Johan Karedal, Ghassan Dahman and Fredrik Rusek, Ghassan Dahman and Ernst Bonek, Ghassan Dahman and Pertti Vainikainen, Ghassan Dahman and Fredrik Tufvesson, Ghassan Dahman and Ove Edfors, Ghassan Dahman and Martin Toeltsch, Merouane Debbah and Nicolai Czink, Merouane Debbah and Fredrik Rusek, Merouane Debbah and Ernst Bonek, Merouane Debbah and Pertti Vainikainen, Merouane Debbah and Fredrik Tufvesson, Merouane Debbah and Ove Edfors, Ernst Bonek and Nicolai Czink, Ernst Bonek and Pertti Vainikainen, Ernst Bonek and Fredrik Tufvesson, Ernst Bonek and Johan Karedal, Pertti Vainikainen and Nicolai Czink, Pertti Vainikainen and Fredrik Tufvesson, Pertti Vainikainen and Johan Karedal, Fredrik Tufvesson and Nicolai Czink, Fredrik Tufvesson and Fredrik Rusek, Fredrik Tufvesson and Ove Edfors, Fredrik Tufvesson and Martin Toeltsch, Fredrik Tufvesson and Johan Karedal, Ove Edfors and Fredrik Rusek, Nicolai Czink and Martin Toeltsch, Nicolai Czink and Johan Karedal, Johan Karedal and Martin Toeltsch.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Mathieu Salzmann, Sebastian Thrun, Fakhreddine Ababsa, Marcin Eichner, Séverine Dubuisson, Søren Hauberg, Kim Steenstrup Pedersen, Peter Meer, Karl J. Friston, P. Thomas Fletcher, Fatih Porikli, Michael J. Black, Rama Chellappa, Marleen de Bruijne\n- Research collaborations between these authors: Mathieu Salzmann and Rama Chellappa, Mathieu Salzmann and Fatih Porikli, Mathieu Salzmann and Michael J. Black, Mathieu Salzmann and Sebastian Thrun, Mathieu Salzmann and Peter Meer, Mathieu Salzmann and Marcin Eichner, Mathieu Salzmann and Søren Hauberg, Sebastian Thrun and Michael J. Black, Sebastian Thrun and Søren Hauberg, Fakhreddine Ababsa and Søren Hauberg, Fakhreddine Ababsa and Kim Steenstrup Pedersen, Marcin Eichner and Rama Chellappa, Marcin Eichner and Michael J. Black, Marcin Eichner and Søren Hauberg, Marcin Eichner and Kim Steenstrup Pedersen, Séverine Dubuisson and Fatih Porikli, Séverine Dubuisson and Michael J. Black, Séverine Dubuisson and Søren Hauberg, Séverine Dubuisson and Kim Steenstrup Pedersen, Søren Hauberg and Michael J. Black, Søren Hauberg and Rama Chellappa, Søren Hauberg and P. Thomas Fletcher, Søren Hauberg and Marleen de Bruijne, Søren Hauberg and Fatih Porikli, Søren Hauberg and Kim Steenstrup Pedersen, Søren Hauberg and Karl J. Friston, Søren Hauberg and Peter Meer, Kim Steenstrup Pedersen and Michael J. Black, Peter Meer and Rama Chellappa, Peter Meer and Fatih Porikli, Fatih Porikli and Rama Chellappa, Michael J. Black and Rama Chellappa.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Mathieu Salzmann\", \"id\": 47043}, {\"name\": \"Fakhreddine Ababsa\", \"id\": 169380}, {\"name\": \"Sebastian Thrun\", \"id\": 54500}, {\"name\": \"Marcin Eichner\", \"id\": 373670}, {\"name\": \"S\\u00e9verine Dubuisson\", \"id\": 36102}, {\"name\": \"S\\u00f8ren Hauberg\", \"id\": 75497}, {\"name\": \"Kim Steenstrup Pedersen\", \"id\": 75498}, {\"name\": \"Peter Meer\", \"id\": 272490}, {\"name\": \"Marleen de Bruijne\", \"id\": 35613}, {\"name\": \"P. Thomas Fletcher\", \"id\": 32173}, {\"name\": \"Fatih Porikli\", \"id\": 40590}, {\"name\": \"Michael J. Black\", \"id\": 46233}, {\"name\": \"Rama Chellappa\", \"id\": 6938}, {\"name\": \"Karl J. Friston\", \"id\": 174941}], \"links\": [{\"source\": 47043, \"target\": 6938}, {\"source\": 47043, \"target\": 40590}, {\"source\": 47043, \"target\": 46233}, {\"source\": 47043, \"target\": 54500}, {\"source\": 47043, \"target\": 272490}, {\"source\": 47043, \"target\": 373670}, {\"source\": 47043, \"target\": 75497}, {\"source\": 169380, \"target\": 75497}, {\"source\": 169380, \"target\": 75498}, {\"source\": 54500, \"target\": 46233}, {\"source\": 54500, \"target\": 75497}, {\"source\": 373670, \"target\": 6938}, {\"source\": 373670, \"target\": 46233}, {\"source\": 373670, \"target\": 75497}, {\"source\": 373670, \"target\": 75498}, {\"source\": 36102, \"target\": 40590}, {\"source\": 36102, \"target\": 46233}, {\"source\": 36102, \"target\": 75497}, {\"source\": 36102, \"target\": 75498}, {\"source\": 75497, \"target\": 46233}, {\"source\": 75497, \"target\": 6938}, {\"source\": 75497, \"target\": 32173}, {\"source\": 75497, \"target\": 35613}, {\"source\": 75497, \"target\": 40590}, {\"source\": 75497, \"target\": 75498}, {\"source\": 75497, \"target\": 174941}, {\"source\": 75497, \"target\": 272490}, {\"source\": 75498, \"target\": 46233}, {\"source\": 272490, \"target\": 6938}, {\"source\": 272490, \"target\": 40590}, {\"source\": 40590, \"target\": 6938}, {\"source\": 46233, \"target\": 6938}]}",
"id": 161,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Mathieu Salzmann, Sebastian Thrun, Fakhreddine Ababsa, Marcin Eichner, Séverine Dubuisson, Søren Hauberg, Kim Steenstrup Pedersen, Peter Meer, Karl J. Friston, P. Thomas Fletcher, Fatih Porikli, Michael J. Black, Rama Chellappa, Marleen de Bruijne\n- Research collaborations between these authors: Mathieu Salzmann and Rama Chellappa, Mathieu Salzmann and Fatih Porikli, Mathieu Salzmann and Michael J. Black, Mathieu Salzmann and Sebastian Thrun, Mathieu Salzmann and Peter Meer, Mathieu Salzmann and Marcin Eichner, Mathieu Salzmann and Søren Hauberg, Sebastian Thrun and Michael J. Black, Sebastian Thrun and Søren Hauberg, Fakhreddine Ababsa and Søren Hauberg, Fakhreddine Ababsa and Kim Steenstrup Pedersen, Marcin Eichner and Rama Chellappa, Marcin Eichner and Michael J. Black, Marcin Eichner and Søren Hauberg, Marcin Eichner and Kim Steenstrup Pedersen, Séverine Dubuisson and Fatih Porikli, Séverine Dubuisson and Michael J. Black, Séverine Dubuisson and Søren Hauberg, Séverine Dubuisson and Kim Steenstrup Pedersen, Søren Hauberg and Michael J. Black, Søren Hauberg and Rama Chellappa, Søren Hauberg and P. Thomas Fletcher, Søren Hauberg and Marleen de Bruijne, Søren Hauberg and Fatih Porikli, Søren Hauberg and Kim Steenstrup Pedersen, Søren Hauberg and Karl J. Friston, Søren Hauberg and Peter Meer, Kim Steenstrup Pedersen and Michael J. Black, Peter Meer and Rama Chellappa, Peter Meer and Fatih Porikli, Fatih Porikli and Rama Chellappa, Michael J. Black and Rama Chellappa.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Bharat K. Bhargava, Hugo Larochelle, Zhou Wang, Raffaele Gravina, Antonio Liotta, Carlo Alberto Boano, Giovanni Iacca, Lawrence K. Cormack, Franco Callegati, Rajiv Soundararajan, Giancarlo Fortino, Lina J. Karam, David E. Culler, Janne Seppänen\n- Research collaborations between these authors: Bharat K. Bhargava and David E. Culler, Bharat K. Bhargava and Antonio Liotta, Hugo Larochelle and Antonio Liotta, Zhou Wang and Lina J. Karam, Zhou Wang and Rajiv Soundararajan, Zhou Wang and Lawrence K. Cormack, Zhou Wang and Antonio Liotta, Raffaele Gravina and Giancarlo Fortino, Raffaele Gravina and Antonio Liotta, Antonio Liotta and Giancarlo Fortino, Antonio Liotta and David E. Culler, Antonio Liotta and Lina J. Karam, Antonio Liotta and Franco Callegati, Antonio Liotta and Carlo Alberto Boano, Antonio Liotta and Giovanni Iacca, Antonio Liotta and Rajiv Soundararajan, Antonio Liotta and Lawrence K. Cormack, Antonio Liotta and Janne Seppänen, Carlo Alberto Boano and David E. Culler, Giovanni Iacca and Giancarlo Fortino, Giovanni Iacca and David E. Culler, Lawrence K. Cormack and Lina J. Karam, Lawrence K. Cormack and Rajiv Soundararajan, Rajiv Soundararajan and Lina J. Karam, Giancarlo Fortino and David E. Culler.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Bharat K. Bhargava\", \"id\": 65219}, {\"name\": \"Hugo Larochelle\", \"id\": 35173}, {\"name\": \"Raffaele Gravina\", \"id\": 335335}, {\"name\": \"Zhou Wang\", \"id\": 15143}, {\"name\": \"Antonio Liotta\", \"id\": 88457}, {\"name\": \"Carlo Alberto Boano\", \"id\": 124809}, {\"name\": \"Giovanni Iacca\", \"id\": 143082}, {\"name\": \"Lawrence K. Cormack\", \"id\": 390863}, {\"name\": \"Franco Callegati\", \"id\": 119186}, {\"name\": \"Rajiv Soundararajan\", \"id\": 173300}, {\"name\": \"Giancarlo Fortino\", \"id\": 20213}, {\"name\": \"Lina J. Karam\", \"id\": 95062}, {\"name\": \"David E. Culler\", \"id\": 9272}, {\"name\": \"Janne Sepp\\u00e4nen\", \"id\": 782078}], \"links\": [{\"source\": 65219, \"target\": 9272}, {\"source\": 65219, \"target\": 88457}, {\"source\": 35173, \"target\": 88457}, {\"source\": 335335, \"target\": 20213}, {\"source\": 335335, \"target\": 88457}, {\"source\": 15143, \"target\": 95062}, {\"source\": 15143, \"target\": 173300}, {\"source\": 15143, \"target\": 390863}, {\"source\": 15143, \"target\": 88457}, {\"source\": 88457, \"target\": 20213}, {\"source\": 88457, \"target\": 9272}, {\"source\": 88457, \"target\": 95062}, {\"source\": 88457, \"target\": 119186}, {\"source\": 88457, \"target\": 124809}, {\"source\": 88457, \"target\": 143082}, {\"source\": 88457, \"target\": 173300}, {\"source\": 88457, \"target\": 390863}, {\"source\": 88457, \"target\": 782078}, {\"source\": 124809, \"target\": 9272}, {\"source\": 143082, \"target\": 20213}, {\"source\": 143082, \"target\": 9272}, {\"source\": 390863, \"target\": 95062}, {\"source\": 390863, \"target\": 173300}, {\"source\": 173300, \"target\": 95062}, {\"source\": 20213, \"target\": 9272}]}",
"id": 1248,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Bharat K. Bhargava, Hugo Larochelle, Zhou Wang, Raffaele Gravina, Antonio Liotta, Carlo Alberto Boano, Giovanni Iacca, Lawrence K. Cormack, Franco Callegati, Rajiv Soundararajan, Giancarlo Fortino, Lina J. Karam, David E. Culler, Janne Seppänen\n- Research collaborations between these authors: Bharat K. Bhargava and David E. Culler, Bharat K. Bhargava and Antonio Liotta, Hugo Larochelle and Antonio Liotta, Zhou Wang and Lina J. Karam, Zhou Wang and Rajiv Soundararajan, Zhou Wang and Lawrence K. Cormack, Zhou Wang and Antonio Liotta, Raffaele Gravina and Giancarlo Fortino, Raffaele Gravina and Antonio Liotta, Antonio Liotta and Giancarlo Fortino, Antonio Liotta and David E. Culler, Antonio Liotta and Lina J. Karam, Antonio Liotta and Franco Callegati, Antonio Liotta and Carlo Alberto Boano, Antonio Liotta and Giovanni Iacca, Antonio Liotta and Rajiv Soundararajan, Antonio Liotta and Lawrence K. Cormack, Antonio Liotta and Janne Seppänen, Carlo Alberto Boano and David E. Culler, Giovanni Iacca and Giancarlo Fortino, Giovanni Iacca and David E. Culler, Lawrence K. Cormack and Lina J. Karam, Lawrence K. Cormack and Rajiv Soundararajan, Rajiv Soundararajan and Lina J. Karam, Giancarlo Fortino and David E. Culler.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Benjamin Michotte, Quentin Limbourg, Gerrit Meixner, Brian Y. Lim, Tim Clerckx, Jörg Müller, Sahin Albayrak, David Thevenin, Frederik Winters, Michael J. Higgins, Ken Hinckley, Daniel Reichart, Karin Coninx, Daniel S. Weld\n- Research collaborations between these authors: Benjamin Michotte and Karin Coninx, Benjamin Michotte and Sahin Albayrak, Benjamin Michotte and Quentin Limbourg, Benjamin Michotte and David Thevenin, Quentin Limbourg and Karin Coninx, Quentin Limbourg and Sahin Albayrak, Quentin Limbourg and David Thevenin, Quentin Limbourg and Gerrit Meixner, Quentin Limbourg and Daniel Reichart, Quentin Limbourg and Tim Clerckx, Gerrit Meixner and Karin Coninx, Gerrit Meixner and David Thevenin, Brian Y. Lim and Karin Coninx, Tim Clerckx and Karin Coninx, Tim Clerckx and Sahin Albayrak, Tim Clerckx and Daniel Reichart, Jörg Müller and Karin Coninx, Sahin Albayrak and Karin Coninx, Sahin Albayrak and Daniel S. Weld, Sahin Albayrak and David Thevenin, David Thevenin and Karin Coninx, Frederik Winters and Karin Coninx, Michael J. Higgins and Karin Coninx, Michael J. Higgins and Daniel S. Weld, Ken Hinckley and Karin Coninx, Daniel Reichart and Karin Coninx, Karin Coninx and Daniel S. Weld.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Benjamin Michotte\", \"id\": 419233}, {\"name\": \"Quentin Limbourg\", \"id\": 46050}, {\"name\": \"Gerrit Meixner\", \"id\": 61829}, {\"name\": \"Brian Y. Lim\", \"id\": 114694}, {\"name\": \"Tim Clerckx\", \"id\": 221414}, {\"name\": \"J\\u00f6rg M\\u00fcller\", \"id\": 108998}, {\"name\": \"Sahin Albayrak\", \"id\": 20007}, {\"name\": \"David Thevenin\", \"id\": 283950}, {\"name\": \"Frederik Winters\", \"id\": 717011}, {\"name\": \"Michael J. Higgins\", \"id\": 257939}, {\"name\": \"Ken Hinckley\", \"id\": 212886}, {\"name\": \"Daniel Reichart\", \"id\": 112600}, {\"name\": \"Karin Coninx\", \"id\": 3646}, {\"name\": \"Daniel S. Weld\", \"id\": 47935}], \"links\": [{\"source\": 419233, \"target\": 3646}, {\"source\": 419233, \"target\": 20007}, {\"source\": 419233, \"target\": 46050}, {\"source\": 419233, \"target\": 283950}, {\"source\": 46050, \"target\": 3646}, {\"source\": 46050, \"target\": 20007}, {\"source\": 46050, \"target\": 283950}, {\"source\": 46050, \"target\": 61829}, {\"source\": 46050, \"target\": 112600}, {\"source\": 46050, \"target\": 221414}, {\"source\": 61829, \"target\": 3646}, {\"source\": 61829, \"target\": 283950}, {\"source\": 114694, \"target\": 3646}, {\"source\": 221414, \"target\": 3646}, {\"source\": 221414, \"target\": 20007}, {\"source\": 221414, \"target\": 112600}, {\"source\": 108998, \"target\": 3646}, {\"source\": 20007, \"target\": 3646}, {\"source\": 20007, \"target\": 47935}, {\"source\": 20007, \"target\": 283950}, {\"source\": 283950, \"target\": 3646}, {\"source\": 717011, \"target\": 3646}, {\"source\": 257939, \"target\": 3646}, {\"source\": 257939, \"target\": 47935}, {\"source\": 212886, \"target\": 3646}, {\"source\": 112600, \"target\": 3646}, {\"source\": 3646, \"target\": 47935}]}",
"id": 1951,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Benjamin Michotte, Quentin Limbourg, Gerrit Meixner, Brian Y. Lim, Tim Clerckx, Jörg Müller, Sahin Albayrak, David Thevenin, Frederik Winters, Michael J. Higgins, Ken Hinckley, Daniel Reichart, Karin Coninx, Daniel S. Weld\n- Research collaborations between these authors: Benjamin Michotte and Karin Coninx, Benjamin Michotte and Sahin Albayrak, Benjamin Michotte and Quentin Limbourg, Benjamin Michotte and David Thevenin, Quentin Limbourg and Karin Coninx, Quentin Limbourg and Sahin Albayrak, Quentin Limbourg and David Thevenin, Quentin Limbourg and Gerrit Meixner, Quentin Limbourg and Daniel Reichart, Quentin Limbourg and Tim Clerckx, Gerrit Meixner and Karin Coninx, Gerrit Meixner and David Thevenin, Brian Y. Lim and Karin Coninx, Tim Clerckx and Karin Coninx, Tim Clerckx and Sahin Albayrak, Tim Clerckx and Daniel Reichart, Jörg Müller and Karin Coninx, Sahin Albayrak and Karin Coninx, Sahin Albayrak and Daniel S. Weld, Sahin Albayrak and David Thevenin, David Thevenin and Karin Coninx, Frederik Winters and Karin Coninx, Michael J. Higgins and Karin Coninx, Michael J. Higgins and Daniel S. Weld, Ken Hinckley and Karin Coninx, Daniel Reichart and Karin Coninx, Karin Coninx and Daniel S. Weld.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Shaojun Wang, Bin Zhang, Liansheng Liu, Datong Liu, Peter Sandborn, Yu Peng, Marcos E. Orchard, Michael Pecht, Qiang Miao, Zhiwen Liu, Jianbao Zhou, Yujie Zhang, Jingyue Pang, S. Kumar\n- Research collaborations between these authors: Shaojun Wang and Yu Peng, Shaojun Wang and Michael Pecht, Shaojun Wang and Datong Liu, Bin Zhang and Marcos E. Orchard, Bin Zhang and Yu Peng, Bin Zhang and Michael Pecht, Bin Zhang and Datong Liu, Liansheng Liu and Yu Peng, Liansheng Liu and S. Kumar, Liansheng Liu and Michael Pecht, Liansheng Liu and Datong Liu, Datong Liu and Yujie Zhang, Datong Liu and Yu Peng, Datong Liu and Michael Pecht, Datong Liu and Zhiwen Liu, Datong Liu and S. Kumar, Datong Liu and Peter Sandborn, Datong Liu and Qiang Miao, Datong Liu and Jingyue Pang, Datong Liu and Marcos E. Orchard, Datong Liu and Jianbao Zhou, Peter Sandborn and Yu Peng, Peter Sandborn and Michael Pecht, Yu Peng and Yujie Zhang, Yu Peng and S. Kumar, Yu Peng and Michael Pecht, Yu Peng and Qiang Miao, Yu Peng and Jingyue Pang, Yu Peng and Marcos E. Orchard, Yu Peng and Jianbao Zhou, Yu Peng and Zhiwen Liu, Marcos E. Orchard and Michael Pecht, Michael Pecht and Yujie Zhang, Michael Pecht and S. Kumar, Michael Pecht and Qiang Miao.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Shaojun Wang\", \"id\": 58849}, {\"name\": \"Bin Zhang\", \"id\": 8258}, {\"name\": \"Liansheng Liu\", \"id\": 197800}, {\"name\": \"Datong Liu\", \"id\": 197801}, {\"name\": \"Peter Sandborn\", \"id\": 269995}, {\"name\": \"Yu Peng\", \"id\": 48270}, {\"name\": \"Marcos E. Orchard\", \"id\": 553330}, {\"name\": \"Michael Pecht\", \"id\": 98420}, {\"name\": \"Qiang Miao\", \"id\": 283060}, {\"name\": \"Zhiwen Liu\", \"id\": 155349}, {\"name\": \"Jianbao Zhou\", \"id\": 824024}, {\"name\": \"Yujie Zhang\", \"id\": 29723}, {\"name\": \"Jingyue Pang\", \"id\": 397118}, {\"name\": \"S. Kumar\", \"id\": 37663}], \"links\": [{\"source\": 58849, \"target\": 48270}, {\"source\": 58849, \"target\": 98420}, {\"source\": 58849, \"target\": 197801}, {\"source\": 8258, \"target\": 553330}, {\"source\": 8258, \"target\": 48270}, {\"source\": 8258, \"target\": 98420}, {\"source\": 8258, \"target\": 197801}, {\"source\": 197800, \"target\": 48270}, {\"source\": 197800, \"target\": 37663}, {\"source\": 197800, \"target\": 98420}, {\"source\": 197800, \"target\": 197801}, {\"source\": 197801, \"target\": 29723}, {\"source\": 197801, \"target\": 48270}, {\"source\": 197801, \"target\": 98420}, {\"source\": 197801, \"target\": 155349}, {\"source\": 197801, \"target\": 37663}, {\"source\": 197801, \"target\": 269995}, {\"source\": 197801, \"target\": 283060}, {\"source\": 197801, \"target\": 397118}, {\"source\": 197801, \"target\": 553330}, {\"source\": 197801, \"target\": 824024}, {\"source\": 269995, \"target\": 48270}, {\"source\": 269995, \"target\": 98420}, {\"source\": 48270, \"target\": 29723}, {\"source\": 48270, \"target\": 37663}, {\"source\": 48270, \"target\": 98420}, {\"source\": 48270, \"target\": 283060}, {\"source\": 48270, \"target\": 397118}, {\"source\": 48270, \"target\": 553330}, {\"source\": 48270, \"target\": 824024}, {\"source\": 48270, \"target\": 155349}, {\"source\": 553330, \"target\": 98420}, {\"source\": 98420, \"target\": 29723}, {\"source\": 98420, \"target\": 37663}, {\"source\": 98420, \"target\": 283060}]}",
"id": 783,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Shaojun Wang, Bin Zhang, Liansheng Liu, Datong Liu, Peter Sandborn, Yu Peng, Marcos E. Orchard, Michael Pecht, Qiang Miao, Zhiwen Liu, Jianbao Zhou, Yujie Zhang, Jingyue Pang, S. Kumar\n- Research collaborations between these authors: Shaojun Wang and Yu Peng, Shaojun Wang and Michael Pecht, Shaojun Wang and Datong Liu, Bin Zhang and Marcos E. Orchard, Bin Zhang and Yu Peng, Bin Zhang and Michael Pecht, Bin Zhang and Datong Liu, Liansheng Liu and Yu Peng, Liansheng Liu and S. Kumar, Liansheng Liu and Michael Pecht, Liansheng Liu and Datong Liu, Datong Liu and Yujie Zhang, Datong Liu and Yu Peng, Datong Liu and Michael Pecht, Datong Liu and Zhiwen Liu, Datong Liu and S. Kumar, Datong Liu and Peter Sandborn, Datong Liu and Qiang Miao, Datong Liu and Jingyue Pang, Datong Liu and Marcos E. Orchard, Datong Liu and Jianbao Zhou, Peter Sandborn and Yu Peng, Peter Sandborn and Michael Pecht, Yu Peng and Yujie Zhang, Yu Peng and S. Kumar, Yu Peng and Michael Pecht, Yu Peng and Qiang Miao, Yu Peng and Jingyue Pang, Yu Peng and Marcos E. Orchard, Yu Peng and Jianbao Zhou, Yu Peng and Zhiwen Liu, Marcos E. Orchard and Michael Pecht, Michael Pecht and Yujie Zhang, Michael Pecht and S. Kumar, Michael Pecht and Qiang Miao.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wei Fan, W. C. Situ, Alex Pentland, Sharad Mehrotra, Ed Greengrass, Alexander Rasin, Christian Bizer, Sheng Chen, Zuowei Shen, Xin Zhang, Steffen Bickel, Kalervo Järvelin, Li Wan, Ping Luo\n- Research collaborations between these authors: Wei Fan and Li Wan, Wei Fan and Alexander Rasin, Wei Fan and Steffen Bickel, Wei Fan and Zuowei Shen, Wei Fan and Ed Greengrass, Wei Fan and Ping Luo, Wei Fan and Sheng Chen, Christian Bizer and Ping Luo.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 2,
"style": "rule"
}
|
{
"exact_answer": 2,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Wei Fan\", \"id\": 9408}, {\"name\": \"W. C. Situ\", \"id\": 62400}, {\"name\": \"Alex Pentland\", \"id\": 58980}, {\"name\": \"Sharad Mehrotra\", \"id\": 4229}, {\"name\": \"Ed Greengrass\", \"id\": 1128711}, {\"name\": \"Alexander Rasin\", \"id\": 218857}, {\"name\": \"Christian Bizer\", \"id\": 2954}, {\"name\": \"Sheng Chen\", \"id\": 77962}, {\"name\": \"Zuowei Shen\", \"id\": 422988}, {\"name\": \"Xin Zhang\", \"id\": 20141}, {\"name\": \"Steffen Bickel\", \"id\": 270801}, {\"name\": \"Kalervo J\\u00e4rvelin\", \"id\": 56913}, {\"name\": \"Li Wan\", \"id\": 7157}, {\"name\": \"Ping Luo\", \"id\": 18872}], \"links\": [{\"source\": 9408, \"target\": 7157}, {\"source\": 9408, \"target\": 218857}, {\"source\": 9408, \"target\": 270801}, {\"source\": 9408, \"target\": 422988}, {\"source\": 9408, \"target\": 1128711}, {\"source\": 9408, \"target\": 18872}, {\"source\": 9408, \"target\": 77962}, {\"source\": 2954, \"target\": 18872}]}",
"id": 1269,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wei Fan, W. C. Situ, Alex Pentland, Sharad Mehrotra, Ed Greengrass, Alexander Rasin, Christian Bizer, Sheng Chen, Zuowei Shen, Xin Zhang, Steffen Bickel, Kalervo Järvelin, Li Wan, Ping Luo\n- Research collaborations between these authors: Wei Fan and Li Wan, Wei Fan and Alexander Rasin, Wei Fan and Steffen Bickel, Wei Fan and Zuowei Shen, Wei Fan and Ed Greengrass, Wei Fan and Ping Luo, Wei Fan and Sheng Chen, Christian Bizer and Ping Luo.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Sadao Kawamura, Y. Takagi, Yohei Ariga, Kenta Tominaga, Bram Vanderborght, Dirk Lefeber, Mitsunori Uemura, Hiroaki Hirai, Fumio Miyazaki, Eichi Watanabe, Hidemasa Goya, Koichi Koganezawa, Giorgio Grioli, Manolo Garabini\n- Research collaborations between these authors: Sadao Kawamura and Mitsunori Uemura, Sadao Kawamura and Hiroaki Hirai, Sadao Kawamura and Fumio Miyazaki, Sadao Kawamura and Bram Vanderborght, Sadao Kawamura and Dirk Lefeber, Sadao Kawamura and Koichi Koganezawa, Sadao Kawamura and Giorgio Grioli, Sadao Kawamura and Y. Takagi, Sadao Kawamura and Manolo Garabini, Sadao Kawamura and Hidemasa Goya, Y. Takagi and Mitsunori Uemura, Yohei Ariga and Hiroaki Hirai, Yohei Ariga and Fumio Miyazaki, Yohei Ariga and Kenta Tominaga, Yohei Ariga and Mitsunori Uemura, Kenta Tominaga and Mitsunori Uemura, Kenta Tominaga and Hiroaki Hirai, Kenta Tominaga and Fumio Miyazaki, Bram Vanderborght and Dirk Lefeber, Bram Vanderborght and Giorgio Grioli, Bram Vanderborght and Manolo Garabini, Bram Vanderborght and Mitsunori Uemura, Dirk Lefeber and Giorgio Grioli, Dirk Lefeber and Manolo Garabini, Dirk Lefeber and Mitsunori Uemura, Mitsunori Uemura and Hiroaki Hirai, Mitsunori Uemura and Fumio Miyazaki, Mitsunori Uemura and Koichi Koganezawa, Mitsunori Uemura and Giorgio Grioli, Mitsunori Uemura and Manolo Garabini, Mitsunori Uemura and Hidemasa Goya, Mitsunori Uemura and Eichi Watanabe, Hiroaki Hirai and Fumio Miyazaki, Hiroaki Hirai and Eichi Watanabe, Fumio Miyazaki and Eichi Watanabe, Giorgio Grioli and Manolo Garabini.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Sadao Kawamura\", \"id\": 267136}, {\"name\": \"Y. Takagi\", \"id\": 469921}, {\"name\": \"Yohei Ariga\", \"id\": 238338}, {\"name\": \"Kenta Tominaga\", \"id\": 238339}, {\"name\": \"Bram Vanderborght\", \"id\": 8226}, {\"name\": \"Dirk Lefeber\", \"id\": 8229}, {\"name\": \"Mitsunori Uemura\", \"id\": 238342}, {\"name\": \"Hiroaki Hirai\", \"id\": 238343}, {\"name\": \"Fumio Miyazaki\", \"id\": 238344}, {\"name\": \"Eichi Watanabe\", \"id\": 1181319}, {\"name\": \"Hidemasa Goya\", \"id\": 584650}, {\"name\": \"Koichi Koganezawa\", \"id\": 399532}, {\"name\": \"Giorgio Grioli\", \"id\": 351636}, {\"name\": \"Manolo Garabini\", \"id\": 524120}], \"links\": [{\"source\": 267136, \"target\": 238342}, {\"source\": 267136, \"target\": 238343}, {\"source\": 267136, \"target\": 238344}, {\"source\": 267136, \"target\": 8226}, {\"source\": 267136, \"target\": 8229}, {\"source\": 267136, \"target\": 399532}, {\"source\": 267136, \"target\": 351636}, {\"source\": 267136, \"target\": 469921}, {\"source\": 267136, \"target\": 524120}, {\"source\": 267136, \"target\": 584650}, {\"source\": 469921, \"target\": 238342}, {\"source\": 238338, \"target\": 238343}, {\"source\": 238338, \"target\": 238344}, {\"source\": 238338, \"target\": 238339}, {\"source\": 238338, \"target\": 238342}, {\"source\": 238339, \"target\": 238342}, {\"source\": 238339, \"target\": 238343}, {\"source\": 238339, \"target\": 238344}, {\"source\": 8226, \"target\": 8229}, {\"source\": 8226, \"target\": 351636}, {\"source\": 8226, \"target\": 524120}, {\"source\": 8226, \"target\": 238342}, {\"source\": 8229, \"target\": 351636}, {\"source\": 8229, \"target\": 524120}, {\"source\": 8229, \"target\": 238342}, {\"source\": 238342, \"target\": 238343}, {\"source\": 238342, \"target\": 238344}, {\"source\": 238342, \"target\": 399532}, {\"source\": 238342, \"target\": 351636}, {\"source\": 238342, \"target\": 524120}, {\"source\": 238342, \"target\": 584650}, {\"source\": 238342, \"target\": 1181319}, {\"source\": 238343, \"target\": 238344}, {\"source\": 238343, \"target\": 1181319}, {\"source\": 238344, \"target\": 1181319}, {\"source\": 351636, \"target\": 524120}]}",
"id": 1399,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Sadao Kawamura, Y. Takagi, Yohei Ariga, Kenta Tominaga, Bram Vanderborght, Dirk Lefeber, Mitsunori Uemura, Hiroaki Hirai, Fumio Miyazaki, Eichi Watanabe, Hidemasa Goya, Koichi Koganezawa, Giorgio Grioli, Manolo Garabini\n- Research collaborations between these authors: Sadao Kawamura and Mitsunori Uemura, Sadao Kawamura and Hiroaki Hirai, Sadao Kawamura and Fumio Miyazaki, Sadao Kawamura and Bram Vanderborght, Sadao Kawamura and Dirk Lefeber, Sadao Kawamura and Koichi Koganezawa, Sadao Kawamura and Giorgio Grioli, Sadao Kawamura and Y. Takagi, Sadao Kawamura and Manolo Garabini, Sadao Kawamura and Hidemasa Goya, Y. Takagi and Mitsunori Uemura, Yohei Ariga and Hiroaki Hirai, Yohei Ariga and Fumio Miyazaki, Yohei Ariga and Kenta Tominaga, Yohei Ariga and Mitsunori Uemura, Kenta Tominaga and Mitsunori Uemura, Kenta Tominaga and Hiroaki Hirai, Kenta Tominaga and Fumio Miyazaki, Bram Vanderborght and Dirk Lefeber, Bram Vanderborght and Giorgio Grioli, Bram Vanderborght and Manolo Garabini, Bram Vanderborght and Mitsunori Uemura, Dirk Lefeber and Giorgio Grioli, Dirk Lefeber and Manolo Garabini, Dirk Lefeber and Mitsunori Uemura, Mitsunori Uemura and Hiroaki Hirai, Mitsunori Uemura and Fumio Miyazaki, Mitsunori Uemura and Koichi Koganezawa, Mitsunori Uemura and Giorgio Grioli, Mitsunori Uemura and Manolo Garabini, Mitsunori Uemura and Hidemasa Goya, Mitsunori Uemura and Eichi Watanabe, Hiroaki Hirai and Fumio Miyazaki, Hiroaki Hirai and Eichi Watanabe, Fumio Miyazaki and Eichi Watanabe, Giorgio Grioli and Manolo Garabini.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Malvina Nissim, Veronique Hoste, Hongfei Lin, Aoife Cahill, Arndt Riester, Jean Carletta, Michael Strube, Bruce M. McLaren, Janet Hitzeman, Parisa Kordjamshidi, Massimo Poesio, Vincent Ng, Yufang Hou, Katja Markert\n- Research collaborations between these authors: Malvina Nissim and Arndt Riester, Malvina Nissim and Vincent Ng, Malvina Nissim and Veronique Hoste, Malvina Nissim and Michael Strube, Malvina Nissim and Hongfei Lin, Malvina Nissim and Katja Markert, Malvina Nissim and Jean Carletta, Malvina Nissim and Yufang Hou, Veronique Hoste and Massimo Poesio, Veronique Hoste and Vincent Ng, Veronique Hoste and Katja Markert, Aoife Cahill and Arndt Riester, Aoife Cahill and Michael Strube, Arndt Riester and Jean Carletta, Arndt Riester and Michael Strube, Arndt Riester and Katja Markert, Arndt Riester and Yufang Hou, Jean Carletta and Vincent Ng, Jean Carletta and Michael Strube, Jean Carletta and Katja Markert, Michael Strube and Massimo Poesio, Michael Strube and Vincent Ng, Michael Strube and Janet Hitzeman, Michael Strube and Katja Markert, Michael Strube and Yufang Hou, Bruce M. McLaren and Janet Hitzeman, Janet Hitzeman and Parisa Kordjamshidi, Janet Hitzeman and Massimo Poesio, Janet Hitzeman and Vincent Ng, Janet Hitzeman and Katja Markert, Janet Hitzeman and Yufang Hou, Parisa Kordjamshidi and Vincent Ng, Massimo Poesio and Vincent Ng, Massimo Poesio and Katja Markert, Massimo Poesio and Yufang Hou, Vincent Ng and Katja Markert, Yufang Hou and Katja Markert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Malvina Nissim\", \"id\": 70464}, {\"name\": \"Veronique Hoste\", \"id\": 62054}, {\"name\": \"Hongfei Lin\", \"id\": 69000}, {\"name\": \"Aoife Cahill\", \"id\": 32745}, {\"name\": \"Arndt Riester\", \"id\": 24078}, {\"name\": \"Jean Carletta\", \"id\": 99791}, {\"name\": \"Michael Strube\", \"id\": 67025}, {\"name\": \"Bruce M. McLaren\", \"id\": 48179}, {\"name\": \"Janet Hitzeman\", \"id\": 51668}, {\"name\": \"Parisa Kordjamshidi\", \"id\": 30937}, {\"name\": \"Massimo Poesio\", \"id\": 50043}, {\"name\": \"Vincent Ng\", \"id\": 54748}, {\"name\": \"Yufang Hou\", \"id\": 971453}, {\"name\": \"Katja Markert\", \"id\": 127774}], \"links\": [{\"source\": 70464, \"target\": 24078}, {\"source\": 70464, \"target\": 54748}, {\"source\": 70464, \"target\": 62054}, {\"source\": 70464, \"target\": 67025}, {\"source\": 70464, \"target\": 69000}, {\"source\": 70464, \"target\": 127774}, {\"source\": 70464, \"target\": 99791}, {\"source\": 70464, \"target\": 971453}, {\"source\": 62054, \"target\": 50043}, {\"source\": 62054, \"target\": 54748}, {\"source\": 62054, \"target\": 127774}, {\"source\": 32745, \"target\": 24078}, {\"source\": 32745, \"target\": 67025}, {\"source\": 24078, \"target\": 99791}, {\"source\": 24078, \"target\": 67025}, {\"source\": 24078, \"target\": 127774}, {\"source\": 24078, \"target\": 971453}, {\"source\": 99791, \"target\": 54748}, {\"source\": 99791, \"target\": 67025}, {\"source\": 99791, \"target\": 127774}, {\"source\": 67025, \"target\": 50043}, {\"source\": 67025, \"target\": 54748}, {\"source\": 67025, \"target\": 51668}, {\"source\": 67025, \"target\": 127774}, {\"source\": 67025, \"target\": 971453}, {\"source\": 48179, \"target\": 51668}, {\"source\": 51668, \"target\": 30937}, {\"source\": 51668, \"target\": 50043}, {\"source\": 51668, \"target\": 54748}, {\"source\": 51668, \"target\": 127774}, {\"source\": 51668, \"target\": 971453}, {\"source\": 30937, \"target\": 54748}, {\"source\": 50043, \"target\": 54748}, {\"source\": 50043, \"target\": 127774}, {\"source\": 50043, \"target\": 971453}, {\"source\": 54748, \"target\": 127774}, {\"source\": 971453, \"target\": 127774}]}",
"id": 493,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Malvina Nissim, Veronique Hoste, Hongfei Lin, Aoife Cahill, Arndt Riester, Jean Carletta, Michael Strube, Bruce M. McLaren, Janet Hitzeman, Parisa Kordjamshidi, Massimo Poesio, Vincent Ng, Yufang Hou, Katja Markert\n- Research collaborations between these authors: Malvina Nissim and Arndt Riester, Malvina Nissim and Vincent Ng, Malvina Nissim and Veronique Hoste, Malvina Nissim and Michael Strube, Malvina Nissim and Hongfei Lin, Malvina Nissim and Katja Markert, Malvina Nissim and Jean Carletta, Malvina Nissim and Yufang Hou, Veronique Hoste and Massimo Poesio, Veronique Hoste and Vincent Ng, Veronique Hoste and Katja Markert, Aoife Cahill and Arndt Riester, Aoife Cahill and Michael Strube, Arndt Riester and Jean Carletta, Arndt Riester and Michael Strube, Arndt Riester and Katja Markert, Arndt Riester and Yufang Hou, Jean Carletta and Vincent Ng, Jean Carletta and Michael Strube, Jean Carletta and Katja Markert, Michael Strube and Massimo Poesio, Michael Strube and Vincent Ng, Michael Strube and Janet Hitzeman, Michael Strube and Katja Markert, Michael Strube and Yufang Hou, Bruce M. McLaren and Janet Hitzeman, Janet Hitzeman and Parisa Kordjamshidi, Janet Hitzeman and Massimo Poesio, Janet Hitzeman and Vincent Ng, Janet Hitzeman and Katja Markert, Janet Hitzeman and Yufang Hou, Parisa Kordjamshidi and Vincent Ng, Massimo Poesio and Vincent Ng, Massimo Poesio and Katja Markert, Massimo Poesio and Yufang Hou, Vincent Ng and Katja Markert, Yufang Hou and Katja Markert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Norbert Manthey, Niklas Een, Laurent Simon, Armin Biere, Igor L. Markov, Carlos Ansótegui, Oliver Kullmann, Markus Iser, Kevin Leyton-Brown, Tommi A. Junttila, Florian Lonsing, Carsten Sinz, Marijn J. H. Heule, Sharad Malik\n- Research collaborations between these authors: Norbert Manthey and Armin Biere, Norbert Manthey and Laurent Simon, Norbert Manthey and Carlos Ansótegui, Norbert Manthey and Sharad Malik, Norbert Manthey and Marijn J. H. Heule, Norbert Manthey and Carsten Sinz, Norbert Manthey and Kevin Leyton-Brown, Norbert Manthey and Tommi A. Junttila, Norbert Manthey and Oliver Kullmann, Norbert Manthey and Niklas Een, Norbert Manthey and Markus Iser, Niklas Een and Armin Biere, Niklas Een and Laurent Simon, Niklas Een and Carlos Ansótegui, Niklas Een and Florian Lonsing, Niklas Een and Sharad Malik, Niklas Een and Marijn J. H. Heule, Niklas Een and Igor L. Markov, Niklas Een and Carsten Sinz, Niklas Een and Kevin Leyton-Brown, Niklas Een and Tommi A. Junttila, Niklas Een and Oliver Kullmann, Laurent Simon and Armin Biere, Laurent Simon and Carlos Ansótegui, Laurent Simon and Sharad Malik, Laurent Simon and Marijn J. H. Heule, Laurent Simon and Kevin Leyton-Brown, Laurent Simon and Florian Lonsing, Laurent Simon and Carsten Sinz, Laurent Simon and Oliver Kullmann, Laurent Simon and Markus Iser, Armin Biere and Carlos Ansótegui, Armin Biere and Florian Lonsing, Armin Biere and Sharad Malik, Armin Biere and Marijn J. H. Heule, Armin Biere and Igor L. Markov, Armin Biere and Carsten Sinz, Armin Biere and Kevin Leyton-Brown, Armin Biere and Tommi A. Junttila, Armin Biere and Oliver Kullmann, Armin Biere and Markus Iser, Igor L. Markov and Marijn J. H. Heule, Igor L. Markov and Sharad Malik, Igor L. Markov and Carsten Sinz, Carlos Ansótegui and Sharad Malik, Carlos Ansótegui and Carsten Sinz, Carlos Ansótegui and Kevin Leyton-Brown, Carlos Ansótegui and Oliver Kullmann, Oliver Kullmann and Florian Lonsing, Oliver Kullmann and Marijn J. H. Heule, Oliver Kullmann and Carsten Sinz, Oliver Kullmann and Sharad Malik, Oliver Kullmann and Tommi A. Junttila, Markus Iser and Marijn J. H. Heule, Markus Iser and Carsten Sinz, Kevin Leyton-Brown and Marijn J. H. Heule, Tommi A. Junttila and Marijn J. H. Heule, Tommi A. Junttila and Sharad Malik, Tommi A. Junttila and Carsten Sinz, Florian Lonsing and Sharad Malik, Florian Lonsing and Marijn J. H. Heule, Florian Lonsing and Carsten Sinz, Carsten Sinz and Marijn J. H. Heule, Carsten Sinz and Sharad Malik, Marijn J. H. Heule and Sharad Malik.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Norbert Manthey\", \"id\": 9476}, {\"name\": \"Niklas Een\", \"id\": 132069}, {\"name\": \"Laurent Simon\", \"id\": 6374}, {\"name\": \"Armin Biere\", \"id\": 5928}, {\"name\": \"Igor L. Markov\", \"id\": 36329}, {\"name\": \"Carlos Ans\\u00f3tegui\", \"id\": 10248}, {\"name\": \"Oliver Kullmann\", \"id\": 61547}, {\"name\": \"Markus Iser\", \"id\": 312558}, {\"name\": \"Kevin Leyton-Brown\", \"id\": 40430}, {\"name\": \"Tommi A. Junttila\", \"id\": 55604}, {\"name\": \"Florian Lonsing\", \"id\": 13078}, {\"name\": \"Carsten Sinz\", \"id\": 38903}, {\"name\": \"Marijn J. H. Heule\", \"id\": 34905}, {\"name\": \"Sharad Malik\", \"id\": 19774}], \"links\": [{\"source\": 9476, \"target\": 5928}, {\"source\": 9476, \"target\": 6374}, {\"source\": 9476, \"target\": 10248}, {\"source\": 9476, \"target\": 19774}, {\"source\": 9476, \"target\": 34905}, {\"source\": 9476, \"target\": 38903}, {\"source\": 9476, \"target\": 40430}, {\"source\": 9476, \"target\": 55604}, {\"source\": 9476, \"target\": 61547}, {\"source\": 9476, \"target\": 132069}, {\"source\": 9476, \"target\": 312558}, {\"source\": 132069, \"target\": 5928}, {\"source\": 132069, \"target\": 6374}, {\"source\": 132069, \"target\": 10248}, {\"source\": 132069, \"target\": 13078}, {\"source\": 132069, \"target\": 19774}, {\"source\": 132069, \"target\": 34905}, {\"source\": 132069, \"target\": 36329}, {\"source\": 132069, \"target\": 38903}, {\"source\": 132069, \"target\": 40430}, {\"source\": 132069, \"target\": 55604}, {\"source\": 132069, \"target\": 61547}, {\"source\": 6374, \"target\": 5928}, {\"source\": 6374, \"target\": 10248}, {\"source\": 6374, \"target\": 19774}, {\"source\": 6374, \"target\": 34905}, {\"source\": 6374, \"target\": 40430}, {\"source\": 6374, \"target\": 13078}, {\"source\": 6374, \"target\": 38903}, {\"source\": 6374, \"target\": 61547}, {\"source\": 6374, \"target\": 312558}, {\"source\": 5928, \"target\": 10248}, {\"source\": 5928, \"target\": 13078}, {\"source\": 5928, \"target\": 19774}, {\"source\": 5928, \"target\": 34905}, {\"source\": 5928, \"target\": 36329}, {\"source\": 5928, \"target\": 38903}, {\"source\": 5928, \"target\": 40430}, {\"source\": 5928, \"target\": 55604}, {\"source\": 5928, \"target\": 61547}, {\"source\": 5928, \"target\": 312558}, {\"source\": 36329, \"target\": 34905}, {\"source\": 36329, \"target\": 19774}, {\"source\": 36329, \"target\": 38903}, {\"source\": 10248, \"target\": 19774}, {\"source\": 10248, \"target\": 38903}, {\"source\": 10248, \"target\": 40430}, {\"source\": 10248, \"target\": 61547}, {\"source\": 61547, \"target\": 13078}, {\"source\": 61547, \"target\": 34905}, {\"source\": 61547, \"target\": 38903}, {\"source\": 61547, \"target\": 19774}, {\"source\": 61547, \"target\": 55604}, {\"source\": 312558, \"target\": 34905}, {\"source\": 312558, \"target\": 38903}, {\"source\": 40430, \"target\": 34905}, {\"source\": 55604, \"target\": 34905}, {\"source\": 55604, \"target\": 19774}, {\"source\": 55604, \"target\": 38903}, {\"source\": 13078, \"target\": 19774}, {\"source\": 13078, \"target\": 34905}, {\"source\": 13078, \"target\": 38903}, {\"source\": 38903, \"target\": 34905}, {\"source\": 38903, \"target\": 19774}, {\"source\": 34905, \"target\": 19774}]}",
"id": 1019,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Norbert Manthey, Niklas Een, Laurent Simon, Armin Biere, Igor L. Markov, Carlos Ansótegui, Oliver Kullmann, Markus Iser, Kevin Leyton-Brown, Tommi A. Junttila, Florian Lonsing, Carsten Sinz, Marijn J. H. Heule, Sharad Malik\n- Research collaborations between these authors: Norbert Manthey and Armin Biere, Norbert Manthey and Laurent Simon, Norbert Manthey and Carlos Ansótegui, Norbert Manthey and Sharad Malik, Norbert Manthey and Marijn J. H. Heule, Norbert Manthey and Carsten Sinz, Norbert Manthey and Kevin Leyton-Brown, Norbert Manthey and Tommi A. Junttila, Norbert Manthey and Oliver Kullmann, Norbert Manthey and Niklas Een, Norbert Manthey and Markus Iser, Niklas Een and Armin Biere, Niklas Een and Laurent Simon, Niklas Een and Carlos Ansótegui, Niklas Een and Florian Lonsing, Niklas Een and Sharad Malik, Niklas Een and Marijn J. H. Heule, Niklas Een and Igor L. Markov, Niklas Een and Carsten Sinz, Niklas Een and Kevin Leyton-Brown, Niklas Een and Tommi A. Junttila, Niklas Een and Oliver Kullmann, Laurent Simon and Armin Biere, Laurent Simon and Carlos Ansótegui, Laurent Simon and Sharad Malik, Laurent Simon and Marijn J. H. Heule, Laurent Simon and Kevin Leyton-Brown, Laurent Simon and Florian Lonsing, Laurent Simon and Carsten Sinz, Laurent Simon and Oliver Kullmann, Laurent Simon and Markus Iser, Armin Biere and Carlos Ansótegui, Armin Biere and Florian Lonsing, Armin Biere and Sharad Malik, Armin Biere and Marijn J. H. Heule, Armin Biere and Igor L. Markov, Armin Biere and Carsten Sinz, Armin Biere and Kevin Leyton-Brown, Armin Biere and Tommi A. Junttila, Armin Biere and Oliver Kullmann, Armin Biere and Markus Iser, Igor L. Markov and Marijn J. H. Heule, Igor L. Markov and Sharad Malik, Igor L. Markov and Carsten Sinz, Carlos Ansótegui and Sharad Malik, Carlos Ansótegui and Carsten Sinz, Carlos Ansótegui and Kevin Leyton-Brown, Carlos Ansótegui and Oliver Kullmann, Oliver Kullmann and Florian Lonsing, Oliver Kullmann and Marijn J. H. Heule, Oliver Kullmann and Carsten Sinz, Oliver Kullmann and Sharad Malik, Oliver Kullmann and Tommi A. Junttila, Markus Iser and Marijn J. H. Heule, Markus Iser and Carsten Sinz, Kevin Leyton-Brown and Marijn J. H. Heule, Tommi A. Junttila and Marijn J. H. Heule, Tommi A. Junttila and Sharad Malik, Tommi A. Junttila and Carsten Sinz, Florian Lonsing and Sharad Malik, Florian Lonsing and Marijn J. H. Heule, Florian Lonsing and Carsten Sinz, Carsten Sinz and Marijn J. H. Heule, Carsten Sinz and Sharad Malik, Marijn J. H. Heule and Sharad Malik.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Andrew Y. Savinkov, Jae Ho Lee, Stanislav A. Filin, Sergey N. Moiseev, Mikhail S. Kondakov, Seok Ho Cheon, Do Hyon Yim, Ki Tae Han, Yun Sang Park, Ye Li, Guocong Song, Khaled Ben Letaief, Ying Jun Zhang, Alexandre V. Garmonov\n- Research collaborations between these authors: Andrew Y. Savinkov and Alexandre V. Garmonov, Andrew Y. Savinkov and Stanislav A. Filin, Andrew Y. Savinkov and Sergey N. Moiseev, Andrew Y. Savinkov and Mikhail S. Kondakov, Andrew Y. Savinkov and Do Hyon Yim, Andrew Y. Savinkov and Yun Sang Park, Andrew Y. Savinkov and Jae Ho Lee, Jae Ho Lee and Alexandre V. Garmonov, Jae Ho Lee and Stanislav A. Filin, Jae Ho Lee and Sergey N. Moiseev, Jae Ho Lee and Mikhail S. Kondakov, Jae Ho Lee and Seok Ho Cheon, Jae Ho Lee and Do Hyon Yim, Jae Ho Lee and Ki Tae Han, Jae Ho Lee and Yun Sang Park, Stanislav A. Filin and Alexandre V. Garmonov, Stanislav A. Filin and Ye Li, Stanislav A. Filin and Ying Jun Zhang, Stanislav A. Filin and Khaled Ben Letaief, Stanislav A. Filin and Guocong Song, Stanislav A. Filin and Sergey N. Moiseev, Stanislav A. Filin and Mikhail S. Kondakov, Stanislav A. Filin and Seok Ho Cheon, Stanislav A. Filin and Do Hyon Yim, Stanislav A. Filin and Ki Tae Han, Stanislav A. Filin and Yun Sang Park, Sergey N. Moiseev and Alexandre V. Garmonov, Sergey N. Moiseev and Ye Li, Sergey N. Moiseev and Ying Jun Zhang, Sergey N. Moiseev and Khaled Ben Letaief, Sergey N. Moiseev and Guocong Song, Sergey N. Moiseev and Mikhail S. Kondakov, Sergey N. Moiseev and Seok Ho Cheon, Sergey N. Moiseev and Do Hyon Yim, Sergey N. Moiseev and Ki Tae Han, Sergey N. Moiseev and Yun Sang Park, Mikhail S. Kondakov and Alexandre V. Garmonov, Mikhail S. Kondakov and Ye Li, Mikhail S. Kondakov and Ying Jun Zhang, Mikhail S. Kondakov and Khaled Ben Letaief, Mikhail S. Kondakov and Guocong Song, Mikhail S. Kondakov and Seok Ho Cheon, Mikhail S. Kondakov and Do Hyon Yim, Mikhail S. Kondakov and Ki Tae Han, Mikhail S. Kondakov and Yun Sang Park, Seok Ho Cheon and Alexandre V. Garmonov, Seok Ho Cheon and Do Hyon Yim, Seok Ho Cheon and Yun Sang Park, Do Hyon Yim and Alexandre V. Garmonov, Do Hyon Yim and Ye Li, Do Hyon Yim and Ying Jun Zhang, Do Hyon Yim and Khaled Ben Letaief, Do Hyon Yim and Guocong Song, Do Hyon Yim and Yun Sang Park, Do Hyon Yim and Ki Tae Han, Ki Tae Han and Alexandre V. Garmonov, Ki Tae Han and Yun Sang Park, Yun Sang Park and Alexandre V. Garmonov, Yun Sang Park and Ying Jun Zhang, Yun Sang Park and Khaled Ben Letaief, Ye Li and Khaled Ben Letaief, Ye Li and Guocong Song, Ye Li and Ying Jun Zhang, Ye Li and Alexandre V. Garmonov, Guocong Song and Khaled Ben Letaief, Guocong Song and Alexandre V. Garmonov, Khaled Ben Letaief and Ying Jun Zhang, Khaled Ben Letaief and Alexandre V. Garmonov, Ying Jun Zhang and Alexandre V. Garmonov.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Andrew Y. Savinkov\", \"id\": 376672}, {\"name\": \"Jae Ho Lee\", \"id\": 670209}, {\"name\": \"Stanislav A. Filin\", \"id\": 376673}, {\"name\": \"Sergey N. Moiseev\", \"id\": 376675}, {\"name\": \"Mikhail S. Kondakov\", \"id\": 376676}, {\"name\": \"Seok Ho Cheon\", \"id\": 376677}, {\"name\": \"Do Hyon Yim\", \"id\": 376678}, {\"name\": \"Ki Tae Han\", \"id\": 376679}, {\"name\": \"Yun Sang Park\", \"id\": 376680}, {\"name\": \"Ye Li\", \"id\": 69419}, {\"name\": \"Guocong Song\", \"id\": 261327}, {\"name\": \"Khaled Ben Letaief\", \"id\": 159828}, {\"name\": \"Ying Jun Zhang\", \"id\": 71294}, {\"name\": \"Alexandre V. Garmonov\", \"id\": 376671}], \"links\": [{\"source\": 376672, \"target\": 376671}, {\"source\": 376672, \"target\": 376673}, {\"source\": 376672, \"target\": 376675}, {\"source\": 376672, \"target\": 376676}, {\"source\": 376672, \"target\": 376678}, {\"source\": 376672, \"target\": 376680}, {\"source\": 376672, \"target\": 670209}, {\"source\": 670209, \"target\": 376671}, {\"source\": 670209, \"target\": 376673}, {\"source\": 670209, \"target\": 376675}, {\"source\": 670209, \"target\": 376676}, {\"source\": 670209, \"target\": 376677}, {\"source\": 670209, \"target\": 376678}, {\"source\": 670209, \"target\": 376679}, {\"source\": 670209, \"target\": 376680}, {\"source\": 376673, \"target\": 376671}, {\"source\": 376673, \"target\": 69419}, {\"source\": 376673, \"target\": 71294}, {\"source\": 376673, \"target\": 159828}, {\"source\": 376673, \"target\": 261327}, {\"source\": 376673, \"target\": 376675}, {\"source\": 376673, \"target\": 376676}, {\"source\": 376673, \"target\": 376677}, {\"source\": 376673, \"target\": 376678}, {\"source\": 376673, \"target\": 376679}, {\"source\": 376673, \"target\": 376680}, {\"source\": 376675, \"target\": 376671}, {\"source\": 376675, \"target\": 69419}, {\"source\": 376675, \"target\": 71294}, {\"source\": 376675, \"target\": 159828}, {\"source\": 376675, \"target\": 261327}, {\"source\": 376675, \"target\": 376676}, {\"source\": 376675, \"target\": 376677}, {\"source\": 376675, \"target\": 376678}, {\"source\": 376675, \"target\": 376679}, {\"source\": 376675, \"target\": 376680}, {\"source\": 376676, \"target\": 376671}, {\"source\": 376676, \"target\": 69419}, {\"source\": 376676, \"target\": 71294}, {\"source\": 376676, \"target\": 159828}, {\"source\": 376676, \"target\": 261327}, {\"source\": 376676, \"target\": 376677}, {\"source\": 376676, \"target\": 376678}, {\"source\": 376676, \"target\": 376679}, {\"source\": 376676, \"target\": 376680}, {\"source\": 376677, \"target\": 376671}, {\"source\": 376677, \"target\": 376678}, {\"source\": 376677, \"target\": 376680}, {\"source\": 376678, \"target\": 376671}, {\"source\": 376678, \"target\": 69419}, {\"source\": 376678, \"target\": 71294}, {\"source\": 376678, \"target\": 159828}, {\"source\": 376678, \"target\": 261327}, {\"source\": 376678, \"target\": 376680}, {\"source\": 376678, \"target\": 376679}, {\"source\": 376679, \"target\": 376671}, {\"source\": 376679, \"target\": 376680}, {\"source\": 376680, \"target\": 376671}, {\"source\": 376680, \"target\": 71294}, {\"source\": 376680, \"target\": 159828}, {\"source\": 69419, \"target\": 159828}, {\"source\": 69419, \"target\": 261327}, {\"source\": 69419, \"target\": 71294}, {\"source\": 69419, \"target\": 376671}, {\"source\": 261327, \"target\": 159828}, {\"source\": 261327, \"target\": 376671}, {\"source\": 159828, \"target\": 71294}, {\"source\": 159828, \"target\": 376671}, {\"source\": 71294, \"target\": 376671}]}",
"id": 2428,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Andrew Y. Savinkov, Jae Ho Lee, Stanislav A. Filin, Sergey N. Moiseev, Mikhail S. Kondakov, Seok Ho Cheon, Do Hyon Yim, Ki Tae Han, Yun Sang Park, Ye Li, Guocong Song, Khaled Ben Letaief, Ying Jun Zhang, Alexandre V. Garmonov\n- Research collaborations between these authors: Andrew Y. Savinkov and Alexandre V. Garmonov, Andrew Y. Savinkov and Stanislav A. Filin, Andrew Y. Savinkov and Sergey N. Moiseev, Andrew Y. Savinkov and Mikhail S. Kondakov, Andrew Y. Savinkov and Do Hyon Yim, Andrew Y. Savinkov and Yun Sang Park, Andrew Y. Savinkov and Jae Ho Lee, Jae Ho Lee and Alexandre V. Garmonov, Jae Ho Lee and Stanislav A. Filin, Jae Ho Lee and Sergey N. Moiseev, Jae Ho Lee and Mikhail S. Kondakov, Jae Ho Lee and Seok Ho Cheon, Jae Ho Lee and Do Hyon Yim, Jae Ho Lee and Ki Tae Han, Jae Ho Lee and Yun Sang Park, Stanislav A. Filin and Alexandre V. Garmonov, Stanislav A. Filin and Ye Li, Stanislav A. Filin and Ying Jun Zhang, Stanislav A. Filin and Khaled Ben Letaief, Stanislav A. Filin and Guocong Song, Stanislav A. Filin and Sergey N. Moiseev, Stanislav A. Filin and Mikhail S. Kondakov, Stanislav A. Filin and Seok Ho Cheon, Stanislav A. Filin and Do Hyon Yim, Stanislav A. Filin and Ki Tae Han, Stanislav A. Filin and Yun Sang Park, Sergey N. Moiseev and Alexandre V. Garmonov, Sergey N. Moiseev and Ye Li, Sergey N. Moiseev and Ying Jun Zhang, Sergey N. Moiseev and Khaled Ben Letaief, Sergey N. Moiseev and Guocong Song, Sergey N. Moiseev and Mikhail S. Kondakov, Sergey N. Moiseev and Seok Ho Cheon, Sergey N. Moiseev and Do Hyon Yim, Sergey N. Moiseev and Ki Tae Han, Sergey N. Moiseev and Yun Sang Park, Mikhail S. Kondakov and Alexandre V. Garmonov, Mikhail S. Kondakov and Ye Li, Mikhail S. Kondakov and Ying Jun Zhang, Mikhail S. Kondakov and Khaled Ben Letaief, Mikhail S. Kondakov and Guocong Song, Mikhail S. Kondakov and Seok Ho Cheon, Mikhail S. Kondakov and Do Hyon Yim, Mikhail S. Kondakov and Ki Tae Han, Mikhail S. Kondakov and Yun Sang Park, Seok Ho Cheon and Alexandre V. Garmonov, Seok Ho Cheon and Do Hyon Yim, Seok Ho Cheon and Yun Sang Park, Do Hyon Yim and Alexandre V. Garmonov, Do Hyon Yim and Ye Li, Do Hyon Yim and Ying Jun Zhang, Do Hyon Yim and Khaled Ben Letaief, Do Hyon Yim and Guocong Song, Do Hyon Yim and Yun Sang Park, Do Hyon Yim and Ki Tae Han, Ki Tae Han and Alexandre V. Garmonov, Ki Tae Han and Yun Sang Park, Yun Sang Park and Alexandre V. Garmonov, Yun Sang Park and Ying Jun Zhang, Yun Sang Park and Khaled Ben Letaief, Ye Li and Khaled Ben Letaief, Ye Li and Guocong Song, Ye Li and Ying Jun Zhang, Ye Li and Alexandre V. Garmonov, Guocong Song and Khaled Ben Letaief, Guocong Song and Alexandre V. Garmonov, Khaled Ben Letaief and Ying Jun Zhang, Khaled Ben Letaief and Alexandre V. Garmonov, Ying Jun Zhang and Alexandre V. Garmonov.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Fatna Belqasmi, Roch H. Glitho, Wolfgang Kellerer, Juan Caceres, Noel Crespi, Felicián Németh, Imran Khan, Ferhat Khendek, Chunyan Fu, Rachida Dssouli, Per Kreuger, Terence Ambra, Rebecca Steinert, Ian F. Akyildiz\n- Research collaborations between these authors: Fatna Belqasmi and Noel Crespi, Fatna Belqasmi and Rachida Dssouli, Fatna Belqasmi and Wolfgang Kellerer, Fatna Belqasmi and Roch H. Glitho, Fatna Belqasmi and Ferhat Khendek, Fatna Belqasmi and Juan Caceres, Fatna Belqasmi and Ian F. Akyildiz, Fatna Belqasmi and Chunyan Fu, Fatna Belqasmi and Imran Khan, Fatna Belqasmi and Terence Ambra, Roch H. Glitho and Noel Crespi, Roch H. Glitho and Rachida Dssouli, Roch H. Glitho and Wolfgang Kellerer, Roch H. Glitho and Ferhat Khendek, Roch H. Glitho and Imran Khan, Roch H. Glitho and Juan Caceres, Roch H. Glitho and Ian F. Akyildiz, Roch H. Glitho and Chunyan Fu, Roch H. Glitho and Terence Ambra, Noel Crespi and Imran Khan, Noel Crespi and Ian F. Akyildiz, Felicián Németh and Per Kreuger, Felicián Németh and Rebecca Steinert, Felicián Németh and Chunyan Fu, Imran Khan and Ian F. Akyildiz, Ferhat Khendek and Rachida Dssouli, Ferhat Khendek and Ian F. Akyildiz, Ferhat Khendek and Chunyan Fu, Chunyan Fu and Rachida Dssouli, Chunyan Fu and Per Kreuger, Chunyan Fu and Rebecca Steinert, Chunyan Fu and Terence Ambra, Rachida Dssouli and Ian F. Akyildiz, Per Kreuger and Rebecca Steinert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Fatna Belqasmi\", \"id\": 62561}, {\"name\": \"Roch H. Glitho\", \"id\": 62562}, {\"name\": \"Wolfgang Kellerer\", \"id\": 25570}, {\"name\": \"Juan Caceres\", \"id\": 144035}, {\"name\": \"Noel Crespi\", \"id\": 43592}, {\"name\": \"Felici\\u00e1n N\\u00e9meth\", \"id\": 86603}, {\"name\": \"Imran Khan\", \"id\": 104879}, {\"name\": \"Ferhat Khendek\", \"id\": 102320}, {\"name\": \"Chunyan Fu\", \"id\": 539249}, {\"name\": \"Rachida Dssouli\", \"id\": 49810}, {\"name\": \"Per Kreuger\", \"id\": 155955}, {\"name\": \"Terence Ambra\", \"id\": 789495}, {\"name\": \"Rebecca Steinert\", \"id\": 260953}, {\"name\": \"Ian F. Akyildiz\", \"id\": 180218}], \"links\": [{\"source\": 62561, \"target\": 43592}, {\"source\": 62561, \"target\": 49810}, {\"source\": 62561, \"target\": 25570}, {\"source\": 62561, \"target\": 62562}, {\"source\": 62561, \"target\": 102320}, {\"source\": 62561, \"target\": 144035}, {\"source\": 62561, \"target\": 180218}, {\"source\": 62561, \"target\": 539249}, {\"source\": 62561, \"target\": 104879}, {\"source\": 62561, \"target\": 789495}, {\"source\": 62562, \"target\": 43592}, {\"source\": 62562, \"target\": 49810}, {\"source\": 62562, \"target\": 25570}, {\"source\": 62562, \"target\": 102320}, {\"source\": 62562, \"target\": 104879}, {\"source\": 62562, \"target\": 144035}, {\"source\": 62562, \"target\": 180218}, {\"source\": 62562, \"target\": 539249}, {\"source\": 62562, \"target\": 789495}, {\"source\": 43592, \"target\": 104879}, {\"source\": 43592, \"target\": 180218}, {\"source\": 86603, \"target\": 155955}, {\"source\": 86603, \"target\": 260953}, {\"source\": 86603, \"target\": 539249}, {\"source\": 104879, \"target\": 180218}, {\"source\": 102320, \"target\": 49810}, {\"source\": 102320, \"target\": 180218}, {\"source\": 102320, \"target\": 539249}, {\"source\": 539249, \"target\": 49810}, {\"source\": 539249, \"target\": 155955}, {\"source\": 539249, \"target\": 260953}, {\"source\": 539249, \"target\": 789495}, {\"source\": 49810, \"target\": 180218}, {\"source\": 155955, \"target\": 260953}]}",
"id": 1194,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Fatna Belqasmi, Roch H. Glitho, Wolfgang Kellerer, Juan Caceres, Noel Crespi, Felicián Németh, Imran Khan, Ferhat Khendek, Chunyan Fu, Rachida Dssouli, Per Kreuger, Terence Ambra, Rebecca Steinert, Ian F. Akyildiz\n- Research collaborations between these authors: Fatna Belqasmi and Noel Crespi, Fatna Belqasmi and Rachida Dssouli, Fatna Belqasmi and Wolfgang Kellerer, Fatna Belqasmi and Roch H. Glitho, Fatna Belqasmi and Ferhat Khendek, Fatna Belqasmi and Juan Caceres, Fatna Belqasmi and Ian F. Akyildiz, Fatna Belqasmi and Chunyan Fu, Fatna Belqasmi and Imran Khan, Fatna Belqasmi and Terence Ambra, Roch H. Glitho and Noel Crespi, Roch H. Glitho and Rachida Dssouli, Roch H. Glitho and Wolfgang Kellerer, Roch H. Glitho and Ferhat Khendek, Roch H. Glitho and Imran Khan, Roch H. Glitho and Juan Caceres, Roch H. Glitho and Ian F. Akyildiz, Roch H. Glitho and Chunyan Fu, Roch H. Glitho and Terence Ambra, Noel Crespi and Imran Khan, Noel Crespi and Ian F. Akyildiz, Felicián Németh and Per Kreuger, Felicián Németh and Rebecca Steinert, Felicián Németh and Chunyan Fu, Imran Khan and Ian F. Akyildiz, Ferhat Khendek and Rachida Dssouli, Ferhat Khendek and Ian F. Akyildiz, Ferhat Khendek and Chunyan Fu, Chunyan Fu and Rachida Dssouli, Chunyan Fu and Per Kreuger, Chunyan Fu and Rebecca Steinert, Chunyan Fu and Terence Ambra, Rachida Dssouli and Ian F. Akyildiz, Per Kreuger and Rebecca Steinert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Christian Wagner, Patricia Melin, Amir Pourabdollah, Ana Belén Cara, Jabran Hussain Aladi, Jerry M. Mendel, Hani Hagras, Woei Wan Tan, Héctor Pomares, Ignacio Rojas, Nazanin Sahab, Oscar Castillo, Oscar Montiel, Jonathan M. Garibaldi\n- Research collaborations between these authors: Christian Wagner and Patricia Melin, Christian Wagner and Oscar Castillo, Christian Wagner and Héctor Pomares, Christian Wagner and Ignacio Rojas, Christian Wagner and Hani Hagras, Christian Wagner and Jonathan M. Garibaldi, Christian Wagner and Jerry M. Mendel, Christian Wagner and Oscar Montiel, Christian Wagner and Woei Wan Tan, Christian Wagner and Amir Pourabdollah, Christian Wagner and Ana Belén Cara, Christian Wagner and Nazanin Sahab, Christian Wagner and Jabran Hussain Aladi, Patricia Melin and Oscar Castillo, Patricia Melin and Hani Hagras, Patricia Melin and Jerry M. Mendel, Patricia Melin and Oscar Montiel, Patricia Melin and Woei Wan Tan, Patricia Melin and Héctor Pomares, Patricia Melin and Ignacio Rojas, Patricia Melin and Jonathan M. Garibaldi, Patricia Melin and Ana Belén Cara, Patricia Melin and Jabran Hussain Aladi, Amir Pourabdollah and Jonathan M. Garibaldi, Amir Pourabdollah and Oscar Castillo, Amir Pourabdollah and Héctor Pomares, Amir Pourabdollah and Ignacio Rojas, Amir Pourabdollah and Hani Hagras, Amir Pourabdollah and Jerry M. Mendel, Amir Pourabdollah and Ana Belén Cara, Amir Pourabdollah and Nazanin Sahab, Amir Pourabdollah and Jabran Hussain Aladi, Ana Belén Cara and Héctor Pomares, Ana Belén Cara and Ignacio Rojas, Ana Belén Cara and Hani Hagras, Ana Belén Cara and Jonathan M. Garibaldi, Ana Belén Cara and Oscar Castillo, Ana Belén Cara and Jerry M. Mendel, Ana Belén Cara and Jabran Hussain Aladi, Jabran Hussain Aladi and Jonathan M. Garibaldi, Jabran Hussain Aladi and Oscar Castillo, Jabran Hussain Aladi and Héctor Pomares, Jabran Hussain Aladi and Ignacio Rojas, Jabran Hussain Aladi and Hani Hagras, Jabran Hussain Aladi and Jerry M. Mendel, Jabran Hussain Aladi and Nazanin Sahab, Jerry M. Mendel and Oscar Castillo, Jerry M. Mendel and Héctor Pomares, Jerry M. Mendel and Ignacio Rojas, Jerry M. Mendel and Hani Hagras, Jerry M. Mendel and Jonathan M. Garibaldi, Jerry M. Mendel and Oscar Montiel, Jerry M. Mendel and Woei Wan Tan, Hani Hagras and Oscar Castillo, Hani Hagras and Héctor Pomares, Hani Hagras and Ignacio Rojas, Hani Hagras and Jonathan M. Garibaldi, Hani Hagras and Oscar Montiel, Hani Hagras and Woei Wan Tan, Woei Wan Tan and Oscar Castillo, Woei Wan Tan and Jonathan M. Garibaldi, Héctor Pomares and Oscar Castillo, Héctor Pomares and Ignacio Rojas, Héctor Pomares and Jonathan M. Garibaldi, Ignacio Rojas and Oscar Castillo, Ignacio Rojas and Jonathan M. Garibaldi, Nazanin Sahab and Jonathan M. Garibaldi, Oscar Castillo and Jonathan M. Garibaldi, Oscar Castillo and Oscar Montiel, Oscar Montiel and Jonathan M. Garibaldi.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 10,
"style": "rule"
}
|
{
"exact_answer": 10,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Christian Wagner\", \"id\": 49635}, {\"name\": \"Amir Pourabdollah\", \"id\": 284487}, {\"name\": \"Ana Bel\\u00e9n Cara\", \"id\": 356654}, {\"name\": \"Jabran Hussain Aladi\", \"id\": 924947}, {\"name\": \"Jerry M. Mendel\", \"id\": 42900}, {\"name\": \"Hani Hagras\", \"id\": 20437}, {\"name\": \"Woei Wan Tan\", \"id\": 258773}, {\"name\": \"H\\u00e9ctor Pomares\", \"id\": 12087}, {\"name\": \"Ignacio Rojas\", \"id\": 12088}, {\"name\": \"Nazanin Sahab\", \"id\": 634490}, {\"name\": \"Patricia Melin\", \"id\": 58}, {\"name\": \"Oscar Castillo\", \"id\": 59}, {\"name\": \"Oscar Montiel\", \"id\": 50077}, {\"name\": \"Jonathan M. Garibaldi\", \"id\": 24286}], \"links\": [{\"source\": 49635, \"target\": 58}, {\"source\": 49635, \"target\": 59}, {\"source\": 49635, \"target\": 12087}, {\"source\": 49635, \"target\": 12088}, {\"source\": 49635, \"target\": 20437}, {\"source\": 49635, \"target\": 24286}, {\"source\": 49635, \"target\": 42900}, {\"source\": 49635, \"target\": 50077}, {\"source\": 49635, \"target\": 258773}, {\"source\": 49635, \"target\": 284487}, {\"source\": 49635, \"target\": 356654}, {\"source\": 49635, \"target\": 634490}, {\"source\": 49635, \"target\": 924947}, {\"source\": 284487, \"target\": 24286}, {\"source\": 284487, \"target\": 59}, {\"source\": 284487, \"target\": 12087}, {\"source\": 284487, \"target\": 12088}, {\"source\": 284487, \"target\": 20437}, {\"source\": 284487, \"target\": 42900}, {\"source\": 284487, \"target\": 356654}, {\"source\": 284487, \"target\": 634490}, {\"source\": 284487, \"target\": 924947}, {\"source\": 356654, \"target\": 12087}, {\"source\": 356654, \"target\": 12088}, {\"source\": 356654, \"target\": 20437}, {\"source\": 356654, \"target\": 24286}, {\"source\": 356654, \"target\": 58}, {\"source\": 356654, \"target\": 59}, {\"source\": 356654, \"target\": 42900}, {\"source\": 356654, \"target\": 924947}, {\"source\": 924947, \"target\": 24286}, {\"source\": 924947, \"target\": 58}, {\"source\": 924947, \"target\": 59}, {\"source\": 924947, \"target\": 12087}, {\"source\": 924947, \"target\": 12088}, {\"source\": 924947, \"target\": 20437}, {\"source\": 924947, \"target\": 42900}, {\"source\": 924947, \"target\": 634490}, {\"source\": 42900, \"target\": 58}, {\"source\": 42900, \"target\": 59}, {\"source\": 42900, \"target\": 12087}, {\"source\": 42900, \"target\": 12088}, {\"source\": 42900, \"target\": 20437}, {\"source\": 42900, \"target\": 24286}, {\"source\": 42900, \"target\": 50077}, {\"source\": 42900, \"target\": 258773}, {\"source\": 20437, \"target\": 58}, {\"source\": 20437, \"target\": 59}, {\"source\": 20437, \"target\": 12087}, {\"source\": 20437, \"target\": 12088}, {\"source\": 20437, \"target\": 24286}, {\"source\": 20437, \"target\": 50077}, {\"source\": 20437, \"target\": 258773}, {\"source\": 258773, \"target\": 58}, {\"source\": 258773, \"target\": 59}, {\"source\": 258773, \"target\": 24286}, {\"source\": 12087, \"target\": 58}, {\"source\": 12087, \"target\": 59}, {\"source\": 12087, \"target\": 12088}, {\"source\": 12087, \"target\": 24286}, {\"source\": 12088, \"target\": 58}, {\"source\": 12088, \"target\": 59}, {\"source\": 12088, \"target\": 24286}, {\"source\": 634490, \"target\": 24286}, {\"source\": 58, \"target\": 59}, {\"source\": 58, \"target\": 50077}, {\"source\": 58, \"target\": 24286}, {\"source\": 59, \"target\": 24286}, {\"source\": 59, \"target\": 50077}, {\"source\": 50077, \"target\": 24286}]}",
"id": 293,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Christian Wagner, Patricia Melin, Amir Pourabdollah, Ana Belén Cara, Jabran Hussain Aladi, Jerry M. Mendel, Hani Hagras, Woei Wan Tan, Héctor Pomares, Ignacio Rojas, Nazanin Sahab, Oscar Castillo, Oscar Montiel, Jonathan M. Garibaldi\n- Research collaborations between these authors: Christian Wagner and Patricia Melin, Christian Wagner and Oscar Castillo, Christian Wagner and Héctor Pomares, Christian Wagner and Ignacio Rojas, Christian Wagner and Hani Hagras, Christian Wagner and Jonathan M. Garibaldi, Christian Wagner and Jerry M. Mendel, Christian Wagner and Oscar Montiel, Christian Wagner and Woei Wan Tan, Christian Wagner and Amir Pourabdollah, Christian Wagner and Ana Belén Cara, Christian Wagner and Nazanin Sahab, Christian Wagner and Jabran Hussain Aladi, Patricia Melin and Oscar Castillo, Patricia Melin and Hani Hagras, Patricia Melin and Jerry M. Mendel, Patricia Melin and Oscar Montiel, Patricia Melin and Woei Wan Tan, Patricia Melin and Héctor Pomares, Patricia Melin and Ignacio Rojas, Patricia Melin and Jonathan M. Garibaldi, Patricia Melin and Ana Belén Cara, Patricia Melin and Jabran Hussain Aladi, Amir Pourabdollah and Jonathan M. Garibaldi, Amir Pourabdollah and Oscar Castillo, Amir Pourabdollah and Héctor Pomares, Amir Pourabdollah and Ignacio Rojas, Amir Pourabdollah and Hani Hagras, Amir Pourabdollah and Jerry M. Mendel, Amir Pourabdollah and Ana Belén Cara, Amir Pourabdollah and Nazanin Sahab, Amir Pourabdollah and Jabran Hussain Aladi, Ana Belén Cara and Héctor Pomares, Ana Belén Cara and Ignacio Rojas, Ana Belén Cara and Hani Hagras, Ana Belén Cara and Jonathan M. Garibaldi, Ana Belén Cara and Oscar Castillo, Ana Belén Cara and Jerry M. Mendel, Ana Belén Cara and Jabran Hussain Aladi, Jabran Hussain Aladi and Jonathan M. Garibaldi, Jabran Hussain Aladi and Oscar Castillo, Jabran Hussain Aladi and Héctor Pomares, Jabran Hussain Aladi and Ignacio Rojas, Jabran Hussain Aladi and Hani Hagras, Jabran Hussain Aladi and Jerry M. Mendel, Jabran Hussain Aladi and Nazanin Sahab, Jerry M. Mendel and Oscar Castillo, Jerry M. Mendel and Héctor Pomares, Jerry M. Mendel and Ignacio Rojas, Jerry M. Mendel and Hani Hagras, Jerry M. Mendel and Jonathan M. Garibaldi, Jerry M. Mendel and Oscar Montiel, Jerry M. Mendel and Woei Wan Tan, Hani Hagras and Oscar Castillo, Hani Hagras and Héctor Pomares, Hani Hagras and Ignacio Rojas, Hani Hagras and Jonathan M. Garibaldi, Hani Hagras and Oscar Montiel, Hani Hagras and Woei Wan Tan, Woei Wan Tan and Oscar Castillo, Woei Wan Tan and Jonathan M. Garibaldi, Héctor Pomares and Oscar Castillo, Héctor Pomares and Ignacio Rojas, Héctor Pomares and Jonathan M. Garibaldi, Ignacio Rojas and Oscar Castillo, Ignacio Rojas and Jonathan M. Garibaldi, Nazanin Sahab and Jonathan M. Garibaldi, Oscar Castillo and Jonathan M. Garibaldi, Oscar Castillo and Oscar Montiel, Oscar Montiel and Jonathan M. Garibaldi.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Fabrício Benevenuto, Johan Bollen, Matheus Araújo, Pollyanna Gonçalves, Meeyoung Cha, Erik Cambria, Janyce Wiebe, Swapna Somasundaran, Krishna P. Gummadi, Shrikanth Narayanan, Claire Cardie, Gerhard Backfried, Julio Cesar Dos Reis, François Bar\n- Research collaborations between these authors: Fabrício Benevenuto and Julio Cesar Dos Reis, Fabrício Benevenuto and Krishna P. Gummadi, Fabrício Benevenuto and Janyce Wiebe, Fabrício Benevenuto and Shrikanth Narayanan, Fabrício Benevenuto and Claire Cardie, Fabrício Benevenuto and Erik Cambria, Fabrício Benevenuto and Swapna Somasundaran, Fabrício Benevenuto and Johan Bollen, Fabrício Benevenuto and Matheus Araújo, Fabrício Benevenuto and Pollyanna Gonçalves, Fabrício Benevenuto and Meeyoung Cha, Fabrício Benevenuto and François Bar, Fabrício Benevenuto and Gerhard Backfried, Johan Bollen and Janyce Wiebe, Johan Bollen and Matheus Araújo, Johan Bollen and Pollyanna Gonçalves, Johan Bollen and Meeyoung Cha, Matheus Araújo and Julio Cesar Dos Reis, Matheus Araújo and Janyce Wiebe, Matheus Araújo and Shrikanth Narayanan, Matheus Araújo and Krishna P. Gummadi, Matheus Araújo and Claire Cardie, Matheus Araújo and Erik Cambria, Matheus Araújo and Swapna Somasundaran, Matheus Araújo and Pollyanna Gonçalves, Matheus Araújo and Meeyoung Cha, Matheus Araújo and François Bar, Pollyanna Gonçalves and Julio Cesar Dos Reis, Pollyanna Gonçalves and Gerhard Backfried, Pollyanna Gonçalves and Janyce Wiebe, Pollyanna Gonçalves and Shrikanth Narayanan, Pollyanna Gonçalves and Krishna P. Gummadi, Pollyanna Gonçalves and Erik Cambria, Pollyanna Gonçalves and Meeyoung Cha, Pollyanna Gonçalves and François Bar, Meeyoung Cha and Julio Cesar Dos Reis, Meeyoung Cha and Krishna P. Gummadi, Meeyoung Cha and Gerhard Backfried, Erik Cambria and Janyce Wiebe, Erik Cambria and Shrikanth Narayanan, Erik Cambria and Claire Cardie, Erik Cambria and Swapna Somasundaran, Janyce Wiebe and Claire Cardie, Janyce Wiebe and Swapna Somasundaran, Swapna Somasundaran and Claire Cardie.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Fabr\\u00edcio Benevenuto\", \"id\": 105058}, {\"name\": \"Johan Bollen\", \"id\": 77826}, {\"name\": \"Matheus Ara\\u00fajo\", \"id\": 133224}, {\"name\": \"Pollyanna Gon\\u00e7alves\", \"id\": 133225}, {\"name\": \"Meeyoung Cha\", \"id\": 133226}, {\"name\": \"Erik Cambria\", \"id\": 36908}, {\"name\": \"Janyce Wiebe\", \"id\": 7599}, {\"name\": \"Swapna Somasundaran\", \"id\": 66319}, {\"name\": \"Krishna P. Gummadi\", \"id\": 18546}, {\"name\": \"Shrikanth Narayanan\", \"id\": 13171}, {\"name\": \"Claire Cardie\", \"id\": 19795}, {\"name\": \"Gerhard Backfried\", \"id\": 121147}, {\"name\": \"Julio Cesar Dos Reis\", \"id\": 16252}, {\"name\": \"Fran\\u00e7ois Bar\", \"id\": 378494}], \"links\": [{\"source\": 105058, \"target\": 16252}, {\"source\": 105058, \"target\": 18546}, {\"source\": 105058, \"target\": 7599}, {\"source\": 105058, \"target\": 13171}, {\"source\": 105058, \"target\": 19795}, {\"source\": 105058, \"target\": 36908}, {\"source\": 105058, \"target\": 66319}, {\"source\": 105058, \"target\": 77826}, {\"source\": 105058, \"target\": 133224}, {\"source\": 105058, \"target\": 133225}, {\"source\": 105058, \"target\": 133226}, {\"source\": 105058, \"target\": 378494}, {\"source\": 105058, \"target\": 121147}, {\"source\": 77826, \"target\": 7599}, {\"source\": 77826, \"target\": 133224}, {\"source\": 77826, \"target\": 133225}, {\"source\": 77826, \"target\": 133226}, {\"source\": 133224, \"target\": 16252}, {\"source\": 133224, \"target\": 7599}, {\"source\": 133224, \"target\": 13171}, {\"source\": 133224, \"target\": 18546}, {\"source\": 133224, \"target\": 19795}, {\"source\": 133224, \"target\": 36908}, {\"source\": 133224, \"target\": 66319}, {\"source\": 133224, \"target\": 133225}, {\"source\": 133224, \"target\": 133226}, {\"source\": 133224, \"target\": 378494}, {\"source\": 133225, \"target\": 16252}, {\"source\": 133225, \"target\": 121147}, {\"source\": 133225, \"target\": 7599}, {\"source\": 133225, \"target\": 13171}, {\"source\": 133225, \"target\": 18546}, {\"source\": 133225, \"target\": 36908}, {\"source\": 133225, \"target\": 133226}, {\"source\": 133225, \"target\": 378494}, {\"source\": 133226, \"target\": 16252}, {\"source\": 133226, \"target\": 18546}, {\"source\": 133226, \"target\": 121147}, {\"source\": 36908, \"target\": 7599}, {\"source\": 36908, \"target\": 13171}, {\"source\": 36908, \"target\": 19795}, {\"source\": 36908, \"target\": 66319}, {\"source\": 7599, \"target\": 19795}, {\"source\": 7599, \"target\": 66319}, {\"source\": 66319, \"target\": 19795}]}",
"id": 475,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Fabrício Benevenuto, Johan Bollen, Matheus Araújo, Pollyanna Gonçalves, Meeyoung Cha, Erik Cambria, Janyce Wiebe, Swapna Somasundaran, Krishna P. Gummadi, Shrikanth Narayanan, Claire Cardie, Gerhard Backfried, Julio Cesar Dos Reis, François Bar\n- Research collaborations between these authors: Fabrício Benevenuto and Julio Cesar Dos Reis, Fabrício Benevenuto and Krishna P. Gummadi, Fabrício Benevenuto and Janyce Wiebe, Fabrício Benevenuto and Shrikanth Narayanan, Fabrício Benevenuto and Claire Cardie, Fabrício Benevenuto and Erik Cambria, Fabrício Benevenuto and Swapna Somasundaran, Fabrício Benevenuto and Johan Bollen, Fabrício Benevenuto and Matheus Araújo, Fabrício Benevenuto and Pollyanna Gonçalves, Fabrício Benevenuto and Meeyoung Cha, Fabrício Benevenuto and François Bar, Fabrício Benevenuto and Gerhard Backfried, Johan Bollen and Janyce Wiebe, Johan Bollen and Matheus Araújo, Johan Bollen and Pollyanna Gonçalves, Johan Bollen and Meeyoung Cha, Matheus Araújo and Julio Cesar Dos Reis, Matheus Araújo and Janyce Wiebe, Matheus Araújo and Shrikanth Narayanan, Matheus Araújo and Krishna P. Gummadi, Matheus Araújo and Claire Cardie, Matheus Araújo and Erik Cambria, Matheus Araújo and Swapna Somasundaran, Matheus Araújo and Pollyanna Gonçalves, Matheus Araújo and Meeyoung Cha, Matheus Araújo and François Bar, Pollyanna Gonçalves and Julio Cesar Dos Reis, Pollyanna Gonçalves and Gerhard Backfried, Pollyanna Gonçalves and Janyce Wiebe, Pollyanna Gonçalves and Shrikanth Narayanan, Pollyanna Gonçalves and Krishna P. Gummadi, Pollyanna Gonçalves and Erik Cambria, Pollyanna Gonçalves and Meeyoung Cha, Pollyanna Gonçalves and François Bar, Meeyoung Cha and Julio Cesar Dos Reis, Meeyoung Cha and Krishna P. Gummadi, Meeyoung Cha and Gerhard Backfried, Erik Cambria and Janyce Wiebe, Erik Cambria and Shrikanth Narayanan, Erik Cambria and Claire Cardie, Erik Cambria and Swapna Somasundaran, Janyce Wiebe and Claire Cardie, Janyce Wiebe and Swapna Somasundaran, Swapna Somasundaran and Claire Cardie.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Naiara Aginako, Ekaitz Jauregi, Henrik I. Christensen, Matthias Franz, José María Martínez-Otzeta, Huosheng Hu, Hanspeter A. Mallot, Pedro Revuelta, Nicola Bellotto, Iñaki Inza, Loreto Susperregi, Elena Lazkano, Basilio Sierra, Michele Nappi\n- Research collaborations between these authors: Naiara Aginako and Michele Nappi, Naiara Aginako and Basilio Sierra, Naiara Aginako and José María Martínez-Otzeta, Naiara Aginako and Elena Lazkano, Naiara Aginako and Ekaitz Jauregi, Ekaitz Jauregi and Basilio Sierra, Ekaitz Jauregi and José María Martínez-Otzeta, Ekaitz Jauregi and Elena Lazkano, Ekaitz Jauregi and Iñaki Inza, Ekaitz Jauregi and Henrik I. Christensen, Henrik I. Christensen and Huosheng Hu, Henrik I. Christensen and Basilio Sierra, Henrik I. Christensen and José María Martínez-Otzeta, Henrik I. Christensen and Elena Lazkano, Matthias Franz and Basilio Sierra, Matthias Franz and Elena Lazkano, José María Martínez-Otzeta and Basilio Sierra, José María Martínez-Otzeta and Michele Nappi, José María Martínez-Otzeta and Huosheng Hu, José María Martínez-Otzeta and Iñaki Inza, José María Martínez-Otzeta and Nicola Bellotto, José María Martínez-Otzeta and Loreto Susperregi, José María Martínez-Otzeta and Elena Lazkano, José María Martínez-Otzeta and Pedro Revuelta, Huosheng Hu and Nicola Bellotto, Huosheng Hu and Basilio Sierra, Huosheng Hu and Loreto Susperregi, Huosheng Hu and Elena Lazkano, Hanspeter A. Mallot and Basilio Sierra, Hanspeter A. Mallot and Elena Lazkano, Pedro Revuelta and Basilio Sierra, Pedro Revuelta and Elena Lazkano, Nicola Bellotto and Basilio Sierra, Nicola Bellotto and Loreto Susperregi, Nicola Bellotto and Elena Lazkano, Iñaki Inza and Basilio Sierra, Iñaki Inza and Elena Lazkano, Loreto Susperregi and Basilio Sierra, Loreto Susperregi and Elena Lazkano, Elena Lazkano and Basilio Sierra, Basilio Sierra and Michele Nappi.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Naiara Aginako\", \"id\": 895489}, {\"name\": \"Ekaitz Jauregi\", \"id\": 317729}, {\"name\": \"Henrik I. Christensen\", \"id\": 103912}, {\"name\": \"Huosheng Hu\", \"id\": 47021}, {\"name\": \"Jos\\u00e9 Mar\\u00eda Mart\\u00ednez-Otzeta\", \"id\": 148205}, {\"name\": \"Hanspeter A. Mallot\", \"id\": 151060}, {\"name\": \"Pedro Revuelta\", \"id\": 534901}, {\"name\": \"Nicola Bellotto\", \"id\": 108892}, {\"name\": \"Michele Nappi\", \"id\": 27583}, {\"name\": \"I\\u00f1aki Inza\", \"id\": 62746}, {\"name\": \"Loreto Susperregi\", \"id\": 159323}, {\"name\": \"Elena Lazkano\", \"id\": 159324}, {\"name\": \"Matthias Franz\", \"id\": 136830}, {\"name\": \"Basilio Sierra\", \"id\": 62750}], \"links\": [{\"source\": 895489, \"target\": 27583}, {\"source\": 895489, \"target\": 62750}, {\"source\": 895489, \"target\": 148205}, {\"source\": 895489, \"target\": 159324}, {\"source\": 895489, \"target\": 317729}, {\"source\": 317729, \"target\": 62750}, {\"source\": 317729, \"target\": 148205}, {\"source\": 317729, \"target\": 159324}, {\"source\": 317729, \"target\": 62746}, {\"source\": 317729, \"target\": 103912}, {\"source\": 103912, \"target\": 47021}, {\"source\": 103912, \"target\": 62750}, {\"source\": 103912, \"target\": 148205}, {\"source\": 103912, \"target\": 159324}, {\"source\": 47021, \"target\": 108892}, {\"source\": 47021, \"target\": 62750}, {\"source\": 47021, \"target\": 148205}, {\"source\": 47021, \"target\": 159323}, {\"source\": 47021, \"target\": 159324}, {\"source\": 148205, \"target\": 62750}, {\"source\": 148205, \"target\": 27583}, {\"source\": 148205, \"target\": 62746}, {\"source\": 148205, \"target\": 108892}, {\"source\": 148205, \"target\": 159323}, {\"source\": 148205, \"target\": 159324}, {\"source\": 148205, \"target\": 534901}, {\"source\": 151060, \"target\": 62750}, {\"source\": 151060, \"target\": 159324}, {\"source\": 534901, \"target\": 62750}, {\"source\": 534901, \"target\": 159324}, {\"source\": 108892, \"target\": 62750}, {\"source\": 108892, \"target\": 159323}, {\"source\": 108892, \"target\": 159324}, {\"source\": 27583, \"target\": 62750}, {\"source\": 62746, \"target\": 62750}, {\"source\": 62746, \"target\": 159324}, {\"source\": 159323, \"target\": 62750}, {\"source\": 159323, \"target\": 159324}, {\"source\": 159324, \"target\": 62750}, {\"source\": 159324, \"target\": 136830}, {\"source\": 136830, \"target\": 62750}]}",
"id": 2223,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Naiara Aginako, Ekaitz Jauregi, Henrik I. Christensen, Matthias Franz, José María Martínez-Otzeta, Huosheng Hu, Hanspeter A. Mallot, Pedro Revuelta, Nicola Bellotto, Iñaki Inza, Loreto Susperregi, Elena Lazkano, Basilio Sierra, Michele Nappi\n- Research collaborations between these authors: Naiara Aginako and Michele Nappi, Naiara Aginako and Basilio Sierra, Naiara Aginako and José María Martínez-Otzeta, Naiara Aginako and Elena Lazkano, Naiara Aginako and Ekaitz Jauregi, Ekaitz Jauregi and Basilio Sierra, Ekaitz Jauregi and José María Martínez-Otzeta, Ekaitz Jauregi and Elena Lazkano, Ekaitz Jauregi and Iñaki Inza, Ekaitz Jauregi and Henrik I. Christensen, Henrik I. Christensen and Huosheng Hu, Henrik I. Christensen and Basilio Sierra, Henrik I. Christensen and José María Martínez-Otzeta, Henrik I. Christensen and Elena Lazkano, Matthias Franz and Basilio Sierra, Matthias Franz and Elena Lazkano, José María Martínez-Otzeta and Basilio Sierra, José María Martínez-Otzeta and Michele Nappi, José María Martínez-Otzeta and Huosheng Hu, José María Martínez-Otzeta and Iñaki Inza, José María Martínez-Otzeta and Nicola Bellotto, José María Martínez-Otzeta and Loreto Susperregi, José María Martínez-Otzeta and Elena Lazkano, José María Martínez-Otzeta and Pedro Revuelta, Huosheng Hu and Nicola Bellotto, Huosheng Hu and Basilio Sierra, Huosheng Hu and Loreto Susperregi, Huosheng Hu and Elena Lazkano, Hanspeter A. Mallot and Basilio Sierra, Hanspeter A. Mallot and Elena Lazkano, Pedro Revuelta and Basilio Sierra, Pedro Revuelta and Elena Lazkano, Nicola Bellotto and Basilio Sierra, Nicola Bellotto and Loreto Susperregi, Nicola Bellotto and Elena Lazkano, Iñaki Inza and Basilio Sierra, Iñaki Inza and Elena Lazkano, Loreto Susperregi and Basilio Sierra, Loreto Susperregi and Elena Lazkano, Elena Lazkano and Basilio Sierra, Basilio Sierra and Michele Nappi.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Iana Siomina, Hong Cheng, Martin Haardt, Min Sheng, Shuigeng Zhou, Pietro Perona, Junsong Yuan, Anil K. Jain, Ankur Bansal, Xianchao Zhang, Madhu Sudan, Wei Zhang, Wei Xu, Qiuxia Wu\n- Research collaborations between these authors: Iana Siomina and Wei Xu, Hong Cheng and Pietro Perona, Hong Cheng and Junsong Yuan, Pietro Perona and Wei Zhang, Pietro Perona and Wei Xu, Pietro Perona and Anil K. Jain, Pietro Perona and Junsong Yuan, Junsong Yuan and Wei Zhang, Junsong Yuan and Wei Xu, Anil K. Jain and Wei Zhang, Anil K. Jain and Xianchao Zhang, Anil K. Jain and Qiuxia Wu, Xianchao Zhang and Wei Xu, Wei Zhang and Wei Xu, Wei Xu and Qiuxia Wu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Iana Siomina\", \"id\": 346722}, {\"name\": \"Hong Cheng\", \"id\": 99971}, {\"name\": \"Martin Haardt\", \"id\": 226405}, {\"name\": \"Min Sheng\", \"id\": 207655}, {\"name\": \"Shuigeng Zhou\", \"id\": 74408}, {\"name\": \"Pietro Perona\", \"id\": 7794}, {\"name\": \"Junsong Yuan\", \"id\": 143027}, {\"name\": \"Anil K. Jain\", \"id\": 28181}, {\"name\": \"Ankur Bansal\", \"id\": 312821}, {\"name\": \"Xianchao Zhang\", \"id\": 119671}, {\"name\": \"Madhu Sudan\", \"id\": 34072}, {\"name\": \"Wei Zhang\", \"id\": 10714}, {\"name\": \"Wei Xu\", \"id\": 15390}, {\"name\": \"Qiuxia Wu\", \"id\": 497562}], \"links\": [{\"source\": 346722, \"target\": 15390}, {\"source\": 99971, \"target\": 7794}, {\"source\": 99971, \"target\": 143027}, {\"source\": 7794, \"target\": 10714}, {\"source\": 7794, \"target\": 15390}, {\"source\": 7794, \"target\": 28181}, {\"source\": 7794, \"target\": 143027}, {\"source\": 143027, \"target\": 10714}, {\"source\": 143027, \"target\": 15390}, {\"source\": 28181, \"target\": 10714}, {\"source\": 28181, \"target\": 119671}, {\"source\": 28181, \"target\": 497562}, {\"source\": 119671, \"target\": 15390}, {\"source\": 10714, \"target\": 15390}, {\"source\": 15390, \"target\": 497562}]}",
"id": 1306,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Iana Siomina, Hong Cheng, Martin Haardt, Min Sheng, Shuigeng Zhou, Pietro Perona, Junsong Yuan, Anil K. Jain, Ankur Bansal, Xianchao Zhang, Madhu Sudan, Wei Zhang, Wei Xu, Qiuxia Wu\n- Research collaborations between these authors: Iana Siomina and Wei Xu, Hong Cheng and Pietro Perona, Hong Cheng and Junsong Yuan, Pietro Perona and Wei Zhang, Pietro Perona and Wei Xu, Pietro Perona and Anil K. Jain, Pietro Perona and Junsong Yuan, Junsong Yuan and Wei Zhang, Junsong Yuan and Wei Xu, Anil K. Jain and Wei Zhang, Anil K. Jain and Xianchao Zhang, Anil K. Jain and Qiuxia Wu, Xianchao Zhang and Wei Xu, Wei Zhang and Wei Xu, Wei Xu and Qiuxia Wu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Filippo Cugini, Josep M. Fabrega, Masahiko Jinno, Xavier Marcote, Marc Bohn, Andrew Lord, Antonio Napoli, Piero Castoldi, Georgios Zervas, Matthias Gunkel, E. Hugues-Salas, Antonio D'Errico, Camino Balbuena, Nicola Sambo\n- Research collaborations between these authors: Filippo Cugini and Piero Castoldi, Filippo Cugini and Nicola Sambo, Filippo Cugini and Josep M. Fabrega, Filippo Cugini and Georgios Zervas, Filippo Cugini and Andrew Lord, Filippo Cugini and Masahiko Jinno, Josep M. Fabrega and Camino Balbuena, Josep M. Fabrega and Xavier Marcote, Josep M. Fabrega and Piero Castoldi, Josep M. Fabrega and Marc Bohn, Josep M. Fabrega and Antonio Napoli, Josep M. Fabrega and Antonio D'Errico, Josep M. Fabrega and Matthias Gunkel, Josep M. Fabrega and Nicola Sambo, Josep M. Fabrega and Georgios Zervas, Josep M. Fabrega and Andrew Lord, Josep M. Fabrega and Masahiko Jinno, Josep M. Fabrega and E. Hugues-Salas, Masahiko Jinno and Piero Castoldi, Masahiko Jinno and Marc Bohn, Masahiko Jinno and Antonio Napoli, Masahiko Jinno and Antonio D'Errico, Masahiko Jinno and Matthias Gunkel, Masahiko Jinno and Nicola Sambo, Masahiko Jinno and E. Hugues-Salas, Masahiko Jinno and Georgios Zervas, Masahiko Jinno and Andrew Lord, Xavier Marcote and Camino Balbuena, Marc Bohn and Antonio Napoli, Marc Bohn and Antonio D'Errico, Marc Bohn and Nicola Sambo, Marc Bohn and Georgios Zervas, Marc Bohn and Andrew Lord, Andrew Lord and Piero Castoldi, Andrew Lord and Antonio Napoli, Andrew Lord and Antonio D'Errico, Andrew Lord and Nicola Sambo, Andrew Lord and E. Hugues-Salas, Andrew Lord and Georgios Zervas, Antonio Napoli and Piero Castoldi, Antonio Napoli and Antonio D'Errico, Antonio Napoli and Nicola Sambo, Antonio Napoli and Georgios Zervas, Antonio Napoli and Matthias Gunkel, Antonio Napoli and E. Hugues-Salas, Piero Castoldi and Antonio D'Errico, Piero Castoldi and Nicola Sambo, Piero Castoldi and Georgios Zervas, Georgios Zervas and Antonio D'Errico, Georgios Zervas and Matthias Gunkel, Georgios Zervas and Nicola Sambo, Georgios Zervas and E. Hugues-Salas, Matthias Gunkel and Antonio D'Errico, Matthias Gunkel and Nicola Sambo, E. Hugues-Salas and Nicola Sambo, E. Hugues-Salas and Antonio D'Errico, Antonio D'Errico and Nicola Sambo.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Filippo Cugini\", \"id\": 239680}, {\"name\": \"Masahiko Jinno\", \"id\": 538082}, {\"name\": \"Josep M. Fabrega\", \"id\": 239682}, {\"name\": \"Xavier Marcote\", \"id\": 80527}, {\"name\": \"Marc Bohn\", \"id\": 239667}, {\"name\": \"Andrew Lord\", \"id\": 346068}, {\"name\": \"Antonio Napoli\", \"id\": 239668}, {\"name\": \"Piero Castoldi\", \"id\": 119190}, {\"name\": \"Georgios Zervas\", \"id\": 333879}, {\"name\": \"Matthias Gunkel\", \"id\": 239671}, {\"name\": \"E. Hugues-Salas\", \"id\": 253721}, {\"name\": \"Antonio D'Errico\", \"id\": 239669}, {\"name\": \"Camino Balbuena\", \"id\": 62551}, {\"name\": \"Nicola Sambo\", \"id\": 239679}], \"links\": [{\"source\": 239680, \"target\": 119190}, {\"source\": 239680, \"target\": 239679}, {\"source\": 239680, \"target\": 239682}, {\"source\": 239680, \"target\": 333879}, {\"source\": 239680, \"target\": 346068}, {\"source\": 239680, \"target\": 538082}, {\"source\": 538082, \"target\": 119190}, {\"source\": 538082, \"target\": 239667}, {\"source\": 538082, \"target\": 239668}, {\"source\": 538082, \"target\": 239669}, {\"source\": 538082, \"target\": 239671}, {\"source\": 538082, \"target\": 239679}, {\"source\": 538082, \"target\": 239682}, {\"source\": 538082, \"target\": 253721}, {\"source\": 538082, \"target\": 333879}, {\"source\": 538082, \"target\": 346068}, {\"source\": 239682, \"target\": 62551}, {\"source\": 239682, \"target\": 80527}, {\"source\": 239682, \"target\": 119190}, {\"source\": 239682, \"target\": 239667}, {\"source\": 239682, \"target\": 239668}, {\"source\": 239682, \"target\": 239669}, {\"source\": 239682, \"target\": 239671}, {\"source\": 239682, \"target\": 239679}, {\"source\": 239682, \"target\": 333879}, {\"source\": 239682, \"target\": 346068}, {\"source\": 239682, \"target\": 253721}, {\"source\": 80527, \"target\": 62551}, {\"source\": 239667, \"target\": 239668}, {\"source\": 239667, \"target\": 239669}, {\"source\": 239667, \"target\": 239679}, {\"source\": 239667, \"target\": 333879}, {\"source\": 239667, \"target\": 346068}, {\"source\": 346068, \"target\": 119190}, {\"source\": 346068, \"target\": 239668}, {\"source\": 346068, \"target\": 239669}, {\"source\": 346068, \"target\": 239679}, {\"source\": 346068, \"target\": 253721}, {\"source\": 346068, \"target\": 333879}, {\"source\": 239668, \"target\": 119190}, {\"source\": 239668, \"target\": 239669}, {\"source\": 239668, \"target\": 239679}, {\"source\": 239668, \"target\": 333879}, {\"source\": 239668, \"target\": 239671}, {\"source\": 239668, \"target\": 253721}, {\"source\": 119190, \"target\": 239669}, {\"source\": 119190, \"target\": 239679}, {\"source\": 119190, \"target\": 333879}, {\"source\": 333879, \"target\": 239669}, {\"source\": 333879, \"target\": 239671}, {\"source\": 333879, \"target\": 239679}, {\"source\": 333879, \"target\": 253721}, {\"source\": 239671, \"target\": 239669}, {\"source\": 239671, \"target\": 239679}, {\"source\": 253721, \"target\": 239679}, {\"source\": 253721, \"target\": 239669}, {\"source\": 239669, \"target\": 239679}]}",
"id": 520,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Filippo Cugini, Josep M. Fabrega, Masahiko Jinno, Xavier Marcote, Marc Bohn, Andrew Lord, Antonio Napoli, Piero Castoldi, Georgios Zervas, Matthias Gunkel, E. Hugues-Salas, Antonio D'Errico, Camino Balbuena, Nicola Sambo\n- Research collaborations between these authors: Filippo Cugini and Piero Castoldi, Filippo Cugini and Nicola Sambo, Filippo Cugini and Josep M. Fabrega, Filippo Cugini and Georgios Zervas, Filippo Cugini and Andrew Lord, Filippo Cugini and Masahiko Jinno, Josep M. Fabrega and Camino Balbuena, Josep M. Fabrega and Xavier Marcote, Josep M. Fabrega and Piero Castoldi, Josep M. Fabrega and Marc Bohn, Josep M. Fabrega and Antonio Napoli, Josep M. Fabrega and Antonio D'Errico, Josep M. Fabrega and Matthias Gunkel, Josep M. Fabrega and Nicola Sambo, Josep M. Fabrega and Georgios Zervas, Josep M. Fabrega and Andrew Lord, Josep M. Fabrega and Masahiko Jinno, Josep M. Fabrega and E. Hugues-Salas, Masahiko Jinno and Piero Castoldi, Masahiko Jinno and Marc Bohn, Masahiko Jinno and Antonio Napoli, Masahiko Jinno and Antonio D'Errico, Masahiko Jinno and Matthias Gunkel, Masahiko Jinno and Nicola Sambo, Masahiko Jinno and E. Hugues-Salas, Masahiko Jinno and Georgios Zervas, Masahiko Jinno and Andrew Lord, Xavier Marcote and Camino Balbuena, Marc Bohn and Antonio Napoli, Marc Bohn and Antonio D'Errico, Marc Bohn and Nicola Sambo, Marc Bohn and Georgios Zervas, Marc Bohn and Andrew Lord, Andrew Lord and Piero Castoldi, Andrew Lord and Antonio Napoli, Andrew Lord and Antonio D'Errico, Andrew Lord and Nicola Sambo, Andrew Lord and E. Hugues-Salas, Andrew Lord and Georgios Zervas, Antonio Napoli and Piero Castoldi, Antonio Napoli and Antonio D'Errico, Antonio Napoli and Nicola Sambo, Antonio Napoli and Georgios Zervas, Antonio Napoli and Matthias Gunkel, Antonio Napoli and E. Hugues-Salas, Piero Castoldi and Antonio D'Errico, Piero Castoldi and Nicola Sambo, Piero Castoldi and Georgios Zervas, Georgios Zervas and Antonio D'Errico, Georgios Zervas and Matthias Gunkel, Georgios Zervas and Nicola Sambo, Georgios Zervas and E. Hugues-Salas, Matthias Gunkel and Antonio D'Errico, Matthias Gunkel and Nicola Sambo, E. Hugues-Salas and Nicola Sambo, E. Hugues-Salas and Antonio D'Errico, Antonio D'Errico and Nicola Sambo.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Yirong Mo, Hari Balakrishnan, Sason Shaik, Carsten Rother, Ilya Sutskever, Rong Hao, Ivan Laptev, Mei-Hui Wang, Jiafeng Guo, Jin Li, Alexander Nikov, Wei Wu, Cheng Hua Li, Lingchun Song\n- Research collaborations between these authors: Yirong Mo and Wei Wu, Yirong Mo and Lingchun Song, Yirong Mo and Sason Shaik, Hari Balakrishnan and Wei Wu, Hari Balakrishnan and Jin Li, Sason Shaik and Wei Wu, Sason Shaik and Lingchun Song, Carsten Rother and Wei Wu, Carsten Rother and Ilya Sutskever, Carsten Rother and Ivan Laptev, Ilya Sutskever and Wei Wu, Ilya Sutskever and Jin Li, Ilya Sutskever and Ivan Laptev, Ilya Sutskever and Jiafeng Guo, Ilya Sutskever and Cheng Hua Li, Rong Hao and Jin Li, Jiafeng Guo and Wei Wu, Jin Li and Wei Wu, Alexander Nikov and Wei Wu, Wei Wu and Lingchun Song, Wei Wu and Cheng Hua Li.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Yirong Mo\", \"id\": 497576}, {\"name\": \"Hari Balakrishnan\", \"id\": 54761}, {\"name\": \"Sason Shaik\", \"id\": 631437}, {\"name\": \"Ilya Sutskever\", \"id\": 76622}, {\"name\": \"Ivan Laptev\", \"id\": 52622}, {\"name\": \"Rong Hao\", \"id\": 100240}, {\"name\": \"Mei-Hui Wang\", \"id\": 20434}, {\"name\": \"Jiafeng Guo\", \"id\": 85234}, {\"name\": \"Jin Li\", \"id\": 37371}, {\"name\": \"Alexander Nikov\", \"id\": 649849}, {\"name\": \"Lingchun Song\", \"id\": 622877}, {\"name\": \"Carsten Rother\", \"id\": 28859}, {\"name\": \"Cheng Hua Li\", \"id\": 256988}, {\"name\": \"Wei Wu\", \"id\": 2747}], \"links\": [{\"source\": 497576, \"target\": 2747}, {\"source\": 497576, \"target\": 622877}, {\"source\": 497576, \"target\": 631437}, {\"source\": 54761, \"target\": 2747}, {\"source\": 54761, \"target\": 37371}, {\"source\": 631437, \"target\": 2747}, {\"source\": 631437, \"target\": 622877}, {\"source\": 76622, \"target\": 2747}, {\"source\": 76622, \"target\": 28859}, {\"source\": 76622, \"target\": 37371}, {\"source\": 76622, \"target\": 52622}, {\"source\": 76622, \"target\": 85234}, {\"source\": 76622, \"target\": 256988}, {\"source\": 52622, \"target\": 28859}, {\"source\": 100240, \"target\": 37371}, {\"source\": 85234, \"target\": 2747}, {\"source\": 37371, \"target\": 2747}, {\"source\": 649849, \"target\": 2747}, {\"source\": 622877, \"target\": 2747}, {\"source\": 28859, \"target\": 2747}, {\"source\": 256988, \"target\": 2747}]}",
"id": 941,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Yirong Mo, Hari Balakrishnan, Sason Shaik, Carsten Rother, Ilya Sutskever, Rong Hao, Ivan Laptev, Mei-Hui Wang, Jiafeng Guo, Jin Li, Alexander Nikov, Wei Wu, Cheng Hua Li, Lingchun Song\n- Research collaborations between these authors: Yirong Mo and Wei Wu, Yirong Mo and Lingchun Song, Yirong Mo and Sason Shaik, Hari Balakrishnan and Wei Wu, Hari Balakrishnan and Jin Li, Sason Shaik and Wei Wu, Sason Shaik and Lingchun Song, Carsten Rother and Wei Wu, Carsten Rother and Ilya Sutskever, Carsten Rother and Ivan Laptev, Ilya Sutskever and Wei Wu, Ilya Sutskever and Jin Li, Ilya Sutskever and Ivan Laptev, Ilya Sutskever and Jiafeng Guo, Ilya Sutskever and Cheng Hua Li, Rong Hao and Jin Li, Jiafeng Guo and Wei Wu, Jin Li and Wei Wu, Alexander Nikov and Wei Wu, Wei Wu and Lingchun Song, Wei Wu and Cheng Hua Li.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Zhuqing Li, Betty H. C. Cheng, Luciano Baresi, Mike P. Papazoglou, Liangzhao Zeng, Pemadeep Ramsokul, Dacheng Tao, Frank Leymann, Jean-Paul Bodeveix, Dianfu Ma, Dou Sun, Arcot Sowmya, Paolo Traverso, Yongwang Zhao\n- Research collaborations between these authors: Zhuqing Li and Dianfu Ma, Zhuqing Li and Yongwang Zhao, Zhuqing Li and Paolo Traverso, Zhuqing Li and Frank Leymann, Zhuqing Li and Betty H. C. Cheng, Zhuqing Li and Arcot Sowmya, Zhuqing Li and Mike P. Papazoglou, Zhuqing Li and Pemadeep Ramsokul, Zhuqing Li and Dou Sun, Betty H. C. Cheng and Luciano Baresi, Betty H. C. Cheng and Dianfu Ma, Betty H. C. Cheng and Yongwang Zhao, Betty H. C. Cheng and Dou Sun, Luciano Baresi and Paolo Traverso, Luciano Baresi and Frank Leymann, Luciano Baresi and Dianfu Ma, Luciano Baresi and Mike P. Papazoglou, Luciano Baresi and Yongwang Zhao, Mike P. Papazoglou and Frank Leymann, Mike P. Papazoglou and Dianfu Ma, Mike P. Papazoglou and Paolo Traverso, Mike P. Papazoglou and Yongwang Zhao, Liangzhao Zeng and Frank Leymann, Liangzhao Zeng and Dianfu Ma, Liangzhao Zeng and Yongwang Zhao, Pemadeep Ramsokul and Arcot Sowmya, Pemadeep Ramsokul and Dianfu Ma, Dacheng Tao and Dianfu Ma, Dacheng Tao and Yongwang Zhao, Frank Leymann and Paolo Traverso, Frank Leymann and Dianfu Ma, Frank Leymann and Yongwang Zhao, Jean-Paul Bodeveix and Dianfu Ma, Dianfu Ma and Paolo Traverso, Dianfu Ma and Arcot Sowmya, Dianfu Ma and Yongwang Zhao, Dianfu Ma and Dou Sun, Dou Sun and Yongwang Zhao, Paolo Traverso and Yongwang Zhao.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Zhuqing Li\", \"id\": 138976}, {\"name\": \"Betty H. C. Cheng\", \"id\": 14821}, {\"name\": \"Luciano Baresi\", \"id\": 42312}, {\"name\": \"Mike P. Papazoglou\", \"id\": 44010}, {\"name\": \"Liangzhao Zeng\", \"id\": 186988}, {\"name\": \"Pemadeep Ramsokul\", \"id\": 777006}, {\"name\": \"Jean-Paul Bodeveix\", \"id\": 26361}, {\"name\": \"Frank Leymann\", \"id\": 8279}, {\"name\": \"Dacheng Tao\", \"id\": 14041}, {\"name\": \"Dianfu Ma\", \"id\": 27738}, {\"name\": \"Dou Sun\", \"id\": 1032859}, {\"name\": \"Arcot Sowmya\", \"id\": 27612}, {\"name\": \"Paolo Traverso\", \"id\": 7899}, {\"name\": \"Yongwang Zhao\", \"id\": 138975}], \"links\": [{\"source\": 138976, \"target\": 27738}, {\"source\": 138976, \"target\": 138975}, {\"source\": 138976, \"target\": 7899}, {\"source\": 138976, \"target\": 8279}, {\"source\": 138976, \"target\": 14821}, {\"source\": 138976, \"target\": 27612}, {\"source\": 138976, \"target\": 44010}, {\"source\": 138976, \"target\": 777006}, {\"source\": 138976, \"target\": 1032859}, {\"source\": 14821, \"target\": 42312}, {\"source\": 14821, \"target\": 27738}, {\"source\": 14821, \"target\": 138975}, {\"source\": 14821, \"target\": 1032859}, {\"source\": 42312, \"target\": 7899}, {\"source\": 42312, \"target\": 8279}, {\"source\": 42312, \"target\": 27738}, {\"source\": 42312, \"target\": 44010}, {\"source\": 42312, \"target\": 138975}, {\"source\": 44010, \"target\": 8279}, {\"source\": 44010, \"target\": 27738}, {\"source\": 44010, \"target\": 7899}, {\"source\": 44010, \"target\": 138975}, {\"source\": 186988, \"target\": 8279}, {\"source\": 186988, \"target\": 27738}, {\"source\": 186988, \"target\": 138975}, {\"source\": 777006, \"target\": 27612}, {\"source\": 777006, \"target\": 27738}, {\"source\": 26361, \"target\": 27738}, {\"source\": 8279, \"target\": 7899}, {\"source\": 8279, \"target\": 27738}, {\"source\": 8279, \"target\": 138975}, {\"source\": 14041, \"target\": 27738}, {\"source\": 14041, \"target\": 138975}, {\"source\": 27738, \"target\": 7899}, {\"source\": 27738, \"target\": 27612}, {\"source\": 27738, \"target\": 138975}, {\"source\": 27738, \"target\": 1032859}, {\"source\": 1032859, \"target\": 138975}, {\"source\": 7899, \"target\": 138975}]}",
"id": 2380,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Zhuqing Li, Betty H. C. Cheng, Luciano Baresi, Mike P. Papazoglou, Liangzhao Zeng, Pemadeep Ramsokul, Dacheng Tao, Frank Leymann, Jean-Paul Bodeveix, Dianfu Ma, Dou Sun, Arcot Sowmya, Paolo Traverso, Yongwang Zhao\n- Research collaborations between these authors: Zhuqing Li and Dianfu Ma, Zhuqing Li and Yongwang Zhao, Zhuqing Li and Paolo Traverso, Zhuqing Li and Frank Leymann, Zhuqing Li and Betty H. C. Cheng, Zhuqing Li and Arcot Sowmya, Zhuqing Li and Mike P. Papazoglou, Zhuqing Li and Pemadeep Ramsokul, Zhuqing Li and Dou Sun, Betty H. C. Cheng and Luciano Baresi, Betty H. C. Cheng and Dianfu Ma, Betty H. C. Cheng and Yongwang Zhao, Betty H. C. Cheng and Dou Sun, Luciano Baresi and Paolo Traverso, Luciano Baresi and Frank Leymann, Luciano Baresi and Dianfu Ma, Luciano Baresi and Mike P. Papazoglou, Luciano Baresi and Yongwang Zhao, Mike P. Papazoglou and Frank Leymann, Mike P. Papazoglou and Dianfu Ma, Mike P. Papazoglou and Paolo Traverso, Mike P. Papazoglou and Yongwang Zhao, Liangzhao Zeng and Frank Leymann, Liangzhao Zeng and Dianfu Ma, Liangzhao Zeng and Yongwang Zhao, Pemadeep Ramsokul and Arcot Sowmya, Pemadeep Ramsokul and Dianfu Ma, Dacheng Tao and Dianfu Ma, Dacheng Tao and Yongwang Zhao, Frank Leymann and Paolo Traverso, Frank Leymann and Dianfu Ma, Frank Leymann and Yongwang Zhao, Jean-Paul Bodeveix and Dianfu Ma, Dianfu Ma and Paolo Traverso, Dianfu Ma and Arcot Sowmya, Dianfu Ma and Yongwang Zhao, Dianfu Ma and Dou Sun, Dou Sun and Yongwang Zhao, Paolo Traverso and Yongwang Zhao.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Satoko Abiko, James J. Kuffner, Takaaki Matsumoto, Paul Y. Oh, William E. Green, Kenta Go, Hh Bülthoff, Kensuke Harada, Shaojie Shen, Yuta Hoshino, Atsushi Oosedo, Atsushi Konno, Masaru Uchiyama, Jörn Malzahn\n- Research collaborations between these authors: Satoko Abiko and Hh Bülthoff, Satoko Abiko and Atsushi Konno, Satoko Abiko and Masaru Uchiyama, Satoko Abiko and Atsushi Oosedo, Satoko Abiko and Takaaki Matsumoto, Satoko Abiko and Kenta Go, James J. Kuffner and Paul Y. Oh, James J. Kuffner and Kensuke Harada, James J. Kuffner and Atsushi Konno, James J. Kuffner and Masaru Uchiyama, Takaaki Matsumoto and Atsushi Konno, Takaaki Matsumoto and Masaru Uchiyama, Takaaki Matsumoto and Atsushi Oosedo, Takaaki Matsumoto and Paul Y. Oh, Takaaki Matsumoto and William E. Green, Paul Y. Oh and William E. Green, Paul Y. Oh and Kensuke Harada, Paul Y. Oh and Atsushi Konno, Paul Y. Oh and Masaru Uchiyama, Paul Y. Oh and Atsushi Oosedo, Paul Y. Oh and Kenta Go, William E. Green and Atsushi Konno, William E. Green and Masaru Uchiyama, William E. Green and Atsushi Oosedo, William E. Green and Kenta Go, Kenta Go and Atsushi Konno, Kenta Go and Masaru Uchiyama, Kenta Go and Atsushi Oosedo, Hh Bülthoff and Atsushi Konno, Hh Bülthoff and Masaru Uchiyama, Hh Bülthoff and Atsushi Oosedo, Kensuke Harada and Atsushi Konno, Kensuke Harada and Masaru Uchiyama, Shaojie Shen and Atsushi Konno, Shaojie Shen and Masaru Uchiyama, Shaojie Shen and Atsushi Oosedo, Yuta Hoshino and Atsushi Konno, Yuta Hoshino and Masaru Uchiyama, Yuta Hoshino and Atsushi Oosedo, Atsushi Oosedo and Atsushi Konno, Atsushi Oosedo and Masaru Uchiyama, Atsushi Konno and Masaru Uchiyama, Atsushi Konno and Jörn Malzahn, Masaru Uchiyama and Jörn Malzahn.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"James J. Kuffner\", \"id\": 240419}, {\"name\": \"Takaaki Matsumoto\", \"id\": 480474}, {\"name\": \"Paul Y. Oh\", \"id\": 93676}, {\"name\": \"William E. Green\", \"id\": 118253}, {\"name\": \"Kenta Go\", \"id\": 480475}, {\"name\": \"Hh B\\u00fclthoff\", \"id\": 45263}, {\"name\": \"Kensuke Harada\", \"id\": 159504}, {\"name\": \"Atsushi Konno\", \"id\": 303387}, {\"name\": \"Shaojie Shen\", \"id\": 17365}, {\"name\": \"Yuta Hoshino\", \"id\": 282550}, {\"name\": \"Atsushi Oosedo\", \"id\": 344954}, {\"name\": \"Satoko Abiko\", \"id\": 344955}, {\"name\": \"Masaru Uchiyama\", \"id\": 303388}, {\"name\": \"J\\u00f6rn Malzahn\", \"id\": 520542}], \"links\": [{\"source\": 240419, \"target\": 93676}, {\"source\": 240419, \"target\": 159504}, {\"source\": 240419, \"target\": 303387}, {\"source\": 240419, \"target\": 303388}, {\"source\": 480474, \"target\": 303387}, {\"source\": 480474, \"target\": 303388}, {\"source\": 480474, \"target\": 344954}, {\"source\": 480474, \"target\": 344955}, {\"source\": 480474, \"target\": 93676}, {\"source\": 480474, \"target\": 118253}, {\"source\": 93676, \"target\": 118253}, {\"source\": 93676, \"target\": 159504}, {\"source\": 93676, \"target\": 303387}, {\"source\": 93676, \"target\": 303388}, {\"source\": 93676, \"target\": 344954}, {\"source\": 93676, \"target\": 480475}, {\"source\": 118253, \"target\": 303387}, {\"source\": 118253, \"target\": 303388}, {\"source\": 118253, \"target\": 344954}, {\"source\": 118253, \"target\": 480475}, {\"source\": 480475, \"target\": 303387}, {\"source\": 480475, \"target\": 303388}, {\"source\": 480475, \"target\": 344954}, {\"source\": 480475, \"target\": 344955}, {\"source\": 45263, \"target\": 303387}, {\"source\": 45263, \"target\": 303388}, {\"source\": 45263, \"target\": 344954}, {\"source\": 45263, \"target\": 344955}, {\"source\": 159504, \"target\": 303387}, {\"source\": 159504, \"target\": 303388}, {\"source\": 303387, \"target\": 17365}, {\"source\": 303387, \"target\": 282550}, {\"source\": 303387, \"target\": 303388}, {\"source\": 303387, \"target\": 344954}, {\"source\": 303387, \"target\": 344955}, {\"source\": 303387, \"target\": 520542}, {\"source\": 17365, \"target\": 303388}, {\"source\": 17365, \"target\": 344954}, {\"source\": 282550, \"target\": 303388}, {\"source\": 282550, \"target\": 344954}, {\"source\": 344954, \"target\": 303388}, {\"source\": 344954, \"target\": 344955}, {\"source\": 344955, \"target\": 303388}, {\"source\": 303388, \"target\": 520542}]}",
"id": 2095,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Satoko Abiko, James J. Kuffner, Takaaki Matsumoto, Paul Y. Oh, William E. Green, Kenta Go, Hh Bülthoff, Kensuke Harada, Shaojie Shen, Yuta Hoshino, Atsushi Oosedo, Atsushi Konno, Masaru Uchiyama, Jörn Malzahn\n- Research collaborations between these authors: Satoko Abiko and Hh Bülthoff, Satoko Abiko and Atsushi Konno, Satoko Abiko and Masaru Uchiyama, Satoko Abiko and Atsushi Oosedo, Satoko Abiko and Takaaki Matsumoto, Satoko Abiko and Kenta Go, James J. Kuffner and Paul Y. Oh, James J. Kuffner and Kensuke Harada, James J. Kuffner and Atsushi Konno, James J. Kuffner and Masaru Uchiyama, Takaaki Matsumoto and Atsushi Konno, Takaaki Matsumoto and Masaru Uchiyama, Takaaki Matsumoto and Atsushi Oosedo, Takaaki Matsumoto and Paul Y. Oh, Takaaki Matsumoto and William E. Green, Paul Y. Oh and William E. Green, Paul Y. Oh and Kensuke Harada, Paul Y. Oh and Atsushi Konno, Paul Y. Oh and Masaru Uchiyama, Paul Y. Oh and Atsushi Oosedo, Paul Y. Oh and Kenta Go, William E. Green and Atsushi Konno, William E. Green and Masaru Uchiyama, William E. Green and Atsushi Oosedo, William E. Green and Kenta Go, Kenta Go and Atsushi Konno, Kenta Go and Masaru Uchiyama, Kenta Go and Atsushi Oosedo, Hh Bülthoff and Atsushi Konno, Hh Bülthoff and Masaru Uchiyama, Hh Bülthoff and Atsushi Oosedo, Kensuke Harada and Atsushi Konno, Kensuke Harada and Masaru Uchiyama, Shaojie Shen and Atsushi Konno, Shaojie Shen and Masaru Uchiyama, Shaojie Shen and Atsushi Oosedo, Yuta Hoshino and Atsushi Konno, Yuta Hoshino and Masaru Uchiyama, Yuta Hoshino and Atsushi Oosedo, Atsushi Oosedo and Atsushi Konno, Atsushi Oosedo and Masaru Uchiyama, Atsushi Konno and Masaru Uchiyama, Atsushi Konno and Jörn Malzahn, Masaru Uchiyama and Jörn Malzahn.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Albert G. Greenberg, Biswanath Mukherjee, Piotr Cholda, Otto J. Wittner, Jean-Claude Laprie, Poul E. Heegaard, Peter Herrmann, Kishor S. Trivedi, Peter Druschel, Pirkko Kuusela, Eirik Larsen Følstad, Bjarne E. Helvik, Algirdas Avizienis, James P. G. Sterbenz\n- Research collaborations between these authors: Albert G. Greenberg and Bjarne E. Helvik, Albert G. Greenberg and Otto J. Wittner, Biswanath Mukherjee and Bjarne E. Helvik, Biswanath Mukherjee and Piotr Cholda, Piotr Cholda and Kishor S. Trivedi, Piotr Cholda and Bjarne E. Helvik, Piotr Cholda and Poul E. Heegaard, Piotr Cholda and Peter Druschel, Piotr Cholda and Otto J. Wittner, Piotr Cholda and Pirkko Kuusela, Piotr Cholda and Eirik Larsen Følstad, Otto J. Wittner and Kishor S. Trivedi, Otto J. Wittner and Peter Herrmann, Otto J. Wittner and Bjarne E. Helvik, Otto J. Wittner and Poul E. Heegaard, Jean-Claude Laprie and Kishor S. Trivedi, Jean-Claude Laprie and James P. G. Sterbenz, Jean-Claude Laprie and Bjarne E. Helvik, Jean-Claude Laprie and Poul E. Heegaard, Poul E. Heegaard and Kishor S. Trivedi, Poul E. Heegaard and Peter Herrmann, Poul E. Heegaard and James P. G. Sterbenz, Poul E. Heegaard and Bjarne E. Helvik, Poul E. Heegaard and Algirdas Avizienis, Poul E. Heegaard and Pirkko Kuusela, Poul E. Heegaard and Eirik Larsen Følstad, Peter Herrmann and Bjarne E. Helvik, Kishor S. Trivedi and James P. G. Sterbenz, Kishor S. Trivedi and Bjarne E. Helvik, Kishor S. Trivedi and Algirdas Avizienis, Pirkko Kuusela and Bjarne E. Helvik, Eirik Larsen Følstad and Bjarne E. Helvik, Bjarne E. Helvik and Algirdas Avizienis, Algirdas Avizienis and James P. G. Sterbenz.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Albert G. Greenberg\", \"id\": 75552}, {\"name\": \"Biswanath Mukherjee\", \"id\": 130466}, {\"name\": \"Piotr Cholda\", \"id\": 204931}, {\"name\": \"Otto J. Wittner\", \"id\": 162277}, {\"name\": \"Jean-Claude Laprie\", \"id\": 252648}, {\"name\": \"Poul E. Heegaard\", \"id\": 104426}, {\"name\": \"Peter Herrmann\", \"id\": 70571}, {\"name\": \"Kishor S. Trivedi\", \"id\": 63087}, {\"name\": \"Peter Druschel\", \"id\": 44951}, {\"name\": \"Pirkko Kuusela\", \"id\": 298227}, {\"name\": \"Eirik Larsen F\\u00f8lstad\", \"id\": 378196}, {\"name\": \"Bjarne E. Helvik\", \"id\": 102775}, {\"name\": \"Algirdas Avizienis\", \"id\": 177181}, {\"name\": \"James P. G. Sterbenz\", \"id\": 93919}], \"links\": [{\"source\": 75552, \"target\": 102775}, {\"source\": 75552, \"target\": 162277}, {\"source\": 130466, \"target\": 102775}, {\"source\": 130466, \"target\": 204931}, {\"source\": 204931, \"target\": 63087}, {\"source\": 204931, \"target\": 102775}, {\"source\": 204931, \"target\": 104426}, {\"source\": 204931, \"target\": 44951}, {\"source\": 204931, \"target\": 162277}, {\"source\": 204931, \"target\": 298227}, {\"source\": 204931, \"target\": 378196}, {\"source\": 162277, \"target\": 63087}, {\"source\": 162277, \"target\": 70571}, {\"source\": 162277, \"target\": 102775}, {\"source\": 162277, \"target\": 104426}, {\"source\": 252648, \"target\": 63087}, {\"source\": 252648, \"target\": 93919}, {\"source\": 252648, \"target\": 102775}, {\"source\": 252648, \"target\": 104426}, {\"source\": 104426, \"target\": 63087}, {\"source\": 104426, \"target\": 70571}, {\"source\": 104426, \"target\": 93919}, {\"source\": 104426, \"target\": 102775}, {\"source\": 104426, \"target\": 177181}, {\"source\": 104426, \"target\": 298227}, {\"source\": 104426, \"target\": 378196}, {\"source\": 70571, \"target\": 102775}, {\"source\": 63087, \"target\": 93919}, {\"source\": 63087, \"target\": 102775}, {\"source\": 63087, \"target\": 177181}, {\"source\": 298227, \"target\": 102775}, {\"source\": 378196, \"target\": 102775}, {\"source\": 102775, \"target\": 177181}, {\"source\": 177181, \"target\": 93919}]}",
"id": 19,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Albert G. Greenberg, Biswanath Mukherjee, Piotr Cholda, Otto J. Wittner, Jean-Claude Laprie, Poul E. Heegaard, Peter Herrmann, Kishor S. Trivedi, Peter Druschel, Pirkko Kuusela, Eirik Larsen Følstad, Bjarne E. Helvik, Algirdas Avizienis, James P. G. Sterbenz\n- Research collaborations between these authors: Albert G. Greenberg and Bjarne E. Helvik, Albert G. Greenberg and Otto J. Wittner, Biswanath Mukherjee and Bjarne E. Helvik, Biswanath Mukherjee and Piotr Cholda, Piotr Cholda and Kishor S. Trivedi, Piotr Cholda and Bjarne E. Helvik, Piotr Cholda and Poul E. Heegaard, Piotr Cholda and Peter Druschel, Piotr Cholda and Otto J. Wittner, Piotr Cholda and Pirkko Kuusela, Piotr Cholda and Eirik Larsen Følstad, Otto J. Wittner and Kishor S. Trivedi, Otto J. Wittner and Peter Herrmann, Otto J. Wittner and Bjarne E. Helvik, Otto J. Wittner and Poul E. Heegaard, Jean-Claude Laprie and Kishor S. Trivedi, Jean-Claude Laprie and James P. G. Sterbenz, Jean-Claude Laprie and Bjarne E. Helvik, Jean-Claude Laprie and Poul E. Heegaard, Poul E. Heegaard and Kishor S. Trivedi, Poul E. Heegaard and Peter Herrmann, Poul E. Heegaard and James P. G. Sterbenz, Poul E. Heegaard and Bjarne E. Helvik, Poul E. Heegaard and Algirdas Avizienis, Poul E. Heegaard and Pirkko Kuusela, Poul E. Heegaard and Eirik Larsen Følstad, Peter Herrmann and Bjarne E. Helvik, Kishor S. Trivedi and James P. G. Sterbenz, Kishor S. Trivedi and Bjarne E. Helvik, Kishor S. Trivedi and Algirdas Avizienis, Pirkko Kuusela and Bjarne E. Helvik, Eirik Larsen Følstad and Bjarne E. Helvik, Bjarne E. Helvik and Algirdas Avizienis, Algirdas Avizienis and James P. G. Sterbenz.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Pedro F. Felzenszwalb, Remco C. Veltkamp, Deva Ramanan, Jitendra Malik, Michael J. Black, Ross B. Girshick, Thomas Pock, Andrew Zisserman, Ivan Laptev, Zhigang Tu, Coert van Gemeren, D. L. Sun, Stefan Roth, Thomas Brox\n- Research collaborations between these authors: Pedro F. Felzenszwalb and Thomas Brox, Pedro F. Felzenszwalb and Jitendra Malik, Pedro F. Felzenszwalb and Remco C. Veltkamp, Pedro F. Felzenszwalb and Michael J. Black, Pedro F. Felzenszwalb and Ivan Laptev, Pedro F. Felzenszwalb and Deva Ramanan, Pedro F. Felzenszwalb and Stefan Roth, Pedro F. Felzenszwalb and Andrew Zisserman, Pedro F. Felzenszwalb and Ross B. Girshick, Pedro F. Felzenszwalb and Coert van Gemeren, Remco C. Veltkamp and Thomas Brox, Remco C. Veltkamp and Jitendra Malik, Remco C. Veltkamp and Michael J. Black, Remco C. Veltkamp and Thomas Pock, Remco C. Veltkamp and Ivan Laptev, Remco C. Veltkamp and Deva Ramanan, Remco C. Veltkamp and Stefan Roth, Remco C. Veltkamp and Andrew Zisserman, Remco C. Veltkamp and Ross B. Girshick, Remco C. Veltkamp and D. L. Sun, Remco C. Veltkamp and Zhigang Tu, Remco C. Veltkamp and Coert van Gemeren, Deva Ramanan and Thomas Brox, Deva Ramanan and Jitendra Malik, Deva Ramanan and Michael J. Black, Deva Ramanan and Ivan Laptev, Deva Ramanan and Stefan Roth, Deva Ramanan and Andrew Zisserman, Deva Ramanan and Ross B. Girshick, Deva Ramanan and Coert van Gemeren, Jitendra Malik and Thomas Brox, Jitendra Malik and Michael J. Black, Jitendra Malik and Thomas Pock, Jitendra Malik and Ivan Laptev, Jitendra Malik and Stefan Roth, Jitendra Malik and Andrew Zisserman, Jitendra Malik and Ross B. Girshick, Jitendra Malik and D. L. Sun, Jitendra Malik and Zhigang Tu, Jitendra Malik and Coert van Gemeren, Michael J. Black and Thomas Brox, Michael J. Black and Thomas Pock, Michael J. Black and Stefan Roth, Michael J. Black and Andrew Zisserman, Michael J. Black and Ross B. Girshick, Michael J. Black and D. L. Sun, Michael J. Black and Ivan Laptev, Michael J. Black and Zhigang Tu, Michael J. Black and Coert van Gemeren, Ross B. Girshick and Thomas Brox, Ross B. Girshick and Ivan Laptev, Ross B. Girshick and Stefan Roth, Ross B. Girshick and Andrew Zisserman, Ross B. Girshick and Coert van Gemeren, Thomas Pock and Thomas Brox, Thomas Pock and Stefan Roth, Thomas Pock and Andrew Zisserman, Thomas Pock and D. L. Sun, Thomas Pock and Zhigang Tu, Thomas Pock and Coert van Gemeren, Andrew Zisserman and Thomas Brox, Andrew Zisserman and Ivan Laptev, Andrew Zisserman and Stefan Roth, Andrew Zisserman and D. L. Sun, Andrew Zisserman and Coert van Gemeren, Ivan Laptev and Thomas Brox, Ivan Laptev and Stefan Roth, Ivan Laptev and Coert van Gemeren, Zhigang Tu and Thomas Brox, Zhigang Tu and Stefan Roth, Zhigang Tu and D. L. Sun, Zhigang Tu and Coert van Gemeren, Coert van Gemeren and Thomas Brox, Coert van Gemeren and Stefan Roth, Coert van Gemeren and D. L. Sun, D. L. Sun and Stefan Roth, D. L. Sun and Thomas Brox, Stefan Roth and Thomas Brox.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 11,
"style": "rule"
}
|
{
"exact_answer": 11,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Pedro F. Felzenszwalb\", \"id\": 163808}, {\"name\": \"Remco C. Veltkamp\", \"id\": 42880}, {\"name\": \"Deva Ramanan\", \"id\": 56546}, {\"name\": \"Jitendra Malik\", \"id\": 32931}, {\"name\": \"Ross B. Girshick\", \"id\": 63749}, {\"name\": \"Thomas Pock\", \"id\": 49349}, {\"name\": \"Andrew Zisserman\", \"id\": 62508}, {\"name\": \"Coert van Gemeren\", \"id\": 258553}, {\"name\": \"Ivan Laptev\", \"id\": 52622}, {\"name\": \"Stefan Roth\", \"id\": 59579}, {\"name\": \"Zhigang Tu\", \"id\": 258552}, {\"name\": \"Michael J. Black\", \"id\": 46233}, {\"name\": \"D. L. Sun\", \"id\": 165467}, {\"name\": \"Thomas Brox\", \"id\": 12797}], \"links\": [{\"source\": 163808, \"target\": 12797}, {\"source\": 163808, \"target\": 32931}, {\"source\": 163808, \"target\": 42880}, {\"source\": 163808, \"target\": 46233}, {\"source\": 163808, \"target\": 52622}, {\"source\": 163808, \"target\": 56546}, {\"source\": 163808, \"target\": 59579}, {\"source\": 163808, \"target\": 62508}, {\"source\": 163808, \"target\": 63749}, {\"source\": 163808, \"target\": 258553}, {\"source\": 42880, \"target\": 12797}, {\"source\": 42880, \"target\": 32931}, {\"source\": 42880, \"target\": 46233}, {\"source\": 42880, \"target\": 49349}, {\"source\": 42880, \"target\": 52622}, {\"source\": 42880, \"target\": 56546}, {\"source\": 42880, \"target\": 59579}, {\"source\": 42880, \"target\": 62508}, {\"source\": 42880, \"target\": 63749}, {\"source\": 42880, \"target\": 165467}, {\"source\": 42880, \"target\": 258552}, {\"source\": 42880, \"target\": 258553}, {\"source\": 56546, \"target\": 12797}, {\"source\": 56546, \"target\": 32931}, {\"source\": 56546, \"target\": 46233}, {\"source\": 56546, \"target\": 52622}, {\"source\": 56546, \"target\": 59579}, {\"source\": 56546, \"target\": 62508}, {\"source\": 56546, \"target\": 63749}, {\"source\": 56546, \"target\": 258553}, {\"source\": 32931, \"target\": 12797}, {\"source\": 32931, \"target\": 46233}, {\"source\": 32931, \"target\": 49349}, {\"source\": 32931, \"target\": 52622}, {\"source\": 32931, \"target\": 59579}, {\"source\": 32931, \"target\": 62508}, {\"source\": 32931, \"target\": 63749}, {\"source\": 32931, \"target\": 165467}, {\"source\": 32931, \"target\": 258552}, {\"source\": 32931, \"target\": 258553}, {\"source\": 63749, \"target\": 12797}, {\"source\": 63749, \"target\": 46233}, {\"source\": 63749, \"target\": 52622}, {\"source\": 63749, \"target\": 59579}, {\"source\": 63749, \"target\": 62508}, {\"source\": 63749, \"target\": 258553}, {\"source\": 49349, \"target\": 12797}, {\"source\": 49349, \"target\": 46233}, {\"source\": 49349, \"target\": 59579}, {\"source\": 49349, \"target\": 62508}, {\"source\": 49349, \"target\": 165467}, {\"source\": 49349, \"target\": 258552}, {\"source\": 49349, \"target\": 258553}, {\"source\": 62508, \"target\": 12797}, {\"source\": 62508, \"target\": 46233}, {\"source\": 62508, \"target\": 52622}, {\"source\": 62508, \"target\": 59579}, {\"source\": 62508, \"target\": 165467}, {\"source\": 62508, \"target\": 258553}, {\"source\": 258553, \"target\": 258552}, {\"source\": 258553, \"target\": 12797}, {\"source\": 258553, \"target\": 46233}, {\"source\": 258553, \"target\": 52622}, {\"source\": 258553, \"target\": 59579}, {\"source\": 258553, \"target\": 165467}, {\"source\": 52622, \"target\": 12797}, {\"source\": 52622, \"target\": 46233}, {\"source\": 52622, \"target\": 59579}, {\"source\": 59579, \"target\": 12797}, {\"source\": 59579, \"target\": 46233}, {\"source\": 59579, \"target\": 165467}, {\"source\": 59579, \"target\": 258552}, {\"source\": 258552, \"target\": 12797}, {\"source\": 258552, \"target\": 46233}, {\"source\": 258552, \"target\": 165467}, {\"source\": 46233, \"target\": 12797}, {\"source\": 46233, \"target\": 165467}, {\"source\": 165467, \"target\": 12797}]}",
"id": 1840,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Pedro F. Felzenszwalb, Remco C. Veltkamp, Deva Ramanan, Jitendra Malik, Michael J. Black, Ross B. Girshick, Thomas Pock, Andrew Zisserman, Ivan Laptev, Zhigang Tu, Coert van Gemeren, D. L. Sun, Stefan Roth, Thomas Brox\n- Research collaborations between these authors: Pedro F. Felzenszwalb and Thomas Brox, Pedro F. Felzenszwalb and Jitendra Malik, Pedro F. Felzenszwalb and Remco C. Veltkamp, Pedro F. Felzenszwalb and Michael J. Black, Pedro F. Felzenszwalb and Ivan Laptev, Pedro F. Felzenszwalb and Deva Ramanan, Pedro F. Felzenszwalb and Stefan Roth, Pedro F. Felzenszwalb and Andrew Zisserman, Pedro F. Felzenszwalb and Ross B. Girshick, Pedro F. Felzenszwalb and Coert van Gemeren, Remco C. Veltkamp and Thomas Brox, Remco C. Veltkamp and Jitendra Malik, Remco C. Veltkamp and Michael J. Black, Remco C. Veltkamp and Thomas Pock, Remco C. Veltkamp and Ivan Laptev, Remco C. Veltkamp and Deva Ramanan, Remco C. Veltkamp and Stefan Roth, Remco C. Veltkamp and Andrew Zisserman, Remco C. Veltkamp and Ross B. Girshick, Remco C. Veltkamp and D. L. Sun, Remco C. Veltkamp and Zhigang Tu, Remco C. Veltkamp and Coert van Gemeren, Deva Ramanan and Thomas Brox, Deva Ramanan and Jitendra Malik, Deva Ramanan and Michael J. Black, Deva Ramanan and Ivan Laptev, Deva Ramanan and Stefan Roth, Deva Ramanan and Andrew Zisserman, Deva Ramanan and Ross B. Girshick, Deva Ramanan and Coert van Gemeren, Jitendra Malik and Thomas Brox, Jitendra Malik and Michael J. Black, Jitendra Malik and Thomas Pock, Jitendra Malik and Ivan Laptev, Jitendra Malik and Stefan Roth, Jitendra Malik and Andrew Zisserman, Jitendra Malik and Ross B. Girshick, Jitendra Malik and D. L. Sun, Jitendra Malik and Zhigang Tu, Jitendra Malik and Coert van Gemeren, Michael J. Black and Thomas Brox, Michael J. Black and Thomas Pock, Michael J. Black and Stefan Roth, Michael J. Black and Andrew Zisserman, Michael J. Black and Ross B. Girshick, Michael J. Black and D. L. Sun, Michael J. Black and Ivan Laptev, Michael J. Black and Zhigang Tu, Michael J. Black and Coert van Gemeren, Ross B. Girshick and Thomas Brox, Ross B. Girshick and Ivan Laptev, Ross B. Girshick and Stefan Roth, Ross B. Girshick and Andrew Zisserman, Ross B. Girshick and Coert van Gemeren, Thomas Pock and Thomas Brox, Thomas Pock and Stefan Roth, Thomas Pock and Andrew Zisserman, Thomas Pock and D. L. Sun, Thomas Pock and Zhigang Tu, Thomas Pock and Coert van Gemeren, Andrew Zisserman and Thomas Brox, Andrew Zisserman and Ivan Laptev, Andrew Zisserman and Stefan Roth, Andrew Zisserman and D. L. Sun, Andrew Zisserman and Coert van Gemeren, Ivan Laptev and Thomas Brox, Ivan Laptev and Stefan Roth, Ivan Laptev and Coert van Gemeren, Zhigang Tu and Thomas Brox, Zhigang Tu and Stefan Roth, Zhigang Tu and D. L. Sun, Zhigang Tu and Coert van Gemeren, Coert van Gemeren and Thomas Brox, Coert van Gemeren and Stefan Roth, Coert van Gemeren and D. L. Sun, D. L. Sun and Stefan Roth, D. L. Sun and Thomas Brox, Stefan Roth and Thomas Brox.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wangmeng Zuo, Rafael Molina, Frédo Durand, Terence Tao, Shinichi Nakajima, S. Derin Babacan, Andrew Zisserman, Peyman Milanfar, David P. Wipf, Zhihui Wei, Guillaume Bouchard, Zhaofu Chen, Minh N. Do, Michael Elad\n- Research collaborations between these authors: Wangmeng Zuo and Andrew Zisserman, Wangmeng Zuo and S. Derin Babacan, Wangmeng Zuo and Rafael Molina, Wangmeng Zuo and Peyman Milanfar, Wangmeng Zuo and Michael Elad, Wangmeng Zuo and Frédo Durand, Rafael Molina and Shinichi Nakajima, Rafael Molina and S. Derin Babacan, Rafael Molina and Zhihui Wei, Rafael Molina and David P. Wipf, Rafael Molina and Andrew Zisserman, Rafael Molina and Peyman Milanfar, Rafael Molina and Minh N. Do, Rafael Molina and Michael Elad, Rafael Molina and Terence Tao, Rafael Molina and Frédo Durand, Rafael Molina and Zhaofu Chen, Frédo Durand and Andrew Zisserman, Frédo Durand and S. Derin Babacan, Frédo Durand and Zhihui Wei, Frédo Durand and David P. Wipf, Frédo Durand and Peyman Milanfar, Frédo Durand and Minh N. Do, Frédo Durand and Michael Elad, Terence Tao and S. Derin Babacan, Terence Tao and Zhihui Wei, Terence Tao and David P. Wipf, Terence Tao and Minh N. Do, Terence Tao and Michael Elad, Shinichi Nakajima and Guillaume Bouchard, Shinichi Nakajima and Andrew Zisserman, Shinichi Nakajima and S. Derin Babacan, S. Derin Babacan and Guillaume Bouchard, S. Derin Babacan and Andrew Zisserman, S. Derin Babacan and David P. Wipf, S. Derin Babacan and Peyman Milanfar, S. Derin Babacan and Minh N. Do, S. Derin Babacan and Michael Elad, S. Derin Babacan and Zhihui Wei, S. Derin Babacan and Zhaofu Chen, Andrew Zisserman and Peyman Milanfar, Andrew Zisserman and Michael Elad, Andrew Zisserman and Zhihui Wei, Andrew Zisserman and David P. Wipf, Andrew Zisserman and Minh N. Do, Peyman Milanfar and Zhihui Wei, Peyman Milanfar and David P. Wipf, Peyman Milanfar and Michael Elad, Peyman Milanfar and Minh N. Do, David P. Wipf and Zhihui Wei, David P. Wipf and Minh N. Do, David P. Wipf and Michael Elad, Zhihui Wei and Minh N. Do, Zhihui Wei and Michael Elad, Minh N. Do and Michael Elad.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Fr\\u00e9do Durand\", \"id\": 244674}, {\"name\": \"Rafael Molina\", \"id\": 91139}, {\"name\": \"Wangmeng Zuo\", \"id\": 2402}, {\"name\": \"Terence Tao\", \"id\": 227366}, {\"name\": \"Shinichi Nakajima\", \"id\": 22377}, {\"name\": \"S. Derin Babacan\", \"id\": 69963}, {\"name\": \"Andrew Zisserman\", \"id\": 62508}, {\"name\": \"Peyman Milanfar\", \"id\": 138669}, {\"name\": \"David P. Wipf\", \"id\": 82126}, {\"name\": \"Zhihui Wei\", \"id\": 78604}, {\"name\": \"Guillaume Bouchard\", \"id\": 58128}, {\"name\": \"Zhaofu Chen\", \"id\": 364978}, {\"name\": \"Minh N. Do\", \"id\": 143635}, {\"name\": \"Michael Elad\", \"id\": 144447}], \"links\": [{\"source\": 244674, \"target\": 2402}, {\"source\": 244674, \"target\": 62508}, {\"source\": 244674, \"target\": 69963}, {\"source\": 244674, \"target\": 78604}, {\"source\": 244674, \"target\": 82126}, {\"source\": 244674, \"target\": 91139}, {\"source\": 244674, \"target\": 138669}, {\"source\": 244674, \"target\": 143635}, {\"source\": 244674, \"target\": 144447}, {\"source\": 91139, \"target\": 2402}, {\"source\": 91139, \"target\": 22377}, {\"source\": 91139, \"target\": 69963}, {\"source\": 91139, \"target\": 78604}, {\"source\": 91139, \"target\": 82126}, {\"source\": 91139, \"target\": 62508}, {\"source\": 91139, \"target\": 138669}, {\"source\": 91139, \"target\": 143635}, {\"source\": 91139, \"target\": 144447}, {\"source\": 91139, \"target\": 227366}, {\"source\": 91139, \"target\": 364978}, {\"source\": 2402, \"target\": 62508}, {\"source\": 2402, \"target\": 69963}, {\"source\": 2402, \"target\": 138669}, {\"source\": 2402, \"target\": 144447}, {\"source\": 227366, \"target\": 69963}, {\"source\": 227366, \"target\": 78604}, {\"source\": 227366, \"target\": 82126}, {\"source\": 227366, \"target\": 143635}, {\"source\": 227366, \"target\": 144447}, {\"source\": 22377, \"target\": 58128}, {\"source\": 22377, \"target\": 62508}, {\"source\": 22377, \"target\": 69963}, {\"source\": 69963, \"target\": 58128}, {\"source\": 69963, \"target\": 62508}, {\"source\": 69963, \"target\": 82126}, {\"source\": 69963, \"target\": 138669}, {\"source\": 69963, \"target\": 143635}, {\"source\": 69963, \"target\": 144447}, {\"source\": 69963, \"target\": 78604}, {\"source\": 69963, \"target\": 364978}, {\"source\": 62508, \"target\": 138669}, {\"source\": 62508, \"target\": 144447}, {\"source\": 62508, \"target\": 78604}, {\"source\": 62508, \"target\": 82126}, {\"source\": 62508, \"target\": 143635}, {\"source\": 138669, \"target\": 78604}, {\"source\": 138669, \"target\": 82126}, {\"source\": 138669, \"target\": 144447}, {\"source\": 138669, \"target\": 143635}, {\"source\": 82126, \"target\": 78604}, {\"source\": 82126, \"target\": 143635}, {\"source\": 82126, \"target\": 144447}, {\"source\": 78604, \"target\": 143635}, {\"source\": 78604, \"target\": 144447}, {\"source\": 143635, \"target\": 144447}]}",
"id": 1647,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wangmeng Zuo, Rafael Molina, Frédo Durand, Terence Tao, Shinichi Nakajima, S. Derin Babacan, Andrew Zisserman, Peyman Milanfar, David P. Wipf, Zhihui Wei, Guillaume Bouchard, Zhaofu Chen, Minh N. Do, Michael Elad\n- Research collaborations between these authors: Wangmeng Zuo and Andrew Zisserman, Wangmeng Zuo and S. Derin Babacan, Wangmeng Zuo and Rafael Molina, Wangmeng Zuo and Peyman Milanfar, Wangmeng Zuo and Michael Elad, Wangmeng Zuo and Frédo Durand, Rafael Molina and Shinichi Nakajima, Rafael Molina and S. Derin Babacan, Rafael Molina and Zhihui Wei, Rafael Molina and David P. Wipf, Rafael Molina and Andrew Zisserman, Rafael Molina and Peyman Milanfar, Rafael Molina and Minh N. Do, Rafael Molina and Michael Elad, Rafael Molina and Terence Tao, Rafael Molina and Frédo Durand, Rafael Molina and Zhaofu Chen, Frédo Durand and Andrew Zisserman, Frédo Durand and S. Derin Babacan, Frédo Durand and Zhihui Wei, Frédo Durand and David P. Wipf, Frédo Durand and Peyman Milanfar, Frédo Durand and Minh N. Do, Frédo Durand and Michael Elad, Terence Tao and S. Derin Babacan, Terence Tao and Zhihui Wei, Terence Tao and David P. Wipf, Terence Tao and Minh N. Do, Terence Tao and Michael Elad, Shinichi Nakajima and Guillaume Bouchard, Shinichi Nakajima and Andrew Zisserman, Shinichi Nakajima and S. Derin Babacan, S. Derin Babacan and Guillaume Bouchard, S. Derin Babacan and Andrew Zisserman, S. Derin Babacan and David P. Wipf, S. Derin Babacan and Peyman Milanfar, S. Derin Babacan and Minh N. Do, S. Derin Babacan and Michael Elad, S. Derin Babacan and Zhihui Wei, S. Derin Babacan and Zhaofu Chen, Andrew Zisserman and Peyman Milanfar, Andrew Zisserman and Michael Elad, Andrew Zisserman and Zhihui Wei, Andrew Zisserman and David P. Wipf, Andrew Zisserman and Minh N. Do, Peyman Milanfar and Zhihui Wei, Peyman Milanfar and David P. Wipf, Peyman Milanfar and Michael Elad, Peyman Milanfar and Minh N. Do, David P. Wipf and Zhihui Wei, David P. Wipf and Minh N. Do, David P. Wipf and Michael Elad, Zhihui Wei and Minh N. Do, Zhihui Wei and Michael Elad, Minh N. Do and Michael Elad.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Emmanuel Sapin, Mehmet Serkan Apaydin, Kenneth A. De Jong, Magali Remaud-Simeon, Amarda Shehu, David Hsu, Shaun M. Kandathil, Irina Hashmi, Julia Handl, Rudy Clausen, Tsung-Han Chiang, Juan Cortés, Brian S. Olson, Ruth Nussinov\n- Research collaborations between these authors: Emmanuel Sapin and Kenneth A. De Jong, Emmanuel Sapin and Amarda Shehu, Emmanuel Sapin and Brian S. Olson, Emmanuel Sapin and Rudy Clausen, Mehmet Serkan Apaydin and David Hsu, Mehmet Serkan Apaydin and Amarda Shehu, Mehmet Serkan Apaydin and Juan Cortés, Mehmet Serkan Apaydin and Tsung-Han Chiang, Kenneth A. De Jong and Amarda Shehu, Kenneth A. De Jong and Brian S. Olson, Kenneth A. De Jong and Rudy Clausen, Magali Remaud-Simeon and Amarda Shehu, Magali Remaud-Simeon and Juan Cortés, Amarda Shehu and Julia Handl, Amarda Shehu and David Hsu, Amarda Shehu and Ruth Nussinov, Amarda Shehu and Juan Cortés, Amarda Shehu and Brian S. Olson, Amarda Shehu and Tsung-Han Chiang, Amarda Shehu and Irina Hashmi, Amarda Shehu and Rudy Clausen, Amarda Shehu and Shaun M. Kandathil, David Hsu and Juan Cortés, David Hsu and Brian S. Olson, Irina Hashmi and Ruth Nussinov, Irina Hashmi and Brian S. Olson, Rudy Clausen and Brian S. Olson.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Emmanuel Sapin\", \"id\": 31392}, {\"name\": \"Mehmet Serkan Apaydin\", \"id\": 111936}, {\"name\": \"Kenneth A. De Jong\", \"id\": 48802}, {\"name\": \"Magali Remaud-Simeon\", \"id\": 651170}, {\"name\": \"Amarda Shehu\", \"id\": 109991}, {\"name\": \"David Hsu\", \"id\": 3369}, {\"name\": \"Juan Cort\\u00e9s\", \"id\": 206042}, {\"name\": \"Shaun M. Kandathil\", \"id\": 624816}, {\"name\": \"Irina Hashmi\", \"id\": 423792}, {\"name\": \"Julia Handl\", \"id\": 2036}, {\"name\": \"Tsung-Han Chiang\", \"id\": 293044}, {\"name\": \"Rudy Clausen\", \"id\": 492122}, {\"name\": \"Brian S. Olson\", \"id\": 220667}, {\"name\": \"Ruth Nussinov\", \"id\": 63709}], \"links\": [{\"source\": 31392, \"target\": 48802}, {\"source\": 31392, \"target\": 109991}, {\"source\": 31392, \"target\": 220667}, {\"source\": 31392, \"target\": 492122}, {\"source\": 111936, \"target\": 3369}, {\"source\": 111936, \"target\": 109991}, {\"source\": 111936, \"target\": 206042}, {\"source\": 111936, \"target\": 293044}, {\"source\": 48802, \"target\": 109991}, {\"source\": 48802, \"target\": 220667}, {\"source\": 48802, \"target\": 492122}, {\"source\": 651170, \"target\": 109991}, {\"source\": 651170, \"target\": 206042}, {\"source\": 109991, \"target\": 2036}, {\"source\": 109991, \"target\": 3369}, {\"source\": 109991, \"target\": 63709}, {\"source\": 109991, \"target\": 206042}, {\"source\": 109991, \"target\": 220667}, {\"source\": 109991, \"target\": 293044}, {\"source\": 109991, \"target\": 423792}, {\"source\": 109991, \"target\": 492122}, {\"source\": 109991, \"target\": 624816}, {\"source\": 3369, \"target\": 206042}, {\"source\": 3369, \"target\": 220667}, {\"source\": 423792, \"target\": 63709}, {\"source\": 423792, \"target\": 220667}, {\"source\": 492122, \"target\": 220667}]}",
"id": 2982,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Emmanuel Sapin, Mehmet Serkan Apaydin, Kenneth A. De Jong, Magali Remaud-Simeon, Amarda Shehu, David Hsu, Shaun M. Kandathil, Irina Hashmi, Julia Handl, Rudy Clausen, Tsung-Han Chiang, Juan Cortés, Brian S. Olson, Ruth Nussinov\n- Research collaborations between these authors: Emmanuel Sapin and Kenneth A. De Jong, Emmanuel Sapin and Amarda Shehu, Emmanuel Sapin and Brian S. Olson, Emmanuel Sapin and Rudy Clausen, Mehmet Serkan Apaydin and David Hsu, Mehmet Serkan Apaydin and Amarda Shehu, Mehmet Serkan Apaydin and Juan Cortés, Mehmet Serkan Apaydin and Tsung-Han Chiang, Kenneth A. De Jong and Amarda Shehu, Kenneth A. De Jong and Brian S. Olson, Kenneth A. De Jong and Rudy Clausen, Magali Remaud-Simeon and Amarda Shehu, Magali Remaud-Simeon and Juan Cortés, Amarda Shehu and Julia Handl, Amarda Shehu and David Hsu, Amarda Shehu and Ruth Nussinov, Amarda Shehu and Juan Cortés, Amarda Shehu and Brian S. Olson, Amarda Shehu and Tsung-Han Chiang, Amarda Shehu and Irina Hashmi, Amarda Shehu and Rudy Clausen, Amarda Shehu and Shaun M. Kandathil, David Hsu and Juan Cortés, David Hsu and Brian S. Olson, Irina Hashmi and Ruth Nussinov, Irina Hashmi and Brian S. Olson, Rudy Clausen and Brian S. Olson.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Boleslaw K. Szymanski, Miodrag Bolic, Zijian Wang, B. Earl Wells, Kirill Mechitov, Cauligi S. Raghavendra, Haibin Wan, Eyuphan Bulut, Youngwon Kim An, Changhyuk An, Jayesh H. Kotecha, Neil J. Gordon, Petar M. Djuric, Sahin Cem Geyik\n- Research collaborations between these authors: Boleslaw K. Szymanski and B. Earl Wells, Boleslaw K. Szymanski and Sahin Cem Geyik, Boleslaw K. Szymanski and Kirill Mechitov, Boleslaw K. Szymanski and Cauligi S. Raghavendra, Boleslaw K. Szymanski and Eyuphan Bulut, Boleslaw K. Szymanski and Zijian Wang, Boleslaw K. Szymanski and Youngwon Kim An, Boleslaw K. Szymanski and Changhyuk An, Miodrag Bolic and Petar M. Djuric, Miodrag Bolic and Neil J. Gordon, Miodrag Bolic and Jayesh H. Kotecha, Zijian Wang and B. Earl Wells, Zijian Wang and Sahin Cem Geyik, Zijian Wang and Haibin Wan, Zijian Wang and Eyuphan Bulut, Zijian Wang and Kirill Mechitov, Zijian Wang and Cauligi S. Raghavendra, Zijian Wang and Youngwon Kim An, Zijian Wang and Changhyuk An, B. Earl Wells and Kirill Mechitov, B. Earl Wells and Petar M. Djuric, B. Earl Wells and Neil J. Gordon, B. Earl Wells and Jayesh H. Kotecha, B. Earl Wells and Eyuphan Bulut, Kirill Mechitov and Eyuphan Bulut, Kirill Mechitov and Youngwon Kim An, Kirill Mechitov and Changhyuk An, Cauligi S. Raghavendra and Sahin Cem Geyik, Cauligi S. Raghavendra and Eyuphan Bulut, Eyuphan Bulut and Sahin Cem Geyik, Eyuphan Bulut and Youngwon Kim An, Eyuphan Bulut and Changhyuk An, Youngwon Kim An and Petar M. Djuric, Youngwon Kim An and Neil J. Gordon, Youngwon Kim An and Jayesh H. Kotecha, Changhyuk An and Petar M. Djuric, Changhyuk An and Neil J. Gordon, Changhyuk An and Jayesh H. Kotecha, Jayesh H. Kotecha and Petar M. Djuric, Neil J. Gordon and Petar M. Djuric.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Boleslaw K. Szymanski\", \"id\": 73633}, {\"name\": \"Miodrag Bolic\", \"id\": 148738}, {\"name\": \"Zijian Wang\", \"id\": 363876}, {\"name\": \"B. Earl Wells\", \"id\": 2668}, {\"name\": \"Petar M. Djuric\", \"id\": 223613}, {\"name\": \"Kirill Mechitov\", \"id\": 57582}, {\"name\": \"Haibin Wan\", \"id\": 268209}, {\"name\": \"Eyuphan Bulut\", \"id\": 357941}, {\"name\": \"Youngwon Kim An\", \"id\": 1028022}, {\"name\": \"Changhyuk An\", \"id\": 1028023}, {\"name\": \"Jayesh H. Kotecha\", \"id\": 294778}, {\"name\": \"Neil J. Gordon\", \"id\": 226971}, {\"name\": \"Cauligi S. Raghavendra\", \"id\": 144669}, {\"name\": \"Sahin Cem Geyik\", \"id\": 73631}], \"links\": [{\"source\": 73633, \"target\": 2668}, {\"source\": 73633, \"target\": 73631}, {\"source\": 73633, \"target\": 57582}, {\"source\": 73633, \"target\": 144669}, {\"source\": 73633, \"target\": 357941}, {\"source\": 73633, \"target\": 363876}, {\"source\": 73633, \"target\": 1028022}, {\"source\": 73633, \"target\": 1028023}, {\"source\": 148738, \"target\": 223613}, {\"source\": 148738, \"target\": 226971}, {\"source\": 148738, \"target\": 294778}, {\"source\": 363876, \"target\": 2668}, {\"source\": 363876, \"target\": 73631}, {\"source\": 363876, \"target\": 268209}, {\"source\": 363876, \"target\": 357941}, {\"source\": 363876, \"target\": 57582}, {\"source\": 363876, \"target\": 144669}, {\"source\": 363876, \"target\": 1028022}, {\"source\": 363876, \"target\": 1028023}, {\"source\": 2668, \"target\": 57582}, {\"source\": 2668, \"target\": 223613}, {\"source\": 2668, \"target\": 226971}, {\"source\": 2668, \"target\": 294778}, {\"source\": 2668, \"target\": 357941}, {\"source\": 223613, \"target\": 226971}, {\"source\": 223613, \"target\": 294778}, {\"source\": 223613, \"target\": 1028022}, {\"source\": 223613, \"target\": 1028023}, {\"source\": 57582, \"target\": 357941}, {\"source\": 57582, \"target\": 1028022}, {\"source\": 57582, \"target\": 1028023}, {\"source\": 357941, \"target\": 73631}, {\"source\": 357941, \"target\": 144669}, {\"source\": 357941, \"target\": 1028022}, {\"source\": 357941, \"target\": 1028023}, {\"source\": 1028022, \"target\": 226971}, {\"source\": 1028022, \"target\": 294778}, {\"source\": 1028023, \"target\": 226971}, {\"source\": 1028023, \"target\": 294778}, {\"source\": 144669, \"target\": 73631}]}",
"id": 2149,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Boleslaw K. Szymanski, Miodrag Bolic, Zijian Wang, B. Earl Wells, Kirill Mechitov, Cauligi S. Raghavendra, Haibin Wan, Eyuphan Bulut, Youngwon Kim An, Changhyuk An, Jayesh H. Kotecha, Neil J. Gordon, Petar M. Djuric, Sahin Cem Geyik\n- Research collaborations between these authors: Boleslaw K. Szymanski and B. Earl Wells, Boleslaw K. Szymanski and Sahin Cem Geyik, Boleslaw K. Szymanski and Kirill Mechitov, Boleslaw K. Szymanski and Cauligi S. Raghavendra, Boleslaw K. Szymanski and Eyuphan Bulut, Boleslaw K. Szymanski and Zijian Wang, Boleslaw K. Szymanski and Youngwon Kim An, Boleslaw K. Szymanski and Changhyuk An, Miodrag Bolic and Petar M. Djuric, Miodrag Bolic and Neil J. Gordon, Miodrag Bolic and Jayesh H. Kotecha, Zijian Wang and B. Earl Wells, Zijian Wang and Sahin Cem Geyik, Zijian Wang and Haibin Wan, Zijian Wang and Eyuphan Bulut, Zijian Wang and Kirill Mechitov, Zijian Wang and Cauligi S. Raghavendra, Zijian Wang and Youngwon Kim An, Zijian Wang and Changhyuk An, B. Earl Wells and Kirill Mechitov, B. Earl Wells and Petar M. Djuric, B. Earl Wells and Neil J. Gordon, B. Earl Wells and Jayesh H. Kotecha, B. Earl Wells and Eyuphan Bulut, Kirill Mechitov and Eyuphan Bulut, Kirill Mechitov and Youngwon Kim An, Kirill Mechitov and Changhyuk An, Cauligi S. Raghavendra and Sahin Cem Geyik, Cauligi S. Raghavendra and Eyuphan Bulut, Eyuphan Bulut and Sahin Cem Geyik, Eyuphan Bulut and Youngwon Kim An, Eyuphan Bulut and Changhyuk An, Youngwon Kim An and Petar M. Djuric, Youngwon Kim An and Neil J. Gordon, Youngwon Kim An and Jayesh H. Kotecha, Changhyuk An and Petar M. Djuric, Changhyuk An and Neil J. Gordon, Changhyuk An and Jayesh H. Kotecha, Jayesh H. Kotecha and Petar M. Djuric, Neil J. Gordon and Petar M. Djuric.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Santiago Gómez Sáez, Ian Sommerville, Vasilios Andrikopoulos, Sanjiva Weerawarana, Olha Danylevych, Manfred Reichert, Santiago Jiménez Gómez, Rajiv Ranjan, Srinath Perera, Frank Leymann, Mathias Weske, Paolo Traverso, Luigi Logrippo, Wouter Joosen\n- Research collaborations between these authors: Santiago Gómez Sáez and Frank Leymann, Santiago Gómez Sáez and Vasilios Andrikopoulos, Santiago Gómez Sáez and Manfred Reichert, Santiago Gómez Sáez and Paolo Traverso, Santiago Gómez Sáez and Wouter Joosen, Santiago Gómez Sáez and Mathias Weske, Santiago Gómez Sáez and Sanjiva Weerawarana, Santiago Gómez Sáez and Srinath Perera, Santiago Gómez Sáez and Santiago Jiménez Gómez, Ian Sommerville and Frank Leymann, Ian Sommerville and Rajiv Ranjan, Ian Sommerville and Vasilios Andrikopoulos, Vasilios Andrikopoulos and Frank Leymann, Vasilios Andrikopoulos and Manfred Reichert, Vasilios Andrikopoulos and Paolo Traverso, Vasilios Andrikopoulos and Wouter Joosen, Vasilios Andrikopoulos and Mathias Weske, Vasilios Andrikopoulos and Sanjiva Weerawarana, Vasilios Andrikopoulos and Rajiv Ranjan, Vasilios Andrikopoulos and Olha Danylevych, Vasilios Andrikopoulos and Srinath Perera, Vasilios Andrikopoulos and Santiago Jiménez Gómez, Sanjiva Weerawarana and Manfred Reichert, Sanjiva Weerawarana and Frank Leymann, Sanjiva Weerawarana and Wouter Joosen, Sanjiva Weerawarana and Srinath Perera, Olha Danylevych and Frank Leymann, Olha Danylevych and Paolo Traverso, Olha Danylevych and Mathias Weske, Manfred Reichert and Paolo Traverso, Manfred Reichert and Frank Leymann, Manfred Reichert and Mathias Weske, Santiago Jiménez Gómez and Frank Leymann, Rajiv Ranjan and Frank Leymann, Srinath Perera and Frank Leymann, Srinath Perera and Wouter Joosen, Frank Leymann and Paolo Traverso, Frank Leymann and Wouter Joosen, Frank Leymann and Mathias Weske.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Santiago G\\u00f3mez S\\u00e1ez\", \"id\": 91936}, {\"name\": \"Ian Sommerville\", \"id\": 13632}, {\"name\": \"Vasilios Andrikopoulos\", \"id\": 77218}, {\"name\": \"Sanjiva Weerawarana\", \"id\": 58402}, {\"name\": \"Olha Danylevych\", \"id\": 80358}, {\"name\": \"Manfred Reichert\", \"id\": 4234}, {\"name\": \"Santiago Jim\\u00e9nez G\\u00f3mez\", \"id\": 1177489}, {\"name\": \"Rajiv Ranjan\", \"id\": 65331}, {\"name\": \"Srinath Perera\", \"id\": 401332}, {\"name\": \"Frank Leymann\", \"id\": 8279}, {\"name\": \"Mathias Weske\", \"id\": 20186}, {\"name\": \"Paolo Traverso\", \"id\": 7899}, {\"name\": \"Luigi Logrippo\", \"id\": 60284}, {\"name\": \"Wouter Joosen\", \"id\": 12735}], \"links\": [{\"source\": 91936, \"target\": 8279}, {\"source\": 91936, \"target\": 77218}, {\"source\": 91936, \"target\": 4234}, {\"source\": 91936, \"target\": 7899}, {\"source\": 91936, \"target\": 12735}, {\"source\": 91936, \"target\": 20186}, {\"source\": 91936, \"target\": 58402}, {\"source\": 91936, \"target\": 401332}, {\"source\": 91936, \"target\": 1177489}, {\"source\": 13632, \"target\": 8279}, {\"source\": 13632, \"target\": 65331}, {\"source\": 13632, \"target\": 77218}, {\"source\": 77218, \"target\": 8279}, {\"source\": 77218, \"target\": 4234}, {\"source\": 77218, \"target\": 7899}, {\"source\": 77218, \"target\": 12735}, {\"source\": 77218, \"target\": 20186}, {\"source\": 77218, \"target\": 58402}, {\"source\": 77218, \"target\": 65331}, {\"source\": 77218, \"target\": 80358}, {\"source\": 77218, \"target\": 401332}, {\"source\": 77218, \"target\": 1177489}, {\"source\": 58402, \"target\": 4234}, {\"source\": 58402, \"target\": 8279}, {\"source\": 58402, \"target\": 12735}, {\"source\": 58402, \"target\": 401332}, {\"source\": 80358, \"target\": 8279}, {\"source\": 80358, \"target\": 7899}, {\"source\": 80358, \"target\": 20186}, {\"source\": 4234, \"target\": 7899}, {\"source\": 4234, \"target\": 8279}, {\"source\": 4234, \"target\": 20186}, {\"source\": 1177489, \"target\": 8279}, {\"source\": 65331, \"target\": 8279}, {\"source\": 401332, \"target\": 8279}, {\"source\": 401332, \"target\": 12735}, {\"source\": 8279, \"target\": 7899}, {\"source\": 8279, \"target\": 12735}, {\"source\": 8279, \"target\": 20186}]}",
"id": 589,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Santiago Gómez Sáez, Ian Sommerville, Vasilios Andrikopoulos, Sanjiva Weerawarana, Olha Danylevych, Manfred Reichert, Santiago Jiménez Gómez, Rajiv Ranjan, Srinath Perera, Frank Leymann, Mathias Weske, Paolo Traverso, Luigi Logrippo, Wouter Joosen\n- Research collaborations between these authors: Santiago Gómez Sáez and Frank Leymann, Santiago Gómez Sáez and Vasilios Andrikopoulos, Santiago Gómez Sáez and Manfred Reichert, Santiago Gómez Sáez and Paolo Traverso, Santiago Gómez Sáez and Wouter Joosen, Santiago Gómez Sáez and Mathias Weske, Santiago Gómez Sáez and Sanjiva Weerawarana, Santiago Gómez Sáez and Srinath Perera, Santiago Gómez Sáez and Santiago Jiménez Gómez, Ian Sommerville and Frank Leymann, Ian Sommerville and Rajiv Ranjan, Ian Sommerville and Vasilios Andrikopoulos, Vasilios Andrikopoulos and Frank Leymann, Vasilios Andrikopoulos and Manfred Reichert, Vasilios Andrikopoulos and Paolo Traverso, Vasilios Andrikopoulos and Wouter Joosen, Vasilios Andrikopoulos and Mathias Weske, Vasilios Andrikopoulos and Sanjiva Weerawarana, Vasilios Andrikopoulos and Rajiv Ranjan, Vasilios Andrikopoulos and Olha Danylevych, Vasilios Andrikopoulos and Srinath Perera, Vasilios Andrikopoulos and Santiago Jiménez Gómez, Sanjiva Weerawarana and Manfred Reichert, Sanjiva Weerawarana and Frank Leymann, Sanjiva Weerawarana and Wouter Joosen, Sanjiva Weerawarana and Srinath Perera, Olha Danylevych and Frank Leymann, Olha Danylevych and Paolo Traverso, Olha Danylevych and Mathias Weske, Manfred Reichert and Paolo Traverso, Manfred Reichert and Frank Leymann, Manfred Reichert and Mathias Weske, Santiago Jiménez Gómez and Frank Leymann, Rajiv Ranjan and Frank Leymann, Srinath Perera and Frank Leymann, Srinath Perera and Wouter Joosen, Frank Leymann and Paolo Traverso, Frank Leymann and Wouter Joosen, Frank Leymann and Mathias Weske.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Chin-Feng Lee, Xiaolong Li, Chung-Ming Wang, Benoît Macq, Ryutarou Ohbuchi, Yuan-Yu Tsai, Kai Wang, Atilla Baskurt, Guillaume Lavoué, Florence Denis, Chin-Chen Chang, Chi-Shiang Chan, Akio Mukaiyama, Hsing-Ling Chen\n- Research collaborations between these authors: Chin-Feng Lee and Chin-Chen Chang, Chin-Feng Lee and Chung-Ming Wang, Chin-Feng Lee and Hsing-Ling Chen, Chin-Feng Lee and Yuan-Yu Tsai, Xiaolong Li and Chin-Chen Chang, Xiaolong Li and Yuan-Yu Tsai, Chung-Ming Wang and Chin-Chen Chang, Chung-Ming Wang and Benoît Macq, Chung-Ming Wang and Ryutarou Ohbuchi, Chung-Ming Wang and Akio Mukaiyama, Chung-Ming Wang and Hsing-Ling Chen, Chung-Ming Wang and Yuan-Yu Tsai, Benoît Macq and Guillaume Lavoué, Benoît Macq and Atilla Baskurt, Benoît Macq and Kai Wang, Benoît Macq and Ryutarou Ohbuchi, Benoît Macq and Chin-Chen Chang, Benoît Macq and Yuan-Yu Tsai, Benoît Macq and Florence Denis, Ryutarou Ohbuchi and Guillaume Lavoué, Ryutarou Ohbuchi and Atilla Baskurt, Ryutarou Ohbuchi and Kai Wang, Ryutarou Ohbuchi and Yuan-Yu Tsai, Ryutarou Ohbuchi and Florence Denis, Yuan-Yu Tsai and Hsing-Ling Chen, Yuan-Yu Tsai and Guillaume Lavoué, Yuan-Yu Tsai and Atilla Baskurt, Yuan-Yu Tsai and Kai Wang, Yuan-Yu Tsai and Chin-Chen Chang, Yuan-Yu Tsai and Chi-Shiang Chan, Yuan-Yu Tsai and Akio Mukaiyama, Yuan-Yu Tsai and Florence Denis, Kai Wang and Guillaume Lavoué, Kai Wang and Atilla Baskurt, Kai Wang and Akio Mukaiyama, Kai Wang and Florence Denis, Atilla Baskurt and Guillaume Lavoué, Atilla Baskurt and Akio Mukaiyama, Atilla Baskurt and Florence Denis, Guillaume Lavoué and Akio Mukaiyama, Guillaume Lavoué and Florence Denis, Florence Denis and Akio Mukaiyama, Chin-Chen Chang and Hsing-Ling Chen, Chin-Chen Chang and Chi-Shiang Chan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Chin-Feng Lee\", \"id\": 124768}, {\"name\": \"Xiaolong Li\", \"id\": 16578}, {\"name\": \"Chung-Ming Wang\", \"id\": 137763}, {\"name\": \"Ryutarou Ohbuchi\", \"id\": 73442}, {\"name\": \"Beno\\u00eet Macq\", \"id\": 46051}, {\"name\": \"Yuan-Yu Tsai\", \"id\": 228617}, {\"name\": \"Kai Wang\", \"id\": 45513}, {\"name\": \"Atilla Baskurt\", \"id\": 36683}, {\"name\": \"Guillaume Lavou\\u00e9\", \"id\": 34794}, {\"name\": \"Florence Denis\", \"id\": 309390}, {\"name\": \"Chin-Chen Chang\", \"id\": 49231}, {\"name\": \"Chi-Shiang Chan\", \"id\": 229426}, {\"name\": \"Akio Mukaiyama\", \"id\": 268893}, {\"name\": \"Hsing-Ling Chen\", \"id\": 143038}], \"links\": [{\"source\": 124768, \"target\": 49231}, {\"source\": 124768, \"target\": 137763}, {\"source\": 124768, \"target\": 143038}, {\"source\": 124768, \"target\": 228617}, {\"source\": 16578, \"target\": 49231}, {\"source\": 16578, \"target\": 228617}, {\"source\": 137763, \"target\": 49231}, {\"source\": 137763, \"target\": 46051}, {\"source\": 137763, \"target\": 73442}, {\"source\": 137763, \"target\": 268893}, {\"source\": 137763, \"target\": 143038}, {\"source\": 137763, \"target\": 228617}, {\"source\": 73442, \"target\": 34794}, {\"source\": 73442, \"target\": 36683}, {\"source\": 73442, \"target\": 45513}, {\"source\": 73442, \"target\": 46051}, {\"source\": 73442, \"target\": 228617}, {\"source\": 73442, \"target\": 309390}, {\"source\": 46051, \"target\": 34794}, {\"source\": 46051, \"target\": 36683}, {\"source\": 46051, \"target\": 45513}, {\"source\": 46051, \"target\": 49231}, {\"source\": 46051, \"target\": 228617}, {\"source\": 46051, \"target\": 309390}, {\"source\": 228617, \"target\": 143038}, {\"source\": 228617, \"target\": 34794}, {\"source\": 228617, \"target\": 36683}, {\"source\": 228617, \"target\": 45513}, {\"source\": 228617, \"target\": 49231}, {\"source\": 228617, \"target\": 229426}, {\"source\": 228617, \"target\": 268893}, {\"source\": 228617, \"target\": 309390}, {\"source\": 45513, \"target\": 34794}, {\"source\": 45513, \"target\": 36683}, {\"source\": 45513, \"target\": 268893}, {\"source\": 45513, \"target\": 309390}, {\"source\": 36683, \"target\": 34794}, {\"source\": 36683, \"target\": 268893}, {\"source\": 36683, \"target\": 309390}, {\"source\": 34794, \"target\": 268893}, {\"source\": 34794, \"target\": 309390}, {\"source\": 309390, \"target\": 268893}, {\"source\": 49231, \"target\": 143038}, {\"source\": 49231, \"target\": 229426}]}",
"id": 1387,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Chin-Feng Lee, Xiaolong Li, Chung-Ming Wang, Benoît Macq, Ryutarou Ohbuchi, Yuan-Yu Tsai, Kai Wang, Atilla Baskurt, Guillaume Lavoué, Florence Denis, Chin-Chen Chang, Chi-Shiang Chan, Akio Mukaiyama, Hsing-Ling Chen\n- Research collaborations between these authors: Chin-Feng Lee and Chin-Chen Chang, Chin-Feng Lee and Chung-Ming Wang, Chin-Feng Lee and Hsing-Ling Chen, Chin-Feng Lee and Yuan-Yu Tsai, Xiaolong Li and Chin-Chen Chang, Xiaolong Li and Yuan-Yu Tsai, Chung-Ming Wang and Chin-Chen Chang, Chung-Ming Wang and Benoît Macq, Chung-Ming Wang and Ryutarou Ohbuchi, Chung-Ming Wang and Akio Mukaiyama, Chung-Ming Wang and Hsing-Ling Chen, Chung-Ming Wang and Yuan-Yu Tsai, Benoît Macq and Guillaume Lavoué, Benoît Macq and Atilla Baskurt, Benoît Macq and Kai Wang, Benoît Macq and Ryutarou Ohbuchi, Benoît Macq and Chin-Chen Chang, Benoît Macq and Yuan-Yu Tsai, Benoît Macq and Florence Denis, Ryutarou Ohbuchi and Guillaume Lavoué, Ryutarou Ohbuchi and Atilla Baskurt, Ryutarou Ohbuchi and Kai Wang, Ryutarou Ohbuchi and Yuan-Yu Tsai, Ryutarou Ohbuchi and Florence Denis, Yuan-Yu Tsai and Hsing-Ling Chen, Yuan-Yu Tsai and Guillaume Lavoué, Yuan-Yu Tsai and Atilla Baskurt, Yuan-Yu Tsai and Kai Wang, Yuan-Yu Tsai and Chin-Chen Chang, Yuan-Yu Tsai and Chi-Shiang Chan, Yuan-Yu Tsai and Akio Mukaiyama, Yuan-Yu Tsai and Florence Denis, Kai Wang and Guillaume Lavoué, Kai Wang and Atilla Baskurt, Kai Wang and Akio Mukaiyama, Kai Wang and Florence Denis, Atilla Baskurt and Guillaume Lavoué, Atilla Baskurt and Akio Mukaiyama, Atilla Baskurt and Florence Denis, Guillaume Lavoué and Akio Mukaiyama, Guillaume Lavoué and Florence Denis, Florence Denis and Akio Mukaiyama, Chin-Chen Chang and Hsing-Ling Chen, Chin-Chen Chang and Chi-Shiang Chan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Steven A. Borbash, Anthony Ephremides, Daniel E. Lucani, Alexander L. Stolyar, Michael J. Neely, Qing He, Leandros Tassiulas, Milica Stojanovic, Saswati Sarkar, Leonidas Georgiadis, Anna Pantelidou, Jeffrey E. Wieselthier, Eytan Modiano, Muriel Medard\n- Research collaborations between these authors: Steven A. Borbash and Qing He, Steven A. Borbash and Anthony Ephremides, Steven A. Borbash and Jeffrey E. Wieselthier, Steven A. Borbash and Anna Pantelidou, Anthony Ephremides and Qing He, Anthony Ephremides and Leandros Tassiulas, Anthony Ephremides and Eytan Modiano, Anthony Ephremides and Muriel Medard, Anthony Ephremides and Saswati Sarkar, Anthony Ephremides and Michael J. Neely, Anthony Ephremides and Leonidas Georgiadis, Anthony Ephremides and Alexander L. Stolyar, Anthony Ephremides and Jeffrey E. Wieselthier, Anthony Ephremides and Anna Pantelidou, Daniel E. Lucani and Muriel Medard, Daniel E. Lucani and Milica Stojanovic, Daniel E. Lucani and Anna Pantelidou, Alexander L. Stolyar and Leandros Tassiulas, Alexander L. Stolyar and Eytan Modiano, Alexander L. Stolyar and Muriel Medard, Alexander L. Stolyar and Michael J. Neely, Alexander L. Stolyar and Anna Pantelidou, Michael J. Neely and Qing He, Michael J. Neely and Leandros Tassiulas, Michael J. Neely and Eytan Modiano, Michael J. Neely and Muriel Medard, Michael J. Neely and Saswati Sarkar, Michael J. Neely and Leonidas Georgiadis, Michael J. Neely and Anna Pantelidou, Qing He and Jeffrey E. Wieselthier, Qing He and Anna Pantelidou, Leandros Tassiulas and Eytan Modiano, Leandros Tassiulas and Muriel Medard, Leandros Tassiulas and Saswati Sarkar, Leandros Tassiulas and Leonidas Georgiadis, Leandros Tassiulas and Anna Pantelidou, Milica Stojanovic and Muriel Medard, Milica Stojanovic and Anna Pantelidou, Saswati Sarkar and Eytan Modiano, Saswati Sarkar and Jeffrey E. Wieselthier, Saswati Sarkar and Leonidas Georgiadis, Saswati Sarkar and Anna Pantelidou, Leonidas Georgiadis and Eytan Modiano, Leonidas Georgiadis and Muriel Medard, Leonidas Georgiadis and Jeffrey E. Wieselthier, Leonidas Georgiadis and Anna Pantelidou, Anna Pantelidou and Eytan Modiano, Anna Pantelidou and Muriel Medard, Anna Pantelidou and Jeffrey E. Wieselthier, Jeffrey E. Wieselthier and Eytan Modiano, Jeffrey E. Wieselthier and Muriel Medard, Eytan Modiano and Muriel Medard.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Steven A. Borbash\", \"id\": 691457}, {\"name\": \"Anthony Ephremides\", \"id\": 86307}, {\"name\": \"Daniel E. Lucani\", \"id\": 117573}, {\"name\": \"Alexander L. Stolyar\", \"id\": 216999}, {\"name\": \"Michael J. Neely\", \"id\": 83754}, {\"name\": \"Qing He\", \"id\": 3822}, {\"name\": \"Leandros Tassiulas\", \"id\": 14606}, {\"name\": \"Milica Stojanovic\", \"id\": 280340}, {\"name\": \"Saswati Sarkar\", \"id\": 79862}, {\"name\": \"Leonidas Georgiadis\", \"id\": 86072}, {\"name\": \"Anna Pantelidou\", \"id\": 493625}, {\"name\": \"Jeffrey E. Wieselthier\", \"id\": 230331}, {\"name\": \"Eytan Modiano\", \"id\": 27581}, {\"name\": \"Muriel Medard\", \"id\": 27582}], \"links\": [{\"source\": 691457, \"target\": 3822}, {\"source\": 691457, \"target\": 86307}, {\"source\": 691457, \"target\": 230331}, {\"source\": 691457, \"target\": 493625}, {\"source\": 86307, \"target\": 3822}, {\"source\": 86307, \"target\": 14606}, {\"source\": 86307, \"target\": 27581}, {\"source\": 86307, \"target\": 27582}, {\"source\": 86307, \"target\": 79862}, {\"source\": 86307, \"target\": 83754}, {\"source\": 86307, \"target\": 86072}, {\"source\": 86307, \"target\": 216999}, {\"source\": 86307, \"target\": 230331}, {\"source\": 86307, \"target\": 493625}, {\"source\": 117573, \"target\": 27582}, {\"source\": 117573, \"target\": 280340}, {\"source\": 117573, \"target\": 493625}, {\"source\": 216999, \"target\": 14606}, {\"source\": 216999, \"target\": 27581}, {\"source\": 216999, \"target\": 27582}, {\"source\": 216999, \"target\": 83754}, {\"source\": 216999, \"target\": 493625}, {\"source\": 83754, \"target\": 3822}, {\"source\": 83754, \"target\": 14606}, {\"source\": 83754, \"target\": 27581}, {\"source\": 83754, \"target\": 27582}, {\"source\": 83754, \"target\": 79862}, {\"source\": 83754, \"target\": 86072}, {\"source\": 83754, \"target\": 493625}, {\"source\": 3822, \"target\": 230331}, {\"source\": 3822, \"target\": 493625}, {\"source\": 14606, \"target\": 27581}, {\"source\": 14606, \"target\": 27582}, {\"source\": 14606, \"target\": 79862}, {\"source\": 14606, \"target\": 86072}, {\"source\": 14606, \"target\": 493625}, {\"source\": 280340, \"target\": 27582}, {\"source\": 280340, \"target\": 493625}, {\"source\": 79862, \"target\": 27581}, {\"source\": 79862, \"target\": 230331}, {\"source\": 79862, \"target\": 86072}, {\"source\": 79862, \"target\": 493625}, {\"source\": 86072, \"target\": 27581}, {\"source\": 86072, \"target\": 27582}, {\"source\": 86072, \"target\": 230331}, {\"source\": 86072, \"target\": 493625}, {\"source\": 493625, \"target\": 27581}, {\"source\": 493625, \"target\": 27582}, {\"source\": 493625, \"target\": 230331}, {\"source\": 230331, \"target\": 27581}, {\"source\": 230331, \"target\": 27582}, {\"source\": 27581, \"target\": 27582}]}",
"id": 2048,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Steven A. Borbash, Anthony Ephremides, Daniel E. Lucani, Alexander L. Stolyar, Michael J. Neely, Qing He, Leandros Tassiulas, Milica Stojanovic, Saswati Sarkar, Leonidas Georgiadis, Anna Pantelidou, Jeffrey E. Wieselthier, Eytan Modiano, Muriel Medard\n- Research collaborations between these authors: Steven A. Borbash and Qing He, Steven A. Borbash and Anthony Ephremides, Steven A. Borbash and Jeffrey E. Wieselthier, Steven A. Borbash and Anna Pantelidou, Anthony Ephremides and Qing He, Anthony Ephremides and Leandros Tassiulas, Anthony Ephremides and Eytan Modiano, Anthony Ephremides and Muriel Medard, Anthony Ephremides and Saswati Sarkar, Anthony Ephremides and Michael J. Neely, Anthony Ephremides and Leonidas Georgiadis, Anthony Ephremides and Alexander L. Stolyar, Anthony Ephremides and Jeffrey E. Wieselthier, Anthony Ephremides and Anna Pantelidou, Daniel E. Lucani and Muriel Medard, Daniel E. Lucani and Milica Stojanovic, Daniel E. Lucani and Anna Pantelidou, Alexander L. Stolyar and Leandros Tassiulas, Alexander L. Stolyar and Eytan Modiano, Alexander L. Stolyar and Muriel Medard, Alexander L. Stolyar and Michael J. Neely, Alexander L. Stolyar and Anna Pantelidou, Michael J. Neely and Qing He, Michael J. Neely and Leandros Tassiulas, Michael J. Neely and Eytan Modiano, Michael J. Neely and Muriel Medard, Michael J. Neely and Saswati Sarkar, Michael J. Neely and Leonidas Georgiadis, Michael J. Neely and Anna Pantelidou, Qing He and Jeffrey E. Wieselthier, Qing He and Anna Pantelidou, Leandros Tassiulas and Eytan Modiano, Leandros Tassiulas and Muriel Medard, Leandros Tassiulas and Saswati Sarkar, Leandros Tassiulas and Leonidas Georgiadis, Leandros Tassiulas and Anna Pantelidou, Milica Stojanovic and Muriel Medard, Milica Stojanovic and Anna Pantelidou, Saswati Sarkar and Eytan Modiano, Saswati Sarkar and Jeffrey E. Wieselthier, Saswati Sarkar and Leonidas Georgiadis, Saswati Sarkar and Anna Pantelidou, Leonidas Georgiadis and Eytan Modiano, Leonidas Georgiadis and Muriel Medard, Leonidas Georgiadis and Jeffrey E. Wieselthier, Leonidas Georgiadis and Anna Pantelidou, Anna Pantelidou and Eytan Modiano, Anna Pantelidou and Muriel Medard, Anna Pantelidou and Jeffrey E. Wieselthier, Jeffrey E. Wieselthier and Eytan Modiano, Jeffrey E. Wieselthier and Muriel Medard, Eytan Modiano and Muriel Medard.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Diane J. Cook, Luke Whittington, Christian Wagner, James Dooley, Martin C. Henson, Steve Reeves, Guang-Bin Huang, Daniyal M. Alghazzawi, Hani Hagras, Dongrui Wu, Aysenur Bilgin, Robin Milner, Mohammed J. Alhaddad, Victor Callaghan\n- Research collaborations between these authors: Diane J. Cook and Hani Hagras, Diane J. Cook and Victor Callaghan, Diane J. Cook and James Dooley, Diane J. Cook and Martin C. Henson, Luke Whittington and Hani Hagras, Luke Whittington and James Dooley, Luke Whittington and Martin C. Henson, Luke Whittington and Christian Wagner, Luke Whittington and Robin Milner, Christian Wagner and Hani Hagras, Christian Wagner and Mohammed J. Alhaddad, Christian Wagner and Dongrui Wu, Christian Wagner and Victor Callaghan, Christian Wagner and Daniyal M. Alghazzawi, Christian Wagner and James Dooley, Christian Wagner and Martin C. Henson, Christian Wagner and Aysenur Bilgin, James Dooley and Hani Hagras, James Dooley and Mohammed J. Alhaddad, James Dooley and Victor Callaghan, James Dooley and Daniyal M. Alghazzawi, James Dooley and Martin C. Henson, James Dooley and Robin Milner, James Dooley and Aysenur Bilgin, Martin C. Henson and Steve Reeves, Martin C. Henson and Hani Hagras, Martin C. Henson and Mohammed J. Alhaddad, Martin C. Henson and Victor Callaghan, Martin C. Henson and Daniyal M. Alghazzawi, Martin C. Henson and Robin Milner, Daniyal M. Alghazzawi and Hani Hagras, Daniyal M. Alghazzawi and Mohammed J. Alhaddad, Daniyal M. Alghazzawi and Victor Callaghan, Daniyal M. Alghazzawi and Dongrui Wu, Daniyal M. Alghazzawi and Aysenur Bilgin, Hani Hagras and Mohammed J. Alhaddad, Hani Hagras and Dongrui Wu, Hani Hagras and Victor Callaghan, Hani Hagras and Aysenur Bilgin, Dongrui Wu and Mohammed J. Alhaddad, Dongrui Wu and Victor Callaghan, Dongrui Wu and Aysenur Bilgin, Aysenur Bilgin and Mohammed J. Alhaddad, Aysenur Bilgin and Victor Callaghan, Mohammed J. Alhaddad and Victor Callaghan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Diane J. Cook\", \"id\": 12448}, {\"name\": \"Luke Whittington\", \"id\": 167937}, {\"name\": \"Victor Callaghan\", \"id\": 86175}, {\"name\": \"Christian Wagner\", \"id\": 49635}, {\"name\": \"James Dooley\", \"id\": 109769}, {\"name\": \"Martin C. Henson\", \"id\": 109770}, {\"name\": \"Steve Reeves\", \"id\": 9646}, {\"name\": \"Guang-Bin Huang\", \"id\": 21456}, {\"name\": \"Daniyal M. Alghazzawi\", \"id\": 94706}, {\"name\": \"Hani Hagras\", \"id\": 20437}, {\"name\": \"Aysenur Bilgin\", \"id\": 464799}, {\"name\": \"Robin Milner\", \"id\": 249019}, {\"name\": \"Mohammed J. Alhaddad\", \"id\": 26014}, {\"name\": \"Dongrui Wu\", \"id\": 78687}], \"links\": [{\"source\": 12448, \"target\": 20437}, {\"source\": 12448, \"target\": 86175}, {\"source\": 12448, \"target\": 109769}, {\"source\": 12448, \"target\": 109770}, {\"source\": 167937, \"target\": 20437}, {\"source\": 167937, \"target\": 109769}, {\"source\": 167937, \"target\": 109770}, {\"source\": 167937, \"target\": 49635}, {\"source\": 167937, \"target\": 249019}, {\"source\": 86175, \"target\": 20437}, {\"source\": 86175, \"target\": 26014}, {\"source\": 86175, \"target\": 49635}, {\"source\": 86175, \"target\": 78687}, {\"source\": 86175, \"target\": 94706}, {\"source\": 86175, \"target\": 109769}, {\"source\": 86175, \"target\": 109770}, {\"source\": 86175, \"target\": 464799}, {\"source\": 49635, \"target\": 20437}, {\"source\": 49635, \"target\": 26014}, {\"source\": 49635, \"target\": 78687}, {\"source\": 49635, \"target\": 94706}, {\"source\": 49635, \"target\": 109769}, {\"source\": 49635, \"target\": 109770}, {\"source\": 49635, \"target\": 464799}, {\"source\": 109769, \"target\": 20437}, {\"source\": 109769, \"target\": 26014}, {\"source\": 109769, \"target\": 94706}, {\"source\": 109769, \"target\": 109770}, {\"source\": 109769, \"target\": 249019}, {\"source\": 109769, \"target\": 464799}, {\"source\": 109770, \"target\": 9646}, {\"source\": 109770, \"target\": 20437}, {\"source\": 109770, \"target\": 26014}, {\"source\": 109770, \"target\": 94706}, {\"source\": 109770, \"target\": 249019}, {\"source\": 94706, \"target\": 20437}, {\"source\": 94706, \"target\": 26014}, {\"source\": 94706, \"target\": 78687}, {\"source\": 94706, \"target\": 464799}, {\"source\": 20437, \"target\": 26014}, {\"source\": 20437, \"target\": 78687}, {\"source\": 20437, \"target\": 464799}, {\"source\": 464799, \"target\": 26014}, {\"source\": 464799, \"target\": 78687}, {\"source\": 26014, \"target\": 78687}]}",
"id": 323,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Diane J. Cook, Luke Whittington, Christian Wagner, James Dooley, Martin C. Henson, Steve Reeves, Guang-Bin Huang, Daniyal M. Alghazzawi, Hani Hagras, Dongrui Wu, Aysenur Bilgin, Robin Milner, Mohammed J. Alhaddad, Victor Callaghan\n- Research collaborations between these authors: Diane J. Cook and Hani Hagras, Diane J. Cook and Victor Callaghan, Diane J. Cook and James Dooley, Diane J. Cook and Martin C. Henson, Luke Whittington and Hani Hagras, Luke Whittington and James Dooley, Luke Whittington and Martin C. Henson, Luke Whittington and Christian Wagner, Luke Whittington and Robin Milner, Christian Wagner and Hani Hagras, Christian Wagner and Mohammed J. Alhaddad, Christian Wagner and Dongrui Wu, Christian Wagner and Victor Callaghan, Christian Wagner and Daniyal M. Alghazzawi, Christian Wagner and James Dooley, Christian Wagner and Martin C. Henson, Christian Wagner and Aysenur Bilgin, James Dooley and Hani Hagras, James Dooley and Mohammed J. Alhaddad, James Dooley and Victor Callaghan, James Dooley and Daniyal M. Alghazzawi, James Dooley and Martin C. Henson, James Dooley and Robin Milner, James Dooley and Aysenur Bilgin, Martin C. Henson and Steve Reeves, Martin C. Henson and Hani Hagras, Martin C. Henson and Mohammed J. Alhaddad, Martin C. Henson and Victor Callaghan, Martin C. Henson and Daniyal M. Alghazzawi, Martin C. Henson and Robin Milner, Daniyal M. Alghazzawi and Hani Hagras, Daniyal M. Alghazzawi and Mohammed J. Alhaddad, Daniyal M. Alghazzawi and Victor Callaghan, Daniyal M. Alghazzawi and Dongrui Wu, Daniyal M. Alghazzawi and Aysenur Bilgin, Hani Hagras and Mohammed J. Alhaddad, Hani Hagras and Dongrui Wu, Hani Hagras and Victor Callaghan, Hani Hagras and Aysenur Bilgin, Dongrui Wu and Mohammed J. Alhaddad, Dongrui Wu and Victor Callaghan, Dongrui Wu and Aysenur Bilgin, Aysenur Bilgin and Mohammed J. Alhaddad, Aysenur Bilgin and Victor Callaghan, Mohammed J. Alhaddad and Victor Callaghan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Lacey-Anne Sanderson, Kirstin E. Bett, Minoru Kanehisa, Jing Yu, Taein Lee, Chun-Huai Cheng, Sook Jung, Margaret Staton, Lukas A. Mueller, Stephen P. Ficklin, A. G. Abbott, Dorrie Main, Naama Menda, Seth Redmond\n- Research collaborations between these authors: Lacey-Anne Sanderson and Sook Jung, Lacey-Anne Sanderson and Stephen P. Ficklin, Lacey-Anne Sanderson and Dorrie Main, Kirstin E. Bett and Sook Jung, Kirstin E. Bett and Stephen P. Ficklin, Kirstin E. Bett and Dorrie Main, Minoru Kanehisa and Stephen P. Ficklin, Jing Yu and Sook Jung, Jing Yu and Dorrie Main, Jing Yu and Taein Lee, Taein Lee and Sook Jung, Taein Lee and Stephen P. Ficklin, Taein Lee and Dorrie Main, Taein Lee and Margaret Staton, Taein Lee and A. G. Abbott, Taein Lee and Lukas A. Mueller, Taein Lee and Seth Redmond, Taein Lee and Naama Menda, Taein Lee and Chun-Huai Cheng, Chun-Huai Cheng and Stephen P. Ficklin, Chun-Huai Cheng and Sook Jung, Chun-Huai Cheng and Dorrie Main, Chun-Huai Cheng and Lukas A. Mueller, Chun-Huai Cheng and Naama Menda, Sook Jung and Margaret Staton, Sook Jung and A. G. Abbott, Sook Jung and Dorrie Main, Sook Jung and Lukas A. Mueller, Sook Jung and Seth Redmond, Sook Jung and Naama Menda, Sook Jung and Stephen P. Ficklin, Margaret Staton and Dorrie Main, Lukas A. Mueller and Stephen P. Ficklin, Lukas A. Mueller and Dorrie Main, Lukas A. Mueller and Seth Redmond, Lukas A. Mueller and Naama Menda, Stephen P. Ficklin and Dorrie Main, Stephen P. Ficklin and Naama Menda, A. G. Abbott and Dorrie Main, Dorrie Main and Seth Redmond, Dorrie Main and Naama Menda.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Lacey-Anne Sanderson\", \"id\": 969408}, {\"name\": \"Kirstin E. Bett\", \"id\": 969409}, {\"name\": \"Minoru Kanehisa\", \"id\": 388642}, {\"name\": \"Jing Yu\", \"id\": 1797}, {\"name\": \"Taein Lee\", \"id\": 664231}, {\"name\": \"Chun-Huai Cheng\", \"id\": 664232}, {\"name\": \"Sook Jung\", \"id\": 427723}, {\"name\": \"Margaret Staton\", \"id\": 427725}, {\"name\": \"Lukas A. Mueller\", \"id\": 664238}, {\"name\": \"Stephen P. Ficklin\", \"id\": 427727}, {\"name\": \"A. G. Abbott\", \"id\": 427729}, {\"name\": \"Dorrie Main\", \"id\": 427731}, {\"name\": \"Naama Menda\", \"id\": 927390}, {\"name\": \"Seth Redmond\", \"id\": 890463}], \"links\": [{\"source\": 969408, \"target\": 427723}, {\"source\": 969408, \"target\": 427727}, {\"source\": 969408, \"target\": 427731}, {\"source\": 969409, \"target\": 427723}, {\"source\": 969409, \"target\": 427727}, {\"source\": 969409, \"target\": 427731}, {\"source\": 388642, \"target\": 427727}, {\"source\": 1797, \"target\": 427723}, {\"source\": 1797, \"target\": 427731}, {\"source\": 1797, \"target\": 664231}, {\"source\": 664231, \"target\": 427723}, {\"source\": 664231, \"target\": 427727}, {\"source\": 664231, \"target\": 427731}, {\"source\": 664231, \"target\": 427725}, {\"source\": 664231, \"target\": 427729}, {\"source\": 664231, \"target\": 664238}, {\"source\": 664231, \"target\": 890463}, {\"source\": 664231, \"target\": 927390}, {\"source\": 664231, \"target\": 664232}, {\"source\": 664232, \"target\": 427727}, {\"source\": 664232, \"target\": 427723}, {\"source\": 664232, \"target\": 427731}, {\"source\": 664232, \"target\": 664238}, {\"source\": 664232, \"target\": 927390}, {\"source\": 427723, \"target\": 427725}, {\"source\": 427723, \"target\": 427729}, {\"source\": 427723, \"target\": 427731}, {\"source\": 427723, \"target\": 664238}, {\"source\": 427723, \"target\": 890463}, {\"source\": 427723, \"target\": 927390}, {\"source\": 427723, \"target\": 427727}, {\"source\": 427725, \"target\": 427731}, {\"source\": 664238, \"target\": 427727}, {\"source\": 664238, \"target\": 427731}, {\"source\": 664238, \"target\": 890463}, {\"source\": 664238, \"target\": 927390}, {\"source\": 427727, \"target\": 427731}, {\"source\": 427727, \"target\": 927390}, {\"source\": 427729, \"target\": 427731}, {\"source\": 427731, \"target\": 890463}, {\"source\": 427731, \"target\": 927390}]}",
"id": 151,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Lacey-Anne Sanderson, Kirstin E. Bett, Minoru Kanehisa, Jing Yu, Taein Lee, Chun-Huai Cheng, Sook Jung, Margaret Staton, Lukas A. Mueller, Stephen P. Ficklin, A. G. Abbott, Dorrie Main, Naama Menda, Seth Redmond\n- Research collaborations between these authors: Lacey-Anne Sanderson and Sook Jung, Lacey-Anne Sanderson and Stephen P. Ficklin, Lacey-Anne Sanderson and Dorrie Main, Kirstin E. Bett and Sook Jung, Kirstin E. Bett and Stephen P. Ficklin, Kirstin E. Bett and Dorrie Main, Minoru Kanehisa and Stephen P. Ficklin, Jing Yu and Sook Jung, Jing Yu and Dorrie Main, Jing Yu and Taein Lee, Taein Lee and Sook Jung, Taein Lee and Stephen P. Ficklin, Taein Lee and Dorrie Main, Taein Lee and Margaret Staton, Taein Lee and A. G. Abbott, Taein Lee and Lukas A. Mueller, Taein Lee and Seth Redmond, Taein Lee and Naama Menda, Taein Lee and Chun-Huai Cheng, Chun-Huai Cheng and Stephen P. Ficklin, Chun-Huai Cheng and Sook Jung, Chun-Huai Cheng and Dorrie Main, Chun-Huai Cheng and Lukas A. Mueller, Chun-Huai Cheng and Naama Menda, Sook Jung and Margaret Staton, Sook Jung and A. G. Abbott, Sook Jung and Dorrie Main, Sook Jung and Lukas A. Mueller, Sook Jung and Seth Redmond, Sook Jung and Naama Menda, Sook Jung and Stephen P. Ficklin, Margaret Staton and Dorrie Main, Lukas A. Mueller and Stephen P. Ficklin, Lukas A. Mueller and Dorrie Main, Lukas A. Mueller and Seth Redmond, Lukas A. Mueller and Naama Menda, Stephen P. Ficklin and Dorrie Main, Stephen P. Ficklin and Naama Menda, A. G. Abbott and Dorrie Main, Dorrie Main and Seth Redmond, Dorrie Main and Naama Menda.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hendrik Radke, Max Mühlhäuser, Martin Strecker, Gabriele Taentzer, Juan de Lara, Fernando Orejas, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann, Hans Jürgen Schneider, Claudia Ermel, Jochen Malte Küster, Detlef Plump, Hartmut Ehrig\n- Research collaborations between these authors: Hendrik Radke and Gabriele Taentzer, Hendrik Radke and Annegret Habel, Hendrik Radke and Karl-Heinz Pennemann, Max Mühlhäuser and Annegret Habel, Martin Strecker and Annegret Habel, Martin Strecker and Karl-Heinz Pennemann, Martin Strecker and Detlef Plump, Gabriele Taentzer and Fernando Orejas, Gabriele Taentzer and Juan de Lara, Gabriele Taentzer and Jochen Malte Küster, Gabriele Taentzer and Claudia Ermel, Gabriele Taentzer and Hartmut Ehrig, Gabriele Taentzer and Karsten Ehrig, Gabriele Taentzer and Annegret Habel, Gabriele Taentzer and Karl-Heinz Pennemann, Gabriele Taentzer and Detlef Plump, Juan de Lara and Fernando Orejas, Juan de Lara and Jochen Malte Küster, Juan de Lara and Claudia Ermel, Juan de Lara and Hartmut Ehrig, Juan de Lara and Karsten Ehrig, Juan de Lara and Annegret Habel, Juan de Lara and Karl-Heinz Pennemann, Fernando Orejas and Jochen Malte Küster, Fernando Orejas and Claudia Ermel, Fernando Orejas and Hartmut Ehrig, Fernando Orejas and Karsten Ehrig, Fernando Orejas and Annegret Habel, Fernando Orejas and Karl-Heinz Pennemann, Fernando Orejas and Detlef Plump, Karsten Ehrig and Jochen Malte Küster, Karsten Ehrig and Claudia Ermel, Karsten Ehrig and Hartmut Ehrig, Karsten Ehrig and Annegret Habel, Karsten Ehrig and Karl-Heinz Pennemann, Annegret Habel and Jochen Malte Küster, Annegret Habel and Claudia Ermel, Annegret Habel and Hartmut Ehrig, Annegret Habel and Karl-Heinz Pennemann, Annegret Habel and Detlef Plump, Annegret Habel and Hans Jürgen Schneider, Karl-Heinz Pennemann and Jochen Malte Küster, Karl-Heinz Pennemann and Claudia Ermel, Karl-Heinz Pennemann and Hartmut Ehrig, Karl-Heinz Pennemann and Detlef Plump, Claudia Ermel and Hartmut Ehrig, Claudia Ermel and Detlef Plump, Jochen Malte Küster and Hartmut Ehrig, Jochen Malte Küster and Detlef Plump, Detlef Plump and Hartmut Ehrig.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Hendrik Radke\", \"id\": 204161}, {\"name\": \"Max M\\u00fchlh\\u00e4user\", \"id\": 37410}, {\"name\": \"Martin Strecker\", \"id\": 25188}, {\"name\": \"Gabriele Taentzer\", \"id\": 39845}, {\"name\": \"Juan de Lara\", \"id\": 15465}, {\"name\": \"Fernando Orejas\", \"id\": 2478}, {\"name\": \"Karsten Ehrig\", \"id\": 73713}, {\"name\": \"Annegret Habel\", \"id\": 73714}, {\"name\": \"Karl-Heinz Pennemann\", \"id\": 73715}, {\"name\": \"Hans J\\u00fcrgen Schneider\", \"id\": 386259}, {\"name\": \"Claudia Ermel\", \"id\": 23537}, {\"name\": \"Jochen Malte K\\u00fcster\", \"id\": 18040}, {\"name\": \"Detlef Plump\", \"id\": 94073}, {\"name\": \"Hartmut Ehrig\", \"id\": 41661}], \"links\": [{\"source\": 204161, \"target\": 39845}, {\"source\": 204161, \"target\": 73714}, {\"source\": 204161, \"target\": 73715}, {\"source\": 37410, \"target\": 73714}, {\"source\": 25188, \"target\": 73714}, {\"source\": 25188, \"target\": 73715}, {\"source\": 25188, \"target\": 94073}, {\"source\": 39845, \"target\": 2478}, {\"source\": 39845, \"target\": 15465}, {\"source\": 39845, \"target\": 18040}, {\"source\": 39845, \"target\": 23537}, {\"source\": 39845, \"target\": 41661}, {\"source\": 39845, \"target\": 73713}, {\"source\": 39845, \"target\": 73714}, {\"source\": 39845, \"target\": 73715}, {\"source\": 39845, \"target\": 94073}, {\"source\": 15465, \"target\": 2478}, {\"source\": 15465, \"target\": 18040}, {\"source\": 15465, \"target\": 23537}, {\"source\": 15465, \"target\": 41661}, {\"source\": 15465, \"target\": 73713}, {\"source\": 15465, \"target\": 73714}, {\"source\": 15465, \"target\": 73715}, {\"source\": 2478, \"target\": 18040}, {\"source\": 2478, \"target\": 23537}, {\"source\": 2478, \"target\": 41661}, {\"source\": 2478, \"target\": 73713}, {\"source\": 2478, \"target\": 73714}, {\"source\": 2478, \"target\": 73715}, {\"source\": 2478, \"target\": 94073}, {\"source\": 73713, \"target\": 18040}, {\"source\": 73713, \"target\": 23537}, {\"source\": 73713, \"target\": 41661}, {\"source\": 73713, \"target\": 73714}, {\"source\": 73713, \"target\": 73715}, {\"source\": 73714, \"target\": 18040}, {\"source\": 73714, \"target\": 23537}, {\"source\": 73714, \"target\": 41661}, {\"source\": 73714, \"target\": 73715}, {\"source\": 73714, \"target\": 94073}, {\"source\": 73714, \"target\": 386259}, {\"source\": 73715, \"target\": 18040}, {\"source\": 73715, \"target\": 23537}, {\"source\": 73715, \"target\": 41661}, {\"source\": 73715, \"target\": 94073}, {\"source\": 23537, \"target\": 41661}, {\"source\": 23537, \"target\": 94073}, {\"source\": 18040, \"target\": 41661}, {\"source\": 18040, \"target\": 94073}, {\"source\": 94073, \"target\": 41661}]}",
"id": 904,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hendrik Radke, Max Mühlhäuser, Martin Strecker, Gabriele Taentzer, Juan de Lara, Fernando Orejas, Karsten Ehrig, Annegret Habel, Karl-Heinz Pennemann, Hans Jürgen Schneider, Claudia Ermel, Jochen Malte Küster, Detlef Plump, Hartmut Ehrig\n- Research collaborations between these authors: Hendrik Radke and Gabriele Taentzer, Hendrik Radke and Annegret Habel, Hendrik Radke and Karl-Heinz Pennemann, Max Mühlhäuser and Annegret Habel, Martin Strecker and Annegret Habel, Martin Strecker and Karl-Heinz Pennemann, Martin Strecker and Detlef Plump, Gabriele Taentzer and Fernando Orejas, Gabriele Taentzer and Juan de Lara, Gabriele Taentzer and Jochen Malte Küster, Gabriele Taentzer and Claudia Ermel, Gabriele Taentzer and Hartmut Ehrig, Gabriele Taentzer and Karsten Ehrig, Gabriele Taentzer and Annegret Habel, Gabriele Taentzer and Karl-Heinz Pennemann, Gabriele Taentzer and Detlef Plump, Juan de Lara and Fernando Orejas, Juan de Lara and Jochen Malte Küster, Juan de Lara and Claudia Ermel, Juan de Lara and Hartmut Ehrig, Juan de Lara and Karsten Ehrig, Juan de Lara and Annegret Habel, Juan de Lara and Karl-Heinz Pennemann, Fernando Orejas and Jochen Malte Küster, Fernando Orejas and Claudia Ermel, Fernando Orejas and Hartmut Ehrig, Fernando Orejas and Karsten Ehrig, Fernando Orejas and Annegret Habel, Fernando Orejas and Karl-Heinz Pennemann, Fernando Orejas and Detlef Plump, Karsten Ehrig and Jochen Malte Küster, Karsten Ehrig and Claudia Ermel, Karsten Ehrig and Hartmut Ehrig, Karsten Ehrig and Annegret Habel, Karsten Ehrig and Karl-Heinz Pennemann, Annegret Habel and Jochen Malte Küster, Annegret Habel and Claudia Ermel, Annegret Habel and Hartmut Ehrig, Annegret Habel and Karl-Heinz Pennemann, Annegret Habel and Detlef Plump, Annegret Habel and Hans Jürgen Schneider, Karl-Heinz Pennemann and Jochen Malte Küster, Karl-Heinz Pennemann and Claudia Ermel, Karl-Heinz Pennemann and Hartmut Ehrig, Karl-Heinz Pennemann and Detlef Plump, Claudia Ermel and Hartmut Ehrig, Claudia Ermel and Detlef Plump, Jochen Malte Küster and Hartmut Ehrig, Jochen Malte Küster and Detlef Plump, Detlef Plump and Hartmut Ehrig.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Stephen P. Boyd, Alain Sarlette, Johan U. Backstrom, Guy A. Dumont, Mohammed E. Ammar, Dimitry Gorinevsky, Junqiang Fan, J. Mark Ansermino, Bassam Bamieh, Munther A. Dahleh, Rodolphe Sepulchre, Gunter Stein, Michel Verhaegen, Gregory E. Stewart\n- Research collaborations between these authors: Stephen P. Boyd and Michel Verhaegen, Stephen P. Boyd and Dimitry Gorinevsky, Stephen P. Boyd and Gunter Stein, Stephen P. Boyd and Rodolphe Sepulchre, Stephen P. Boyd and Alain Sarlette, Stephen P. Boyd and Bassam Bamieh, Alain Sarlette and Rodolphe Sepulchre, Alain Sarlette and Bassam Bamieh, Alain Sarlette and Dimitry Gorinevsky, Johan U. Backstrom and Guy A. Dumont, Johan U. Backstrom and Dimitry Gorinevsky, Johan U. Backstrom and Gregory E. Stewart, Guy A. Dumont and Michel Verhaegen, Guy A. Dumont and Munther A. Dahleh, Guy A. Dumont and Bassam Bamieh, Guy A. Dumont and Dimitry Gorinevsky, Guy A. Dumont and J. Mark Ansermino, Guy A. Dumont and Gregory E. Stewart, Guy A. Dumont and Mohammed E. Ammar, Mohammed E. Ammar and Dimitry Gorinevsky, Mohammed E. Ammar and Gregory E. Stewart, Mohammed E. Ammar and Junqiang Fan, Dimitry Gorinevsky and Michel Verhaegen, Dimitry Gorinevsky and Rodolphe Sepulchre, Dimitry Gorinevsky and Munther A. Dahleh, Dimitry Gorinevsky and Bassam Bamieh, Dimitry Gorinevsky and Gregory E. Stewart, Dimitry Gorinevsky and Gunter Stein, Dimitry Gorinevsky and Junqiang Fan, Bassam Bamieh and Michel Verhaegen, Bassam Bamieh and Munther A. Dahleh, Munther A. Dahleh and Michel Verhaegen, Michel Verhaegen and Gregory E. Stewart.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Stephen P. Boyd\", \"id\": 126112}, {\"name\": \"Alain Sarlette\", \"id\": 202529}, {\"name\": \"Johan U. Backstrom\", \"id\": 288324}, {\"name\": \"Guy A. Dumont\", \"id\": 184650}, {\"name\": \"Mohammed E. Ammar\", \"id\": 321804}, {\"name\": \"Dimitry Gorinevsky\", \"id\": 279886}, {\"name\": \"Bassam Bamieh\", \"id\": 248334}, {\"name\": \"J. Mark Ansermino\", \"id\": 474960}, {\"name\": \"Munther A. Dahleh\", \"id\": 169854}, {\"name\": \"Gregory E. Stewart\", \"id\": 586718}, {\"name\": \"Rodolphe Sepulchre\", \"id\": 158201}, {\"name\": \"Gunter Stein\", \"id\": 776124}, {\"name\": \"Michel Verhaegen\", \"id\": 41501}, {\"name\": \"Junqiang Fan\", \"id\": 717566}], \"links\": [{\"source\": 126112, \"target\": 41501}, {\"source\": 126112, \"target\": 279886}, {\"source\": 126112, \"target\": 776124}, {\"source\": 126112, \"target\": 158201}, {\"source\": 126112, \"target\": 202529}, {\"source\": 126112, \"target\": 248334}, {\"source\": 202529, \"target\": 158201}, {\"source\": 202529, \"target\": 248334}, {\"source\": 202529, \"target\": 279886}, {\"source\": 288324, \"target\": 184650}, {\"source\": 288324, \"target\": 279886}, {\"source\": 288324, \"target\": 586718}, {\"source\": 184650, \"target\": 41501}, {\"source\": 184650, \"target\": 169854}, {\"source\": 184650, \"target\": 248334}, {\"source\": 184650, \"target\": 279886}, {\"source\": 184650, \"target\": 474960}, {\"source\": 184650, \"target\": 586718}, {\"source\": 184650, \"target\": 321804}, {\"source\": 321804, \"target\": 279886}, {\"source\": 321804, \"target\": 586718}, {\"source\": 321804, \"target\": 717566}, {\"source\": 279886, \"target\": 41501}, {\"source\": 279886, \"target\": 158201}, {\"source\": 279886, \"target\": 169854}, {\"source\": 279886, \"target\": 248334}, {\"source\": 279886, \"target\": 586718}, {\"source\": 279886, \"target\": 776124}, {\"source\": 279886, \"target\": 717566}, {\"source\": 248334, \"target\": 41501}, {\"source\": 248334, \"target\": 169854}, {\"source\": 169854, \"target\": 41501}, {\"source\": 586718, \"target\": 41501}]}",
"id": 707,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Stephen P. Boyd, Alain Sarlette, Johan U. Backstrom, Guy A. Dumont, Mohammed E. Ammar, Dimitry Gorinevsky, Junqiang Fan, J. Mark Ansermino, Bassam Bamieh, Munther A. Dahleh, Rodolphe Sepulchre, Gunter Stein, Michel Verhaegen, Gregory E. Stewart\n- Research collaborations between these authors: Stephen P. Boyd and Michel Verhaegen, Stephen P. Boyd and Dimitry Gorinevsky, Stephen P. Boyd and Gunter Stein, Stephen P. Boyd and Rodolphe Sepulchre, Stephen P. Boyd and Alain Sarlette, Stephen P. Boyd and Bassam Bamieh, Alain Sarlette and Rodolphe Sepulchre, Alain Sarlette and Bassam Bamieh, Alain Sarlette and Dimitry Gorinevsky, Johan U. Backstrom and Guy A. Dumont, Johan U. Backstrom and Dimitry Gorinevsky, Johan U. Backstrom and Gregory E. Stewart, Guy A. Dumont and Michel Verhaegen, Guy A. Dumont and Munther A. Dahleh, Guy A. Dumont and Bassam Bamieh, Guy A. Dumont and Dimitry Gorinevsky, Guy A. Dumont and J. Mark Ansermino, Guy A. Dumont and Gregory E. Stewart, Guy A. Dumont and Mohammed E. Ammar, Mohammed E. Ammar and Dimitry Gorinevsky, Mohammed E. Ammar and Gregory E. Stewart, Mohammed E. Ammar and Junqiang Fan, Dimitry Gorinevsky and Michel Verhaegen, Dimitry Gorinevsky and Rodolphe Sepulchre, Dimitry Gorinevsky and Munther A. Dahleh, Dimitry Gorinevsky and Bassam Bamieh, Dimitry Gorinevsky and Gregory E. Stewart, Dimitry Gorinevsky and Gunter Stein, Dimitry Gorinevsky and Junqiang Fan, Bassam Bamieh and Michel Verhaegen, Bassam Bamieh and Munther A. Dahleh, Munther A. Dahleh and Michel Verhaegen, Michel Verhaegen and Gregory E. Stewart.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Johanna Geiß, Stefan Hagedorn, Thomas Neumann, Katja Hose, Hanan Samet, Roser Saurí, Christian Bizer, Kevin Wilkinson, Kai-Uwe Sattler, Michael Gertz, Marc Verhagen, Jannik Strötgen, Susanne E. Hambrusch, Andreas Spitz\n- Research collaborations between these authors: Johanna Geiß and Michael Gertz, Johanna Geiß and Andreas Spitz, Johanna Geiß and Jannik Strötgen, Stefan Hagedorn and Kai-Uwe Sattler, Stefan Hagedorn and Michael Gertz, Stefan Hagedorn and Jannik Strötgen, Stefan Hagedorn and Thomas Neumann, Stefan Hagedorn and Katja Hose, Stefan Hagedorn and Andreas Spitz, Thomas Neumann and Kai-Uwe Sattler, Thomas Neumann and Christian Bizer, Thomas Neumann and Kevin Wilkinson, Thomas Neumann and Katja Hose, Katja Hose and Kai-Uwe Sattler, Katja Hose and Christian Bizer, Katja Hose and Kevin Wilkinson, Hanan Samet and Michael Gertz, Hanan Samet and Jannik Strötgen, Roser Saurí and Michael Gertz, Roser Saurí and Jannik Strötgen, Roser Saurí and Marc Verhagen, Christian Bizer and Kai-Uwe Sattler, Kai-Uwe Sattler and Michael Gertz, Kai-Uwe Sattler and Jannik Strötgen, Kai-Uwe Sattler and Andreas Spitz, Michael Gertz and Jannik Strötgen, Michael Gertz and Marc Verhagen, Michael Gertz and Susanne E. Hambrusch, Michael Gertz and Andreas Spitz, Marc Verhagen and Jannik Strötgen, Jannik Strötgen and Andreas Spitz.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Johanna Gei\\u00df\", \"id\": 1176098}, {\"name\": \"Stefan Hagedorn\", \"id\": 97507}, {\"name\": \"Thomas Neumann\", \"id\": 37957}, {\"name\": \"Katja Hose\", \"id\": 77158}, {\"name\": \"Hanan Samet\", \"id\": 69863}, {\"name\": \"Roser Saur\\u00ed\", \"id\": 38151}, {\"name\": \"Christian Bizer\", \"id\": 2954}, {\"name\": \"Kevin Wilkinson\", \"id\": 36848}, {\"name\": \"Kai-Uwe Sattler\", \"id\": 12434}, {\"name\": \"Michael Gertz\", \"id\": 24179}, {\"name\": \"Marc Verhagen\", \"id\": 106613}, {\"name\": \"Jannik Str\\u00f6tgen\", \"id\": 37464}, {\"name\": \"Susanne E. Hambrusch\", \"id\": 133723}, {\"name\": \"Andreas Spitz\", \"id\": 1021944}], \"links\": [{\"source\": 1176098, \"target\": 24179}, {\"source\": 1176098, \"target\": 1021944}, {\"source\": 1176098, \"target\": 37464}, {\"source\": 97507, \"target\": 12434}, {\"source\": 97507, \"target\": 24179}, {\"source\": 97507, \"target\": 37464}, {\"source\": 97507, \"target\": 37957}, {\"source\": 97507, \"target\": 77158}, {\"source\": 97507, \"target\": 1021944}, {\"source\": 37957, \"target\": 12434}, {\"source\": 37957, \"target\": 2954}, {\"source\": 37957, \"target\": 36848}, {\"source\": 37957, \"target\": 77158}, {\"source\": 77158, \"target\": 12434}, {\"source\": 77158, \"target\": 2954}, {\"source\": 77158, \"target\": 36848}, {\"source\": 69863, \"target\": 24179}, {\"source\": 69863, \"target\": 37464}, {\"source\": 38151, \"target\": 24179}, {\"source\": 38151, \"target\": 37464}, {\"source\": 38151, \"target\": 106613}, {\"source\": 2954, \"target\": 12434}, {\"source\": 12434, \"target\": 24179}, {\"source\": 12434, \"target\": 37464}, {\"source\": 12434, \"target\": 1021944}, {\"source\": 24179, \"target\": 37464}, {\"source\": 24179, \"target\": 106613}, {\"source\": 24179, \"target\": 133723}, {\"source\": 24179, \"target\": 1021944}, {\"source\": 106613, \"target\": 37464}, {\"source\": 37464, \"target\": 1021944}]}",
"id": 1203,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Johanna Geiß, Stefan Hagedorn, Thomas Neumann, Katja Hose, Hanan Samet, Roser Saurí, Christian Bizer, Kevin Wilkinson, Kai-Uwe Sattler, Michael Gertz, Marc Verhagen, Jannik Strötgen, Susanne E. Hambrusch, Andreas Spitz\n- Research collaborations between these authors: Johanna Geiß and Michael Gertz, Johanna Geiß and Andreas Spitz, Johanna Geiß and Jannik Strötgen, Stefan Hagedorn and Kai-Uwe Sattler, Stefan Hagedorn and Michael Gertz, Stefan Hagedorn and Jannik Strötgen, Stefan Hagedorn and Thomas Neumann, Stefan Hagedorn and Katja Hose, Stefan Hagedorn and Andreas Spitz, Thomas Neumann and Kai-Uwe Sattler, Thomas Neumann and Christian Bizer, Thomas Neumann and Kevin Wilkinson, Thomas Neumann and Katja Hose, Katja Hose and Kai-Uwe Sattler, Katja Hose and Christian Bizer, Katja Hose and Kevin Wilkinson, Hanan Samet and Michael Gertz, Hanan Samet and Jannik Strötgen, Roser Saurí and Michael Gertz, Roser Saurí and Jannik Strötgen, Roser Saurí and Marc Verhagen, Christian Bizer and Kai-Uwe Sattler, Kai-Uwe Sattler and Michael Gertz, Kai-Uwe Sattler and Jannik Strötgen, Kai-Uwe Sattler and Andreas Spitz, Michael Gertz and Jannik Strötgen, Michael Gertz and Marc Verhagen, Michael Gertz and Susanne E. Hambrusch, Michael Gertz and Andreas Spitz, Marc Verhagen and Jannik Strötgen, Jannik Strötgen and Andreas Spitz.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Daming Shi, Minh Nhut Nguyen, Hesam Sagha, Michel Pasquier, Gerhard Tröster, Daniel Roggen, Paul Lukowicz, Alberto Calatroni, Chai Quek, Geok See Ng, Whye Loon Tung, José del R. Millán, Junbin Gao, Kai Keng Ang\n- Research collaborations between these authors: Daming Shi and Chai Quek, Daming Shi and Minh Nhut Nguyen, Daming Shi and Junbin Gao, Daming Shi and Michel Pasquier, Daming Shi and Whye Loon Tung, Daming Shi and Kai Keng Ang, Daming Shi and Geok See Ng, Minh Nhut Nguyen and Chai Quek, Minh Nhut Nguyen and Paul Lukowicz, Minh Nhut Nguyen and Gerhard Tröster, Minh Nhut Nguyen and Daniel Roggen, Minh Nhut Nguyen and Junbin Gao, Minh Nhut Nguyen and Alberto Calatroni, Minh Nhut Nguyen and Michel Pasquier, Minh Nhut Nguyen and Whye Loon Tung, Minh Nhut Nguyen and Kai Keng Ang, Minh Nhut Nguyen and José del R. Millán, Minh Nhut Nguyen and Geok See Ng, Minh Nhut Nguyen and Hesam Sagha, Hesam Sagha and Paul Lukowicz, Hesam Sagha and Gerhard Tröster, Hesam Sagha and Daniel Roggen, Hesam Sagha and Alberto Calatroni, Hesam Sagha and José del R. Millán, Michel Pasquier and Chai Quek, Michel Pasquier and Whye Loon Tung, Michel Pasquier and Kai Keng Ang, Michel Pasquier and Geok See Ng, Gerhard Tröster and Paul Lukowicz, Gerhard Tröster and Daniel Roggen, Gerhard Tröster and Alberto Calatroni, Gerhard Tröster and José del R. Millán, Daniel Roggen and Paul Lukowicz, Daniel Roggen and Alberto Calatroni, Daniel Roggen and José del R. Millán, Paul Lukowicz and Alberto Calatroni, Paul Lukowicz and José del R. Millán, Alberto Calatroni and José del R. Millán, Chai Quek and Whye Loon Tung, Chai Quek and Kai Keng Ang, Chai Quek and Geok See Ng, Geok See Ng and Whye Loon Tung, Geok See Ng and Kai Keng Ang, Whye Loon Tung and Kai Keng Ang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Daming Shi\", \"id\": 103777}, {\"name\": \"Hesam Sagha\", \"id\": 561155}, {\"name\": \"Minh Nhut Nguyen\", \"id\": 113475}, {\"name\": \"Geok See Ng\", \"id\": 340440}, {\"name\": \"Gerhard Tr\\u00f6ster\", \"id\": 107400}, {\"name\": \"Daniel Roggen\", \"id\": 109705}, {\"name\": \"Paul Lukowicz\", \"id\": 67530}, {\"name\": \"Alberto Calatroni\", \"id\": 123016}, {\"name\": \"Chai Quek\", \"id\": 109809}, {\"name\": \"Michel Pasquier\", \"id\": 240024}, {\"name\": \"Whye Loon Tung\", \"id\": 240025}, {\"name\": \"Jos\\u00e9 del R. Mill\\u00e1n\", \"id\": 254458}, {\"name\": \"Junbin Gao\", \"id\": 114203}, {\"name\": \"Kai Keng Ang\", \"id\": 252031}], \"links\": [{\"source\": 103777, \"target\": 109809}, {\"source\": 103777, \"target\": 113475}, {\"source\": 103777, \"target\": 114203}, {\"source\": 103777, \"target\": 240024}, {\"source\": 103777, \"target\": 240025}, {\"source\": 103777, \"target\": 252031}, {\"source\": 103777, \"target\": 340440}, {\"source\": 561155, \"target\": 67530}, {\"source\": 561155, \"target\": 107400}, {\"source\": 561155, \"target\": 109705}, {\"source\": 561155, \"target\": 113475}, {\"source\": 561155, \"target\": 123016}, {\"source\": 561155, \"target\": 254458}, {\"source\": 113475, \"target\": 109809}, {\"source\": 113475, \"target\": 67530}, {\"source\": 113475, \"target\": 107400}, {\"source\": 113475, \"target\": 109705}, {\"source\": 113475, \"target\": 114203}, {\"source\": 113475, \"target\": 123016}, {\"source\": 113475, \"target\": 240024}, {\"source\": 113475, \"target\": 240025}, {\"source\": 113475, \"target\": 252031}, {\"source\": 113475, \"target\": 254458}, {\"source\": 113475, \"target\": 340440}, {\"source\": 340440, \"target\": 109809}, {\"source\": 340440, \"target\": 240024}, {\"source\": 340440, \"target\": 240025}, {\"source\": 340440, \"target\": 252031}, {\"source\": 107400, \"target\": 67530}, {\"source\": 107400, \"target\": 109705}, {\"source\": 107400, \"target\": 123016}, {\"source\": 107400, \"target\": 254458}, {\"source\": 109705, \"target\": 67530}, {\"source\": 109705, \"target\": 123016}, {\"source\": 109705, \"target\": 254458}, {\"source\": 67530, \"target\": 123016}, {\"source\": 67530, \"target\": 254458}, {\"source\": 123016, \"target\": 254458}, {\"source\": 109809, \"target\": 240024}, {\"source\": 109809, \"target\": 240025}, {\"source\": 109809, \"target\": 252031}, {\"source\": 240024, \"target\": 240025}, {\"source\": 240024, \"target\": 252031}, {\"source\": 240025, \"target\": 252031}]}",
"id": 612,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Daming Shi, Minh Nhut Nguyen, Hesam Sagha, Michel Pasquier, Gerhard Tröster, Daniel Roggen, Paul Lukowicz, Alberto Calatroni, Chai Quek, Geok See Ng, Whye Loon Tung, José del R. Millán, Junbin Gao, Kai Keng Ang\n- Research collaborations between these authors: Daming Shi and Chai Quek, Daming Shi and Minh Nhut Nguyen, Daming Shi and Junbin Gao, Daming Shi and Michel Pasquier, Daming Shi and Whye Loon Tung, Daming Shi and Kai Keng Ang, Daming Shi and Geok See Ng, Minh Nhut Nguyen and Chai Quek, Minh Nhut Nguyen and Paul Lukowicz, Minh Nhut Nguyen and Gerhard Tröster, Minh Nhut Nguyen and Daniel Roggen, Minh Nhut Nguyen and Junbin Gao, Minh Nhut Nguyen and Alberto Calatroni, Minh Nhut Nguyen and Michel Pasquier, Minh Nhut Nguyen and Whye Loon Tung, Minh Nhut Nguyen and Kai Keng Ang, Minh Nhut Nguyen and José del R. Millán, Minh Nhut Nguyen and Geok See Ng, Minh Nhut Nguyen and Hesam Sagha, Hesam Sagha and Paul Lukowicz, Hesam Sagha and Gerhard Tröster, Hesam Sagha and Daniel Roggen, Hesam Sagha and Alberto Calatroni, Hesam Sagha and José del R. Millán, Michel Pasquier and Chai Quek, Michel Pasquier and Whye Loon Tung, Michel Pasquier and Kai Keng Ang, Michel Pasquier and Geok See Ng, Gerhard Tröster and Paul Lukowicz, Gerhard Tröster and Daniel Roggen, Gerhard Tröster and Alberto Calatroni, Gerhard Tröster and José del R. Millán, Daniel Roggen and Paul Lukowicz, Daniel Roggen and Alberto Calatroni, Daniel Roggen and José del R. Millán, Paul Lukowicz and Alberto Calatroni, Paul Lukowicz and José del R. Millán, Alberto Calatroni and José del R. Millán, Chai Quek and Whye Loon Tung, Chai Quek and Kai Keng Ang, Chai Quek and Geok See Ng, Geok See Ng and Whye Loon Tung, Geok See Ng and Kai Keng Ang, Whye Loon Tung and Kai Keng Ang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Trevor Darrell, Jitendra Malik, Jia Deng, Ross B. Girshick, Sebastian Thrun, Ho Lee, Luc J. Van Gool, Andrew Zisserman, Ilya Sutskever, Shaoqing Ren, Spyridon Gidaris, Kaiming He, Jean Ponce, Karol Gregor\n- Research collaborations between these authors: Trevor Darrell and Luc J. Van Gool, Trevor Darrell and Jitendra Malik, Trevor Darrell and Sebastian Thrun, Trevor Darrell and Kaiming He, Trevor Darrell and Andrew Zisserman, Trevor Darrell and Ross B. Girshick, Trevor Darrell and Jia Deng, Trevor Darrell and Ilya Sutskever, Trevor Darrell and Jean Ponce, Trevor Darrell and Shaoqing Ren, Jitendra Malik and Luc J. Van Gool, Jitendra Malik and Kaiming He, Jitendra Malik and Andrew Zisserman, Jitendra Malik and Ross B. Girshick, Jitendra Malik and Jia Deng, Jitendra Malik and Ilya Sutskever, Jitendra Malik and Jean Ponce, Jitendra Malik and Shaoqing Ren, Jitendra Malik and Sebastian Thrun, Jia Deng and Luc J. Van Gool, Jia Deng and Kaiming He, Jia Deng and Andrew Zisserman, Jia Deng and Ross B. Girshick, Jia Deng and Ilya Sutskever, Jia Deng and Jean Ponce, Jia Deng and Shaoqing Ren, Ross B. Girshick and Luc J. Van Gool, Ross B. Girshick and Sebastian Thrun, Ross B. Girshick and Kaiming He, Ross B. Girshick and Andrew Zisserman, Ross B. Girshick and Ilya Sutskever, Ross B. Girshick and Jean Ponce, Ross B. Girshick and Shaoqing Ren, Ross B. Girshick and Spyridon Gidaris, Sebastian Thrun and Luc J. Van Gool, Sebastian Thrun and Jean Ponce, Luc J. Van Gool and Kaiming He, Luc J. Van Gool and Andrew Zisserman, Luc J. Van Gool and Ilya Sutskever, Luc J. Van Gool and Jean Ponce, Luc J. Van Gool and Shaoqing Ren, Andrew Zisserman and Kaiming He, Andrew Zisserman and Ilya Sutskever, Andrew Zisserman and Jean Ponce, Andrew Zisserman and Shaoqing Ren, Andrew Zisserman and Karol Gregor, Ilya Sutskever and Kaiming He, Ilya Sutskever and Karol Gregor, Ilya Sutskever and Shaoqing Ren, Shaoqing Ren and Kaiming He, Kaiming He and Jean Ponce, Jean Ponce and Karol Gregor.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Trevor Darrell\", \"id\": 40322}, {\"name\": \"Jitendra Malik\", \"id\": 32931}, {\"name\": \"Sebastian Thrun\", \"id\": 54500}, {\"name\": \"Ross B. Girshick\", \"id\": 63749}, {\"name\": \"Jia Deng\", \"id\": 71234}, {\"name\": \"Ho Lee\", \"id\": 119811}, {\"name\": \"Luc J. Van Gool\", \"id\": 7179}, {\"name\": \"Andrew Zisserman\", \"id\": 62508}, {\"name\": \"Ilya Sutskever\", \"id\": 76622}, {\"name\": \"Shaoqing Ren\", \"id\": 165040}, {\"name\": \"Spyridon Gidaris\", \"id\": 1254964}, {\"name\": \"Kaiming He\", \"id\": 61819}, {\"name\": \"Jean Ponce\", \"id\": 146268}, {\"name\": \"Karol Gregor\", \"id\": 185119}], \"links\": [{\"source\": 40322, \"target\": 7179}, {\"source\": 40322, \"target\": 32931}, {\"source\": 40322, \"target\": 54500}, {\"source\": 40322, \"target\": 61819}, {\"source\": 40322, \"target\": 62508}, {\"source\": 40322, \"target\": 63749}, {\"source\": 40322, \"target\": 71234}, {\"source\": 40322, \"target\": 76622}, {\"source\": 40322, \"target\": 146268}, {\"source\": 40322, \"target\": 165040}, {\"source\": 32931, \"target\": 7179}, {\"source\": 32931, \"target\": 61819}, {\"source\": 32931, \"target\": 62508}, {\"source\": 32931, \"target\": 63749}, {\"source\": 32931, \"target\": 71234}, {\"source\": 32931, \"target\": 76622}, {\"source\": 32931, \"target\": 146268}, {\"source\": 32931, \"target\": 165040}, {\"source\": 32931, \"target\": 54500}, {\"source\": 54500, \"target\": 7179}, {\"source\": 54500, \"target\": 63749}, {\"source\": 54500, \"target\": 146268}, {\"source\": 63749, \"target\": 7179}, {\"source\": 63749, \"target\": 61819}, {\"source\": 63749, \"target\": 62508}, {\"source\": 63749, \"target\": 71234}, {\"source\": 63749, \"target\": 76622}, {\"source\": 63749, \"target\": 146268}, {\"source\": 63749, \"target\": 165040}, {\"source\": 63749, \"target\": 1254964}, {\"source\": 71234, \"target\": 7179}, {\"source\": 71234, \"target\": 61819}, {\"source\": 71234, \"target\": 62508}, {\"source\": 71234, \"target\": 76622}, {\"source\": 71234, \"target\": 146268}, {\"source\": 71234, \"target\": 165040}, {\"source\": 7179, \"target\": 61819}, {\"source\": 7179, \"target\": 62508}, {\"source\": 7179, \"target\": 76622}, {\"source\": 7179, \"target\": 146268}, {\"source\": 7179, \"target\": 165040}, {\"source\": 62508, \"target\": 61819}, {\"source\": 62508, \"target\": 76622}, {\"source\": 62508, \"target\": 146268}, {\"source\": 62508, \"target\": 165040}, {\"source\": 62508, \"target\": 185119}, {\"source\": 76622, \"target\": 61819}, {\"source\": 76622, \"target\": 185119}, {\"source\": 76622, \"target\": 165040}, {\"source\": 165040, \"target\": 61819}, {\"source\": 61819, \"target\": 146268}, {\"source\": 146268, \"target\": 185119}]}",
"id": 1308,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Trevor Darrell, Jitendra Malik, Jia Deng, Ross B. Girshick, Sebastian Thrun, Ho Lee, Luc J. Van Gool, Andrew Zisserman, Ilya Sutskever, Shaoqing Ren, Spyridon Gidaris, Kaiming He, Jean Ponce, Karol Gregor\n- Research collaborations between these authors: Trevor Darrell and Luc J. Van Gool, Trevor Darrell and Jitendra Malik, Trevor Darrell and Sebastian Thrun, Trevor Darrell and Kaiming He, Trevor Darrell and Andrew Zisserman, Trevor Darrell and Ross B. Girshick, Trevor Darrell and Jia Deng, Trevor Darrell and Ilya Sutskever, Trevor Darrell and Jean Ponce, Trevor Darrell and Shaoqing Ren, Jitendra Malik and Luc J. Van Gool, Jitendra Malik and Kaiming He, Jitendra Malik and Andrew Zisserman, Jitendra Malik and Ross B. Girshick, Jitendra Malik and Jia Deng, Jitendra Malik and Ilya Sutskever, Jitendra Malik and Jean Ponce, Jitendra Malik and Shaoqing Ren, Jitendra Malik and Sebastian Thrun, Jia Deng and Luc J. Van Gool, Jia Deng and Kaiming He, Jia Deng and Andrew Zisserman, Jia Deng and Ross B. Girshick, Jia Deng and Ilya Sutskever, Jia Deng and Jean Ponce, Jia Deng and Shaoqing Ren, Ross B. Girshick and Luc J. Van Gool, Ross B. Girshick and Sebastian Thrun, Ross B. Girshick and Kaiming He, Ross B. Girshick and Andrew Zisserman, Ross B. Girshick and Ilya Sutskever, Ross B. Girshick and Jean Ponce, Ross B. Girshick and Shaoqing Ren, Ross B. Girshick and Spyridon Gidaris, Sebastian Thrun and Luc J. Van Gool, Sebastian Thrun and Jean Ponce, Luc J. Van Gool and Kaiming He, Luc J. Van Gool and Andrew Zisserman, Luc J. Van Gool and Ilya Sutskever, Luc J. Van Gool and Jean Ponce, Luc J. Van Gool and Shaoqing Ren, Andrew Zisserman and Kaiming He, Andrew Zisserman and Ilya Sutskever, Andrew Zisserman and Jean Ponce, Andrew Zisserman and Shaoqing Ren, Andrew Zisserman and Karol Gregor, Ilya Sutskever and Kaiming He, Ilya Sutskever and Karol Gregor, Ilya Sutskever and Shaoqing Ren, Shaoqing Ren and Kaiming He, Kaiming He and Jean Ponce, Jean Ponce and Karol Gregor.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: R. Srikant, Ness B. Shroff, Ratul Mahajan, Fan Qiu, Lijun Chen, Steven H. Low, Mung Chiang, Rayadurgam Srikant, Baochun Li, Atilla Eryilmaz, Klara Nahrstedt, Venkata N. Padmanabhan, John C. Doyle, Yuan Xue\n- Research collaborations between these authors: R. Srikant and Ness B. Shroff, R. Srikant and Mung Chiang, R. Srikant and Yuan Xue, R. Srikant and Rayadurgam Srikant, R. Srikant and Atilla Eryilmaz, R. Srikant and John C. Doyle, R. Srikant and Steven H. Low, R. Srikant and Fan Qiu, Ness B. Shroff and Ratul Mahajan, Ness B. Shroff and Klara Nahrstedt, Ness B. Shroff and Baochun Li, Ness B. Shroff and Mung Chiang, Ness B. Shroff and Yuan Xue, Ness B. Shroff and Rayadurgam Srikant, Ness B. Shroff and Lijun Chen, Ness B. Shroff and Atilla Eryilmaz, Ness B. Shroff and John C. Doyle, Ness B. Shroff and Venkata N. Padmanabhan, Ness B. Shroff and Steven H. Low, Ness B. Shroff and Fan Qiu, Ratul Mahajan and Venkata N. Padmanabhan, Ratul Mahajan and Baochun Li, Ratul Mahajan and Mung Chiang, Ratul Mahajan and John C. Doyle, Fan Qiu and Klara Nahrstedt, Fan Qiu and Baochun Li, Fan Qiu and Mung Chiang, Fan Qiu and Yuan Xue, Fan Qiu and Rayadurgam Srikant, Fan Qiu and Lijun Chen, Fan Qiu and Atilla Eryilmaz, Fan Qiu and John C. Doyle, Fan Qiu and Venkata N. Padmanabhan, Fan Qiu and Steven H. Low, Lijun Chen and Mung Chiang, Lijun Chen and Yuan Xue, Lijun Chen and Baochun Li, Lijun Chen and Rayadurgam Srikant, Lijun Chen and John C. Doyle, Lijun Chen and Steven H. Low, Lijun Chen and Atilla Eryilmaz, Steven H. Low and Baochun Li, Steven H. Low and Mung Chiang, Steven H. Low and Yuan Xue, Steven H. Low and Rayadurgam Srikant, Steven H. Low and Atilla Eryilmaz, Steven H. Low and John C. Doyle, Mung Chiang and Baochun Li, Mung Chiang and Rayadurgam Srikant, Mung Chiang and Atilla Eryilmaz, Mung Chiang and John C. Doyle, Mung Chiang and Venkata N. Padmanabhan, Mung Chiang and Yuan Xue, Rayadurgam Srikant and Baochun Li, Rayadurgam Srikant and Yuan Xue, Rayadurgam Srikant and Atilla Eryilmaz, Rayadurgam Srikant and John C. Doyle, Baochun Li and Klara Nahrstedt, Baochun Li and Yuan Xue, Baochun Li and John C. Doyle, Baochun Li and Venkata N. Padmanabhan, Atilla Eryilmaz and Yuan Xue, Atilla Eryilmaz and John C. Doyle, Klara Nahrstedt and Yuan Xue, Klara Nahrstedt and Venkata N. Padmanabhan, Venkata N. Padmanabhan and Yuan Xue, John C. Doyle and Yuan Xue.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"R. Srikant\", \"id\": 257475}, {\"name\": \"Ness B. Shroff\", \"id\": 9126}, {\"name\": \"Fan Qiu\", \"id\": 486761}, {\"name\": \"Lijun Chen\", \"id\": 221418}, {\"name\": \"Steven H. Low\", \"id\": 339849}, {\"name\": \"Mung Chiang\", \"id\": 76176}, {\"name\": \"Rayadurgam Srikant\", \"id\": 170512}, {\"name\": \"Baochun Li\", \"id\": 44210}, {\"name\": \"John C. Doyle\", \"id\": 253949}, {\"name\": \"Yuan Xue\", \"id\": 84958}, {\"name\": \"Klara Nahrstedt\", \"id\": 15578}, {\"name\": \"Venkata N. Padmanabhan\", \"id\": 274683}, {\"name\": \"Ratul Mahajan\", \"id\": 11933}, {\"name\": \"Atilla Eryilmaz\", \"id\": 224158}], \"links\": [{\"source\": 257475, \"target\": 9126}, {\"source\": 257475, \"target\": 76176}, {\"source\": 257475, \"target\": 84958}, {\"source\": 257475, \"target\": 170512}, {\"source\": 257475, \"target\": 224158}, {\"source\": 257475, \"target\": 253949}, {\"source\": 257475, \"target\": 339849}, {\"source\": 257475, \"target\": 486761}, {\"source\": 9126, \"target\": 11933}, {\"source\": 9126, \"target\": 15578}, {\"source\": 9126, \"target\": 44210}, {\"source\": 9126, \"target\": 76176}, {\"source\": 9126, \"target\": 84958}, {\"source\": 9126, \"target\": 170512}, {\"source\": 9126, \"target\": 221418}, {\"source\": 9126, \"target\": 224158}, {\"source\": 9126, \"target\": 253949}, {\"source\": 9126, \"target\": 274683}, {\"source\": 9126, \"target\": 339849}, {\"source\": 9126, \"target\": 486761}, {\"source\": 486761, \"target\": 15578}, {\"source\": 486761, \"target\": 44210}, {\"source\": 486761, \"target\": 76176}, {\"source\": 486761, \"target\": 84958}, {\"source\": 486761, \"target\": 170512}, {\"source\": 486761, \"target\": 221418}, {\"source\": 486761, \"target\": 224158}, {\"source\": 486761, \"target\": 253949}, {\"source\": 486761, \"target\": 274683}, {\"source\": 486761, \"target\": 339849}, {\"source\": 221418, \"target\": 76176}, {\"source\": 221418, \"target\": 84958}, {\"source\": 221418, \"target\": 44210}, {\"source\": 221418, \"target\": 170512}, {\"source\": 221418, \"target\": 253949}, {\"source\": 221418, \"target\": 339849}, {\"source\": 221418, \"target\": 224158}, {\"source\": 339849, \"target\": 44210}, {\"source\": 339849, \"target\": 76176}, {\"source\": 339849, \"target\": 84958}, {\"source\": 339849, \"target\": 170512}, {\"source\": 339849, \"target\": 224158}, {\"source\": 339849, \"target\": 253949}, {\"source\": 76176, \"target\": 44210}, {\"source\": 76176, \"target\": 11933}, {\"source\": 76176, \"target\": 170512}, {\"source\": 76176, \"target\": 224158}, {\"source\": 76176, \"target\": 253949}, {\"source\": 76176, \"target\": 274683}, {\"source\": 76176, \"target\": 84958}, {\"source\": 170512, \"target\": 44210}, {\"source\": 170512, \"target\": 84958}, {\"source\": 170512, \"target\": 224158}, {\"source\": 170512, \"target\": 253949}, {\"source\": 44210, \"target\": 15578}, {\"source\": 44210, \"target\": 11933}, {\"source\": 44210, \"target\": 84958}, {\"source\": 44210, \"target\": 253949}, {\"source\": 44210, \"target\": 274683}, {\"source\": 253949, \"target\": 84958}, {\"source\": 253949, \"target\": 224158}, {\"source\": 253949, \"target\": 11933}, {\"source\": 84958, \"target\": 15578}, {\"source\": 84958, \"target\": 224158}, {\"source\": 84958, \"target\": 274683}, {\"source\": 15578, \"target\": 274683}, {\"source\": 274683, \"target\": 11933}]}",
"id": 2258,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: R. Srikant, Ness B. Shroff, Ratul Mahajan, Fan Qiu, Lijun Chen, Steven H. Low, Mung Chiang, Rayadurgam Srikant, Baochun Li, Atilla Eryilmaz, Klara Nahrstedt, Venkata N. Padmanabhan, John C. Doyle, Yuan Xue\n- Research collaborations between these authors: R. Srikant and Ness B. Shroff, R. Srikant and Mung Chiang, R. Srikant and Yuan Xue, R. Srikant and Rayadurgam Srikant, R. Srikant and Atilla Eryilmaz, R. Srikant and John C. Doyle, R. Srikant and Steven H. Low, R. Srikant and Fan Qiu, Ness B. Shroff and Ratul Mahajan, Ness B. Shroff and Klara Nahrstedt, Ness B. Shroff and Baochun Li, Ness B. Shroff and Mung Chiang, Ness B. Shroff and Yuan Xue, Ness B. Shroff and Rayadurgam Srikant, Ness B. Shroff and Lijun Chen, Ness B. Shroff and Atilla Eryilmaz, Ness B. Shroff and John C. Doyle, Ness B. Shroff and Venkata N. Padmanabhan, Ness B. Shroff and Steven H. Low, Ness B. Shroff and Fan Qiu, Ratul Mahajan and Venkata N. Padmanabhan, Ratul Mahajan and Baochun Li, Ratul Mahajan and Mung Chiang, Ratul Mahajan and John C. Doyle, Fan Qiu and Klara Nahrstedt, Fan Qiu and Baochun Li, Fan Qiu and Mung Chiang, Fan Qiu and Yuan Xue, Fan Qiu and Rayadurgam Srikant, Fan Qiu and Lijun Chen, Fan Qiu and Atilla Eryilmaz, Fan Qiu and John C. Doyle, Fan Qiu and Venkata N. Padmanabhan, Fan Qiu and Steven H. Low, Lijun Chen and Mung Chiang, Lijun Chen and Yuan Xue, Lijun Chen and Baochun Li, Lijun Chen and Rayadurgam Srikant, Lijun Chen and John C. Doyle, Lijun Chen and Steven H. Low, Lijun Chen and Atilla Eryilmaz, Steven H. Low and Baochun Li, Steven H. Low and Mung Chiang, Steven H. Low and Yuan Xue, Steven H. Low and Rayadurgam Srikant, Steven H. Low and Atilla Eryilmaz, Steven H. Low and John C. Doyle, Mung Chiang and Baochun Li, Mung Chiang and Rayadurgam Srikant, Mung Chiang and Atilla Eryilmaz, Mung Chiang and John C. Doyle, Mung Chiang and Venkata N. Padmanabhan, Mung Chiang and Yuan Xue, Rayadurgam Srikant and Baochun Li, Rayadurgam Srikant and Yuan Xue, Rayadurgam Srikant and Atilla Eryilmaz, Rayadurgam Srikant and John C. Doyle, Baochun Li and Klara Nahrstedt, Baochun Li and Yuan Xue, Baochun Li and John C. Doyle, Baochun Li and Venkata N. Padmanabhan, Atilla Eryilmaz and Yuan Xue, Atilla Eryilmaz and John C. Doyle, Klara Nahrstedt and Yuan Xue, Klara Nahrstedt and Venkata N. Padmanabhan, Venkata N. Padmanabhan and Yuan Xue, John C. Doyle and Yuan Xue.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ali E. Abbas, W. Matthew Carlyle, Mohamed Naceur Azaiez, Gregory Levitin, Vicki M. Bier, Naraphorn Haphuriwat, David Ríos Insua, L. Robin Keller, Jun Zhuang, Enrico Zio, Javad Barabady, Xing Gao, Laura A. McLay, Kjell Hausken\n- Research collaborations between these authors: Ali E. Abbas and L. Robin Keller, Ali E. Abbas and Vicki M. Bier, W. Matthew Carlyle and Jun Zhuang, W. Matthew Carlyle and Vicki M. Bier, W. Matthew Carlyle and Kjell Hausken, Mohamed Naceur Azaiez and Gregory Levitin, Mohamed Naceur Azaiez and Jun Zhuang, Mohamed Naceur Azaiez and Vicki M. Bier, Mohamed Naceur Azaiez and Kjell Hausken, Gregory Levitin and Enrico Zio, Gregory Levitin and Jun Zhuang, Gregory Levitin and Vicki M. Bier, Gregory Levitin and Kjell Hausken, Vicki M. Bier and David Ríos Insua, Vicki M. Bier and Xing Gao, Vicki M. Bier and Enrico Zio, Vicki M. Bier and Jun Zhuang, Vicki M. Bier and Naraphorn Haphuriwat, Vicki M. Bier and Kjell Hausken, Vicki M. Bier and L. Robin Keller, Naraphorn Haphuriwat and Enrico Zio, Naraphorn Haphuriwat and Jun Zhuang, Naraphorn Haphuriwat and Kjell Hausken, Naraphorn Haphuriwat and L. Robin Keller, David Ríos Insua and Jun Zhuang, David Ríos Insua and L. Robin Keller, L. Robin Keller and Laura A. McLay, L. Robin Keller and Jun Zhuang, L. Robin Keller and Kjell Hausken, Jun Zhuang and Xing Gao, Jun Zhuang and Laura A. McLay, Jun Zhuang and Kjell Hausken, Enrico Zio and Javad Barabady, Xing Gao and Kjell Hausken, Laura A. McLay and Kjell Hausken.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Ali E. Abbas\", \"id\": 300641}, {\"name\": \"W. Matthew Carlyle\", \"id\": 420707}, {\"name\": \"Mohamed Naceur Azaiez\", \"id\": 620935}, {\"name\": \"Gregory Levitin\", \"id\": 190252}, {\"name\": \"Vicki M. Bier\", \"id\": 490703}, {\"name\": \"Naraphorn Haphuriwat\", \"id\": 490704}, {\"name\": \"David R\\u00edos Insua\", \"id\": 65489}, {\"name\": \"L. Robin Keller\", \"id\": 711314}, {\"name\": \"Jun Zhuang\", \"id\": 479154}, {\"name\": \"Enrico Zio\", \"id\": 187220}, {\"name\": \"Javad Barabady\", \"id\": 400123}, {\"name\": \"Xing Gao\", \"id\": 102108}, {\"name\": \"Laura A. McLay\", \"id\": 388093}, {\"name\": \"Kjell Hausken\", \"id\": 505214}], \"links\": [{\"source\": 300641, \"target\": 711314}, {\"source\": 300641, \"target\": 490703}, {\"source\": 420707, \"target\": 479154}, {\"source\": 420707, \"target\": 490703}, {\"source\": 420707, \"target\": 505214}, {\"source\": 620935, \"target\": 190252}, {\"source\": 620935, \"target\": 479154}, {\"source\": 620935, \"target\": 490703}, {\"source\": 620935, \"target\": 505214}, {\"source\": 190252, \"target\": 187220}, {\"source\": 190252, \"target\": 479154}, {\"source\": 190252, \"target\": 490703}, {\"source\": 190252, \"target\": 505214}, {\"source\": 490703, \"target\": 65489}, {\"source\": 490703, \"target\": 102108}, {\"source\": 490703, \"target\": 187220}, {\"source\": 490703, \"target\": 479154}, {\"source\": 490703, \"target\": 490704}, {\"source\": 490703, \"target\": 505214}, {\"source\": 490703, \"target\": 711314}, {\"source\": 490704, \"target\": 187220}, {\"source\": 490704, \"target\": 479154}, {\"source\": 490704, \"target\": 505214}, {\"source\": 490704, \"target\": 711314}, {\"source\": 65489, \"target\": 479154}, {\"source\": 65489, \"target\": 711314}, {\"source\": 711314, \"target\": 388093}, {\"source\": 711314, \"target\": 479154}, {\"source\": 711314, \"target\": 505214}, {\"source\": 479154, \"target\": 102108}, {\"source\": 479154, \"target\": 388093}, {\"source\": 479154, \"target\": 505214}, {\"source\": 187220, \"target\": 400123}, {\"source\": 102108, \"target\": 505214}, {\"source\": 388093, \"target\": 505214}]}",
"id": 1413,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ali E. Abbas, W. Matthew Carlyle, Mohamed Naceur Azaiez, Gregory Levitin, Vicki M. Bier, Naraphorn Haphuriwat, David Ríos Insua, L. Robin Keller, Jun Zhuang, Enrico Zio, Javad Barabady, Xing Gao, Laura A. McLay, Kjell Hausken\n- Research collaborations between these authors: Ali E. Abbas and L. Robin Keller, Ali E. Abbas and Vicki M. Bier, W. Matthew Carlyle and Jun Zhuang, W. Matthew Carlyle and Vicki M. Bier, W. Matthew Carlyle and Kjell Hausken, Mohamed Naceur Azaiez and Gregory Levitin, Mohamed Naceur Azaiez and Jun Zhuang, Mohamed Naceur Azaiez and Vicki M. Bier, Mohamed Naceur Azaiez and Kjell Hausken, Gregory Levitin and Enrico Zio, Gregory Levitin and Jun Zhuang, Gregory Levitin and Vicki M. Bier, Gregory Levitin and Kjell Hausken, Vicki M. Bier and David Ríos Insua, Vicki M. Bier and Xing Gao, Vicki M. Bier and Enrico Zio, Vicki M. Bier and Jun Zhuang, Vicki M. Bier and Naraphorn Haphuriwat, Vicki M. Bier and Kjell Hausken, Vicki M. Bier and L. Robin Keller, Naraphorn Haphuriwat and Enrico Zio, Naraphorn Haphuriwat and Jun Zhuang, Naraphorn Haphuriwat and Kjell Hausken, Naraphorn Haphuriwat and L. Robin Keller, David Ríos Insua and Jun Zhuang, David Ríos Insua and L. Robin Keller, L. Robin Keller and Laura A. McLay, L. Robin Keller and Jun Zhuang, L. Robin Keller and Kjell Hausken, Jun Zhuang and Xing Gao, Jun Zhuang and Laura A. McLay, Jun Zhuang and Kjell Hausken, Enrico Zio and Javad Barabady, Xing Gao and Kjell Hausken, Laura A. McLay and Kjell Hausken.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Bryan Temprado-Battad, Antonio Sarasa-Cabezuelo, José-Luis Sierra, Álvaro Navarro-Iborra, Juan Manuel Dodero, Miguel-Angel Redondo, Jyh-Charn Liu, Francisco-Jose Garcia-Penalvo, Carina S. González, Marjan Mernik, Pablo Moreno-Ger, José Luis Sierra, Alberto Martínez-Avilés, Baltasar Fernández-Manjón\n- Research collaborations between these authors: Bryan Temprado-Battad and Pablo Moreno-Ger, Bryan Temprado-Battad and Juan Manuel Dodero, Bryan Temprado-Battad and Carina S. González, Bryan Temprado-Battad and Baltasar Fernández-Manjón, Bryan Temprado-Battad and José Luis Sierra, Bryan Temprado-Battad and Antonio Sarasa-Cabezuelo, Bryan Temprado-Battad and José-Luis Sierra, Bryan Temprado-Battad and Álvaro Navarro-Iborra, Bryan Temprado-Battad and Francisco-Jose Garcia-Penalvo, Bryan Temprado-Battad and Miguel-Angel Redondo, Antonio Sarasa-Cabezuelo and Pablo Moreno-Ger, Antonio Sarasa-Cabezuelo and José Luis Sierra, Antonio Sarasa-Cabezuelo and Juan Manuel Dodero, Antonio Sarasa-Cabezuelo and Carina S. González, Antonio Sarasa-Cabezuelo and Marjan Mernik, Antonio Sarasa-Cabezuelo and Baltasar Fernández-Manjón, Antonio Sarasa-Cabezuelo and Jyh-Charn Liu, Antonio Sarasa-Cabezuelo and José-Luis Sierra, Antonio Sarasa-Cabezuelo and Alberto Martínez-Avilés, Antonio Sarasa-Cabezuelo and Álvaro Navarro-Iborra, Antonio Sarasa-Cabezuelo and Francisco-Jose Garcia-Penalvo, Antonio Sarasa-Cabezuelo and Miguel-Angel Redondo, José-Luis Sierra and Pablo Moreno-Ger, José-Luis Sierra and José Luis Sierra, José-Luis Sierra and Juan Manuel Dodero, José-Luis Sierra and Carina S. González, José-Luis Sierra and Marjan Mernik, José-Luis Sierra and Baltasar Fernández-Manjón, José-Luis Sierra and Jyh-Charn Liu, José-Luis Sierra and Alberto Martínez-Avilés, José-Luis Sierra and Álvaro Navarro-Iborra, José-Luis Sierra and Francisco-Jose Garcia-Penalvo, José-Luis Sierra and Miguel-Angel Redondo, Juan Manuel Dodero and Baltasar Fernández-Manjón, Juan Manuel Dodero and Pablo Moreno-Ger, Juan Manuel Dodero and José Luis Sierra, Pablo Moreno-Ger and Baltasar Fernández-Manjón, Pablo Moreno-Ger and José Luis Sierra, José Luis Sierra and Baltasar Fernández-Manjón.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Bryan Temprado-Battad\", \"id\": 374468}, {\"name\": \"Antonio Sarasa-Cabezuelo\", \"id\": 374469}, {\"name\": \"Jos\\u00e9-Luis Sierra\", \"id\": 374470}, {\"name\": \"\\u00c1lvaro Navarro-Iborra\", \"id\": 1087367}, {\"name\": \"Juan Manuel Dodero\", \"id\": 61764}, {\"name\": \"Miguel-Angel Redondo\", \"id\": 833479}, {\"name\": \"Jyh-Charn Liu\", \"id\": 186442}, {\"name\": \"Francisco-Jose Garcia-Penalvo\", \"id\": 833478}, {\"name\": \"Carina S. Gonz\\u00e1lez\", \"id\": 90990}, {\"name\": \"Marjan Mernik\", \"id\": 4207}, {\"name\": \"Pablo Moreno-Ger\", \"id\": 24816}, {\"name\": \"Jos\\u00e9 Luis Sierra\", \"id\": 48117}, {\"name\": \"Alberto Mart\\u00ednez-Avil\\u00e9s\", \"id\": 966490}, {\"name\": \"Baltasar Fern\\u00e1ndez-Manj\\u00f3n\", \"id\": 20574}], \"links\": [{\"source\": 374468, \"target\": 24816}, {\"source\": 374468, \"target\": 61764}, {\"source\": 374468, \"target\": 90990}, {\"source\": 374468, \"target\": 20574}, {\"source\": 374468, \"target\": 48117}, {\"source\": 374468, \"target\": 374469}, {\"source\": 374468, \"target\": 374470}, {\"source\": 374468, \"target\": 1087367}, {\"source\": 374468, \"target\": 833478}, {\"source\": 374468, \"target\": 833479}, {\"source\": 374469, \"target\": 24816}, {\"source\": 374469, \"target\": 48117}, {\"source\": 374469, \"target\": 61764}, {\"source\": 374469, \"target\": 90990}, {\"source\": 374469, \"target\": 4207}, {\"source\": 374469, \"target\": 20574}, {\"source\": 374469, \"target\": 186442}, {\"source\": 374469, \"target\": 374470}, {\"source\": 374469, \"target\": 966490}, {\"source\": 374469, \"target\": 1087367}, {\"source\": 374469, \"target\": 833478}, {\"source\": 374469, \"target\": 833479}, {\"source\": 374470, \"target\": 24816}, {\"source\": 374470, \"target\": 48117}, {\"source\": 374470, \"target\": 61764}, {\"source\": 374470, \"target\": 90990}, {\"source\": 374470, \"target\": 4207}, {\"source\": 374470, \"target\": 20574}, {\"source\": 374470, \"target\": 186442}, {\"source\": 374470, \"target\": 966490}, {\"source\": 374470, \"target\": 1087367}, {\"source\": 374470, \"target\": 833478}, {\"source\": 374470, \"target\": 833479}, {\"source\": 61764, \"target\": 20574}, {\"source\": 61764, \"target\": 24816}, {\"source\": 61764, \"target\": 48117}, {\"source\": 24816, \"target\": 20574}, {\"source\": 24816, \"target\": 48117}, {\"source\": 48117, \"target\": 20574}]}",
"id": 512,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Bryan Temprado-Battad, Antonio Sarasa-Cabezuelo, José-Luis Sierra, Álvaro Navarro-Iborra, Juan Manuel Dodero, Miguel-Angel Redondo, Jyh-Charn Liu, Francisco-Jose Garcia-Penalvo, Carina S. González, Marjan Mernik, Pablo Moreno-Ger, José Luis Sierra, Alberto Martínez-Avilés, Baltasar Fernández-Manjón\n- Research collaborations between these authors: Bryan Temprado-Battad and Pablo Moreno-Ger, Bryan Temprado-Battad and Juan Manuel Dodero, Bryan Temprado-Battad and Carina S. González, Bryan Temprado-Battad and Baltasar Fernández-Manjón, Bryan Temprado-Battad and José Luis Sierra, Bryan Temprado-Battad and Antonio Sarasa-Cabezuelo, Bryan Temprado-Battad and José-Luis Sierra, Bryan Temprado-Battad and Álvaro Navarro-Iborra, Bryan Temprado-Battad and Francisco-Jose Garcia-Penalvo, Bryan Temprado-Battad and Miguel-Angel Redondo, Antonio Sarasa-Cabezuelo and Pablo Moreno-Ger, Antonio Sarasa-Cabezuelo and José Luis Sierra, Antonio Sarasa-Cabezuelo and Juan Manuel Dodero, Antonio Sarasa-Cabezuelo and Carina S. González, Antonio Sarasa-Cabezuelo and Marjan Mernik, Antonio Sarasa-Cabezuelo and Baltasar Fernández-Manjón, Antonio Sarasa-Cabezuelo and Jyh-Charn Liu, Antonio Sarasa-Cabezuelo and José-Luis Sierra, Antonio Sarasa-Cabezuelo and Alberto Martínez-Avilés, Antonio Sarasa-Cabezuelo and Álvaro Navarro-Iborra, Antonio Sarasa-Cabezuelo and Francisco-Jose Garcia-Penalvo, Antonio Sarasa-Cabezuelo and Miguel-Angel Redondo, José-Luis Sierra and Pablo Moreno-Ger, José-Luis Sierra and José Luis Sierra, José-Luis Sierra and Juan Manuel Dodero, José-Luis Sierra and Carina S. González, José-Luis Sierra and Marjan Mernik, José-Luis Sierra and Baltasar Fernández-Manjón, José-Luis Sierra and Jyh-Charn Liu, José-Luis Sierra and Alberto Martínez-Avilés, José-Luis Sierra and Álvaro Navarro-Iborra, José-Luis Sierra and Francisco-Jose Garcia-Penalvo, José-Luis Sierra and Miguel-Angel Redondo, Juan Manuel Dodero and Baltasar Fernández-Manjón, Juan Manuel Dodero and Pablo Moreno-Ger, Juan Manuel Dodero and José Luis Sierra, Pablo Moreno-Ger and Baltasar Fernández-Manjón, Pablo Moreno-Ger and José Luis Sierra, José Luis Sierra and Baltasar Fernández-Manjón.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Valentyn Melnyk, Vikas Ashok, Andrii Soviak, Yury Puzis, I. V. Ramakrishnan, João Guerreiro, Yevgen Borodin, Jalal Mahmud, Glenn Dausch, Muhammad Asiful Islam, Charles L. Chen, Jeffrey P. Bigham, Faisal Ahmed, Richard E. Ladner\n- Research collaborations between these authors: Valentyn Melnyk and I. V. Ramakrishnan, Valentyn Melnyk and Yevgen Borodin, Valentyn Melnyk and Yury Puzis, Valentyn Melnyk and Jeffrey P. Bigham, Valentyn Melnyk and Glenn Dausch, Valentyn Melnyk and Charles L. Chen, Valentyn Melnyk and Vikas Ashok, Valentyn Melnyk and Muhammad Asiful Islam, Valentyn Melnyk and Faisal Ahmed, Vikas Ashok and I. V. Ramakrishnan, Vikas Ashok and Yevgen Borodin, Vikas Ashok and Yury Puzis, Vikas Ashok and Jalal Mahmud, Vikas Ashok and Jeffrey P. Bigham, Vikas Ashok and Faisal Ahmed, Vikas Ashok and Glenn Dausch, Andrii Soviak and I. V. Ramakrishnan, Andrii Soviak and Yevgen Borodin, Andrii Soviak and Yury Puzis, Andrii Soviak and Jeffrey P. Bigham, Andrii Soviak and Muhammad Asiful Islam, Andrii Soviak and Faisal Ahmed, Andrii Soviak and Glenn Dausch, Andrii Soviak and Charles L. Chen, Yury Puzis and I. V. Ramakrishnan, Yury Puzis and Yevgen Borodin, Yury Puzis and Jalal Mahmud, Yury Puzis and Jeffrey P. Bigham, Yury Puzis and Muhammad Asiful Islam, Yury Puzis and Faisal Ahmed, Yury Puzis and Glenn Dausch, Yury Puzis and Charles L. Chen, I. V. Ramakrishnan and Yevgen Borodin, I. V. Ramakrishnan and Jalal Mahmud, I. V. Ramakrishnan and Richard E. Ladner, I. V. Ramakrishnan and Jeffrey P. Bigham, I. V. Ramakrishnan and Muhammad Asiful Islam, I. V. Ramakrishnan and Faisal Ahmed, I. V. Ramakrishnan and Glenn Dausch, I. V. Ramakrishnan and Charles L. Chen, I. V. Ramakrishnan and João Guerreiro, João Guerreiro and Yevgen Borodin, João Guerreiro and Richard E. Ladner, João Guerreiro and Jeffrey P. Bigham, João Guerreiro and Faisal Ahmed, João Guerreiro and Glenn Dausch, Yevgen Borodin and Jalal Mahmud, Yevgen Borodin and Richard E. Ladner, Yevgen Borodin and Jeffrey P. Bigham, Yevgen Borodin and Muhammad Asiful Islam, Yevgen Borodin and Faisal Ahmed, Yevgen Borodin and Glenn Dausch, Yevgen Borodin and Charles L. Chen, Jalal Mahmud and Jeffrey P. Bigham, Jalal Mahmud and Muhammad Asiful Islam, Jalal Mahmud and Faisal Ahmed, Glenn Dausch and Muhammad Asiful Islam, Glenn Dausch and Faisal Ahmed, Glenn Dausch and Richard E. Ladner, Glenn Dausch and Jeffrey P. Bigham, Muhammad Asiful Islam and Jeffrey P. Bigham, Muhammad Asiful Islam and Faisal Ahmed, Jeffrey P. Bigham and Richard E. Ladner, Jeffrey P. Bigham and Faisal Ahmed.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Valentyn Melnyk\", \"id\": 200480}, {\"name\": \"Vikas Ashok\", \"id\": 200481}, {\"name\": \"Andrii Soviak\", \"id\": 200482}, {\"name\": \"Yury Puzis\", \"id\": 134217}, {\"name\": \"I. V. Ramakrishnan\", \"id\": 8939}, {\"name\": \"Jo\\u00e3o Guerreiro\", \"id\": 131470}, {\"name\": \"Yevgen Borodin\", \"id\": 76624}, {\"name\": \"Jalal Mahmud\", \"id\": 76625}, {\"name\": \"Glenn Dausch\", \"id\": 501299}, {\"name\": \"Muhammad Asiful Islam\", \"id\": 415795}, {\"name\": \"Charles L. Chen\", \"id\": 807635}, {\"name\": \"Jeffrey P. Bigham\", \"id\": 174010}, {\"name\": \"Faisal Ahmed\", \"id\": 458268}, {\"name\": \"Richard E. Ladner\", \"id\": 111997}], \"links\": [{\"source\": 200480, \"target\": 8939}, {\"source\": 200480, \"target\": 76624}, {\"source\": 200480, \"target\": 134217}, {\"source\": 200480, \"target\": 174010}, {\"source\": 200480, \"target\": 501299}, {\"source\": 200480, \"target\": 807635}, {\"source\": 200480, \"target\": 200481}, {\"source\": 200480, \"target\": 415795}, {\"source\": 200480, \"target\": 458268}, {\"source\": 200481, \"target\": 8939}, {\"source\": 200481, \"target\": 76624}, {\"source\": 200481, \"target\": 134217}, {\"source\": 200481, \"target\": 76625}, {\"source\": 200481, \"target\": 174010}, {\"source\": 200481, \"target\": 458268}, {\"source\": 200481, \"target\": 501299}, {\"source\": 200482, \"target\": 8939}, {\"source\": 200482, \"target\": 76624}, {\"source\": 200482, \"target\": 134217}, {\"source\": 200482, \"target\": 174010}, {\"source\": 200482, \"target\": 415795}, {\"source\": 200482, \"target\": 458268}, {\"source\": 200482, \"target\": 501299}, {\"source\": 200482, \"target\": 807635}, {\"source\": 134217, \"target\": 8939}, {\"source\": 134217, \"target\": 76624}, {\"source\": 134217, \"target\": 76625}, {\"source\": 134217, \"target\": 174010}, {\"source\": 134217, \"target\": 415795}, {\"source\": 134217, \"target\": 458268}, {\"source\": 134217, \"target\": 501299}, {\"source\": 134217, \"target\": 807635}, {\"source\": 8939, \"target\": 76624}, {\"source\": 8939, \"target\": 76625}, {\"source\": 8939, \"target\": 111997}, {\"source\": 8939, \"target\": 174010}, {\"source\": 8939, \"target\": 415795}, {\"source\": 8939, \"target\": 458268}, {\"source\": 8939, \"target\": 501299}, {\"source\": 8939, \"target\": 807635}, {\"source\": 8939, \"target\": 131470}, {\"source\": 131470, \"target\": 76624}, {\"source\": 131470, \"target\": 111997}, {\"source\": 131470, \"target\": 174010}, {\"source\": 131470, \"target\": 458268}, {\"source\": 131470, \"target\": 501299}, {\"source\": 76624, \"target\": 76625}, {\"source\": 76624, \"target\": 111997}, {\"source\": 76624, \"target\": 174010}, {\"source\": 76624, \"target\": 415795}, {\"source\": 76624, \"target\": 458268}, {\"source\": 76624, \"target\": 501299}, {\"source\": 76624, \"target\": 807635}, {\"source\": 76625, \"target\": 174010}, {\"source\": 76625, \"target\": 415795}, {\"source\": 76625, \"target\": 458268}, {\"source\": 501299, \"target\": 415795}, {\"source\": 501299, \"target\": 458268}, {\"source\": 501299, \"target\": 111997}, {\"source\": 501299, \"target\": 174010}, {\"source\": 415795, \"target\": 174010}, {\"source\": 415795, \"target\": 458268}, {\"source\": 174010, \"target\": 111997}, {\"source\": 174010, \"target\": 458268}]}",
"id": 2184,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Valentyn Melnyk, Vikas Ashok, Andrii Soviak, Yury Puzis, I. V. Ramakrishnan, João Guerreiro, Yevgen Borodin, Jalal Mahmud, Glenn Dausch, Muhammad Asiful Islam, Charles L. Chen, Jeffrey P. Bigham, Faisal Ahmed, Richard E. Ladner\n- Research collaborations between these authors: Valentyn Melnyk and I. V. Ramakrishnan, Valentyn Melnyk and Yevgen Borodin, Valentyn Melnyk and Yury Puzis, Valentyn Melnyk and Jeffrey P. Bigham, Valentyn Melnyk and Glenn Dausch, Valentyn Melnyk and Charles L. Chen, Valentyn Melnyk and Vikas Ashok, Valentyn Melnyk and Muhammad Asiful Islam, Valentyn Melnyk and Faisal Ahmed, Vikas Ashok and I. V. Ramakrishnan, Vikas Ashok and Yevgen Borodin, Vikas Ashok and Yury Puzis, Vikas Ashok and Jalal Mahmud, Vikas Ashok and Jeffrey P. Bigham, Vikas Ashok and Faisal Ahmed, Vikas Ashok and Glenn Dausch, Andrii Soviak and I. V. Ramakrishnan, Andrii Soviak and Yevgen Borodin, Andrii Soviak and Yury Puzis, Andrii Soviak and Jeffrey P. Bigham, Andrii Soviak and Muhammad Asiful Islam, Andrii Soviak and Faisal Ahmed, Andrii Soviak and Glenn Dausch, Andrii Soviak and Charles L. Chen, Yury Puzis and I. V. Ramakrishnan, Yury Puzis and Yevgen Borodin, Yury Puzis and Jalal Mahmud, Yury Puzis and Jeffrey P. Bigham, Yury Puzis and Muhammad Asiful Islam, Yury Puzis and Faisal Ahmed, Yury Puzis and Glenn Dausch, Yury Puzis and Charles L. Chen, I. V. Ramakrishnan and Yevgen Borodin, I. V. Ramakrishnan and Jalal Mahmud, I. V. Ramakrishnan and Richard E. Ladner, I. V. Ramakrishnan and Jeffrey P. Bigham, I. V. Ramakrishnan and Muhammad Asiful Islam, I. V. Ramakrishnan and Faisal Ahmed, I. V. Ramakrishnan and Glenn Dausch, I. V. Ramakrishnan and Charles L. Chen, I. V. Ramakrishnan and João Guerreiro, João Guerreiro and Yevgen Borodin, João Guerreiro and Richard E. Ladner, João Guerreiro and Jeffrey P. Bigham, João Guerreiro and Faisal Ahmed, João Guerreiro and Glenn Dausch, Yevgen Borodin and Jalal Mahmud, Yevgen Borodin and Richard E. Ladner, Yevgen Borodin and Jeffrey P. Bigham, Yevgen Borodin and Muhammad Asiful Islam, Yevgen Borodin and Faisal Ahmed, Yevgen Borodin and Glenn Dausch, Yevgen Borodin and Charles L. Chen, Jalal Mahmud and Jeffrey P. Bigham, Jalal Mahmud and Muhammad Asiful Islam, Jalal Mahmud and Faisal Ahmed, Glenn Dausch and Muhammad Asiful Islam, Glenn Dausch and Faisal Ahmed, Glenn Dausch and Richard E. Ladner, Glenn Dausch and Jeffrey P. Bigham, Muhammad Asiful Islam and Jeffrey P. Bigham, Muhammad Asiful Islam and Faisal Ahmed, Jeffrey P. Bigham and Richard E. Ladner, Jeffrey P. Bigham and Faisal Ahmed.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wenjie Zhang, Haixun Wang, Animesh Trivedi, Thomas Bernecker, Parag Agrawal, Raghav Kaushik, Ekaterini Ioannou, Hans-Peter Kriegel, Nilesh N. Dalvi, Karsten Schwan, Jennifer Widom, George Kollios, Gang Chen, Surajit Chaudhuri\n- Research collaborations between these authors: Wenjie Zhang and Hans-Peter Kriegel, Wenjie Zhang and Gang Chen, Wenjie Zhang and Haixun Wang, Wenjie Zhang and George Kollios, Wenjie Zhang and Jennifer Widom, Wenjie Zhang and Thomas Bernecker, Wenjie Zhang and Nilesh N. Dalvi, Wenjie Zhang and Raghav Kaushik, Wenjie Zhang and Parag Agrawal, Haixun Wang and Hans-Peter Kriegel, Haixun Wang and Gang Chen, Haixun Wang and Jennifer Widom, Haixun Wang and George Kollios, Haixun Wang and Nilesh N. Dalvi, Haixun Wang and Raghav Kaushik, Haixun Wang and Surajit Chaudhuri, Haixun Wang and Parag Agrawal, Animesh Trivedi and Parag Agrawal, Thomas Bernecker and Hans-Peter Kriegel, Thomas Bernecker and Gang Chen, Thomas Bernecker and George Kollios, Thomas Bernecker and Jennifer Widom, Thomas Bernecker and Nilesh N. Dalvi, Thomas Bernecker and Parag Agrawal, Parag Agrawal and Hans-Peter Kriegel, Parag Agrawal and George Kollios, Parag Agrawal and Gang Chen, Parag Agrawal and Karsten Schwan, Parag Agrawal and Jennifer Widom, Parag Agrawal and Ekaterini Ioannou, Parag Agrawal and Nilesh N. Dalvi, Parag Agrawal and Raghav Kaushik, Parag Agrawal and Surajit Chaudhuri, Raghav Kaushik and Gang Chen, Raghav Kaushik and Surajit Chaudhuri, Ekaterini Ioannou and Jennifer Widom, Ekaterini Ioannou and Nilesh N. Dalvi, Ekaterini Ioannou and Surajit Chaudhuri, Hans-Peter Kriegel and George Kollios, Hans-Peter Kriegel and Jennifer Widom, Hans-Peter Kriegel and Nilesh N. Dalvi, Hans-Peter Kriegel and Gang Chen, Nilesh N. Dalvi and George Kollios, Nilesh N. Dalvi and Jennifer Widom, Nilesh N. Dalvi and Surajit Chaudhuri, Jennifer Widom and George Kollios, Jennifer Widom and Gang Chen, Jennifer Widom and Surajit Chaudhuri, George Kollios and Surajit Chaudhuri, George Kollios and Gang Chen, Gang Chen and Surajit Chaudhuri.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Wenjie Zhang\", \"id\": 52482}, {\"name\": \"Haixun Wang\", \"id\": 33543}, {\"name\": \"Animesh Trivedi\", \"id\": 123210}, {\"name\": \"Thomas Bernecker\", \"id\": 83051}, {\"name\": \"Parag Agrawal\", \"id\": 312113}, {\"name\": \"Raghav Kaushik\", \"id\": 141266}, {\"name\": \"Ekaterini Ioannou\", \"id\": 43889}, {\"name\": \"Hans-Peter Kriegel\", \"id\": 3542}, {\"name\": \"Nilesh N. Dalvi\", \"id\": 105334}, {\"name\": \"Karsten Schwan\", \"id\": 15640}, {\"name\": \"Jennifer Widom\", \"id\": 31414}, {\"name\": \"George Kollios\", \"id\": 3931}, {\"name\": \"Gang Chen\", \"id\": 6652}, {\"name\": \"Surajit Chaudhuri\", \"id\": 147261}], \"links\": [{\"source\": 52482, \"target\": 3542}, {\"source\": 52482, \"target\": 6652}, {\"source\": 52482, \"target\": 33543}, {\"source\": 52482, \"target\": 3931}, {\"source\": 52482, \"target\": 31414}, {\"source\": 52482, \"target\": 83051}, {\"source\": 52482, \"target\": 105334}, {\"source\": 52482, \"target\": 141266}, {\"source\": 52482, \"target\": 312113}, {\"source\": 33543, \"target\": 3542}, {\"source\": 33543, \"target\": 6652}, {\"source\": 33543, \"target\": 31414}, {\"source\": 33543, \"target\": 3931}, {\"source\": 33543, \"target\": 105334}, {\"source\": 33543, \"target\": 141266}, {\"source\": 33543, \"target\": 147261}, {\"source\": 33543, \"target\": 312113}, {\"source\": 123210, \"target\": 312113}, {\"source\": 83051, \"target\": 3542}, {\"source\": 83051, \"target\": 6652}, {\"source\": 83051, \"target\": 3931}, {\"source\": 83051, \"target\": 31414}, {\"source\": 83051, \"target\": 105334}, {\"source\": 83051, \"target\": 312113}, {\"source\": 312113, \"target\": 3542}, {\"source\": 312113, \"target\": 3931}, {\"source\": 312113, \"target\": 6652}, {\"source\": 312113, \"target\": 15640}, {\"source\": 312113, \"target\": 31414}, {\"source\": 312113, \"target\": 43889}, {\"source\": 312113, \"target\": 105334}, {\"source\": 312113, \"target\": 141266}, {\"source\": 312113, \"target\": 147261}, {\"source\": 141266, \"target\": 6652}, {\"source\": 141266, \"target\": 147261}, {\"source\": 43889, \"target\": 31414}, {\"source\": 43889, \"target\": 105334}, {\"source\": 43889, \"target\": 147261}, {\"source\": 3542, \"target\": 3931}, {\"source\": 3542, \"target\": 31414}, {\"source\": 3542, \"target\": 105334}, {\"source\": 3542, \"target\": 6652}, {\"source\": 105334, \"target\": 3931}, {\"source\": 105334, \"target\": 31414}, {\"source\": 105334, \"target\": 147261}, {\"source\": 31414, \"target\": 3931}, {\"source\": 31414, \"target\": 6652}, {\"source\": 31414, \"target\": 147261}, {\"source\": 3931, \"target\": 147261}, {\"source\": 3931, \"target\": 6652}, {\"source\": 6652, \"target\": 147261}]}",
"id": 2964,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wenjie Zhang, Haixun Wang, Animesh Trivedi, Thomas Bernecker, Parag Agrawal, Raghav Kaushik, Ekaterini Ioannou, Hans-Peter Kriegel, Nilesh N. Dalvi, Karsten Schwan, Jennifer Widom, George Kollios, Gang Chen, Surajit Chaudhuri\n- Research collaborations between these authors: Wenjie Zhang and Hans-Peter Kriegel, Wenjie Zhang and Gang Chen, Wenjie Zhang and Haixun Wang, Wenjie Zhang and George Kollios, Wenjie Zhang and Jennifer Widom, Wenjie Zhang and Thomas Bernecker, Wenjie Zhang and Nilesh N. Dalvi, Wenjie Zhang and Raghav Kaushik, Wenjie Zhang and Parag Agrawal, Haixun Wang and Hans-Peter Kriegel, Haixun Wang and Gang Chen, Haixun Wang and Jennifer Widom, Haixun Wang and George Kollios, Haixun Wang and Nilesh N. Dalvi, Haixun Wang and Raghav Kaushik, Haixun Wang and Surajit Chaudhuri, Haixun Wang and Parag Agrawal, Animesh Trivedi and Parag Agrawal, Thomas Bernecker and Hans-Peter Kriegel, Thomas Bernecker and Gang Chen, Thomas Bernecker and George Kollios, Thomas Bernecker and Jennifer Widom, Thomas Bernecker and Nilesh N. Dalvi, Thomas Bernecker and Parag Agrawal, Parag Agrawal and Hans-Peter Kriegel, Parag Agrawal and George Kollios, Parag Agrawal and Gang Chen, Parag Agrawal and Karsten Schwan, Parag Agrawal and Jennifer Widom, Parag Agrawal and Ekaterini Ioannou, Parag Agrawal and Nilesh N. Dalvi, Parag Agrawal and Raghav Kaushik, Parag Agrawal and Surajit Chaudhuri, Raghav Kaushik and Gang Chen, Raghav Kaushik and Surajit Chaudhuri, Ekaterini Ioannou and Jennifer Widom, Ekaterini Ioannou and Nilesh N. Dalvi, Ekaterini Ioannou and Surajit Chaudhuri, Hans-Peter Kriegel and George Kollios, Hans-Peter Kriegel and Jennifer Widom, Hans-Peter Kriegel and Nilesh N. Dalvi, Hans-Peter Kriegel and Gang Chen, Nilesh N. Dalvi and George Kollios, Nilesh N. Dalvi and Jennifer Widom, Nilesh N. Dalvi and Surajit Chaudhuri, Jennifer Widom and George Kollios, Jennifer Widom and Gang Chen, Jennifer Widom and Surajit Chaudhuri, George Kollios and Surajit Chaudhuri, George Kollios and Gang Chen, Gang Chen and Surajit Chaudhuri.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ingo Wald, Christian Lauterbach, Dinesh Manocha, Philipp Slusallek, Heiko Friedrich, Alan Chalmers, Rui Wang, Vlastimil Havran, David Luebke, Steven G. Parker, Johannes Günther, Alexei Soupikov, Peter Wonka, Kurt Debattista\n- Research collaborations between these authors: Ingo Wald and Rui Wang, Ingo Wald and Dinesh Manocha, Ingo Wald and Alan Chalmers, Ingo Wald and Philipp Slusallek, Ingo Wald and Steven G. Parker, Ingo Wald and Heiko Friedrich, Ingo Wald and David Luebke, Ingo Wald and Johannes Günther, Ingo Wald and Vlastimil Havran, Ingo Wald and Christian Lauterbach, Ingo Wald and Alexei Soupikov, Ingo Wald and Kurt Debattista, Christian Lauterbach and Dinesh Manocha, Christian Lauterbach and Philipp Slusallek, Christian Lauterbach and Vlastimil Havran, Christian Lauterbach and Rui Wang, Christian Lauterbach and David Luebke, Christian Lauterbach and Alexei Soupikov, Dinesh Manocha and Rui Wang, Dinesh Manocha and Philipp Slusallek, Dinesh Manocha and Peter Wonka, Dinesh Manocha and Steven G. Parker, Dinesh Manocha and Heiko Friedrich, Dinesh Manocha and David Luebke, Dinesh Manocha and Johannes Günther, Dinesh Manocha and Alexei Soupikov, Dinesh Manocha and Vlastimil Havran, Philipp Slusallek and Rui Wang, Philipp Slusallek and Alan Chalmers, Philipp Slusallek and Steven G. Parker, Philipp Slusallek and Heiko Friedrich, Philipp Slusallek and David Luebke, Philipp Slusallek and Alexei Soupikov, Philipp Slusallek and Kurt Debattista, Philipp Slusallek and Johannes Günther, Philipp Slusallek and Vlastimil Havran, Heiko Friedrich and Rui Wang, Heiko Friedrich and Steven G. Parker, Heiko Friedrich and David Luebke, Heiko Friedrich and Alexei Soupikov, Heiko Friedrich and Johannes Günther, Alan Chalmers and Rui Wang, Alan Chalmers and Kurt Debattista, Alan Chalmers and Peter Wonka, Alan Chalmers and Steven G. Parker, Alan Chalmers and David Luebke, Alan Chalmers and Johannes Günther, Alan Chalmers and Alexei Soupikov, Rui Wang and Peter Wonka, Rui Wang and Steven G. Parker, Rui Wang and David Luebke, Rui Wang and Alexei Soupikov, Rui Wang and Johannes Günther, Vlastimil Havran and Peter Wonka, Vlastimil Havran and Steven G. Parker, Vlastimil Havran and Alexei Soupikov, David Luebke and Kurt Debattista, David Luebke and Peter Wonka, David Luebke and Steven G. Parker, David Luebke and Alexei Soupikov, Steven G. Parker and Kurt Debattista, Steven G. Parker and Johannes Günther, Steven G. Parker and Alexei Soupikov, Johannes Günther and Kurt Debattista, Johannes Günther and Alexei Soupikov, Alexei Soupikov and Kurt Debattista, Alexei Soupikov and Peter Wonka.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Ingo Wald\", \"id\": 32195}, {\"name\": \"Dinesh Manocha\", \"id\": 7267}, {\"name\": \"Christian Lauterbach\", \"id\": 558819}, {\"name\": \"Heiko Friedrich\", \"id\": 143242}, {\"name\": \"Philipp Slusallek\", \"id\": 49194}, {\"name\": \"Alan Chalmers\", \"id\": 13389}, {\"name\": \"Rui Wang\", \"id\": 237}, {\"name\": \"Vlastimil Havran\", \"id\": 440624}, {\"name\": \"David Luebke\", \"id\": 257137}, {\"name\": \"Steven G. Parker\", \"id\": 86485}, {\"name\": \"Johannes G\\u00fcnther\", \"id\": 418390}, {\"name\": \"Alexei Soupikov\", \"id\": 870360}, {\"name\": \"Peter Wonka\", \"id\": 54747}, {\"name\": \"Kurt Debattista\", \"id\": 50045}], \"links\": [{\"source\": 32195, \"target\": 237}, {\"source\": 32195, \"target\": 7267}, {\"source\": 32195, \"target\": 13389}, {\"source\": 32195, \"target\": 49194}, {\"source\": 32195, \"target\": 86485}, {\"source\": 32195, \"target\": 143242}, {\"source\": 32195, \"target\": 257137}, {\"source\": 32195, \"target\": 418390}, {\"source\": 32195, \"target\": 440624}, {\"source\": 32195, \"target\": 558819}, {\"source\": 32195, \"target\": 870360}, {\"source\": 32195, \"target\": 50045}, {\"source\": 7267, \"target\": 237}, {\"source\": 7267, \"target\": 49194}, {\"source\": 7267, \"target\": 54747}, {\"source\": 7267, \"target\": 86485}, {\"source\": 7267, \"target\": 143242}, {\"source\": 7267, \"target\": 257137}, {\"source\": 7267, \"target\": 418390}, {\"source\": 7267, \"target\": 558819}, {\"source\": 7267, \"target\": 870360}, {\"source\": 7267, \"target\": 440624}, {\"source\": 558819, \"target\": 49194}, {\"source\": 558819, \"target\": 440624}, {\"source\": 558819, \"target\": 237}, {\"source\": 558819, \"target\": 257137}, {\"source\": 558819, \"target\": 870360}, {\"source\": 143242, \"target\": 237}, {\"source\": 143242, \"target\": 49194}, {\"source\": 143242, \"target\": 86485}, {\"source\": 143242, \"target\": 257137}, {\"source\": 143242, \"target\": 870360}, {\"source\": 143242, \"target\": 418390}, {\"source\": 49194, \"target\": 237}, {\"source\": 49194, \"target\": 13389}, {\"source\": 49194, \"target\": 86485}, {\"source\": 49194, \"target\": 257137}, {\"source\": 49194, \"target\": 870360}, {\"source\": 49194, \"target\": 50045}, {\"source\": 49194, \"target\": 418390}, {\"source\": 49194, \"target\": 440624}, {\"source\": 13389, \"target\": 237}, {\"source\": 13389, \"target\": 50045}, {\"source\": 13389, \"target\": 54747}, {\"source\": 13389, \"target\": 86485}, {\"source\": 13389, \"target\": 257137}, {\"source\": 13389, \"target\": 418390}, {\"source\": 13389, \"target\": 870360}, {\"source\": 237, \"target\": 54747}, {\"source\": 237, \"target\": 86485}, {\"source\": 237, \"target\": 257137}, {\"source\": 237, \"target\": 870360}, {\"source\": 237, \"target\": 418390}, {\"source\": 440624, \"target\": 54747}, {\"source\": 440624, \"target\": 86485}, {\"source\": 440624, \"target\": 870360}, {\"source\": 257137, \"target\": 50045}, {\"source\": 257137, \"target\": 54747}, {\"source\": 257137, \"target\": 86485}, {\"source\": 257137, \"target\": 870360}, {\"source\": 86485, \"target\": 50045}, {\"source\": 86485, \"target\": 418390}, {\"source\": 86485, \"target\": 870360}, {\"source\": 418390, \"target\": 50045}, {\"source\": 418390, \"target\": 870360}, {\"source\": 870360, \"target\": 50045}, {\"source\": 870360, \"target\": 54747}]}",
"id": 618,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ingo Wald, Christian Lauterbach, Dinesh Manocha, Philipp Slusallek, Heiko Friedrich, Alan Chalmers, Rui Wang, Vlastimil Havran, David Luebke, Steven G. Parker, Johannes Günther, Alexei Soupikov, Peter Wonka, Kurt Debattista\n- Research collaborations between these authors: Ingo Wald and Rui Wang, Ingo Wald and Dinesh Manocha, Ingo Wald and Alan Chalmers, Ingo Wald and Philipp Slusallek, Ingo Wald and Steven G. Parker, Ingo Wald and Heiko Friedrich, Ingo Wald and David Luebke, Ingo Wald and Johannes Günther, Ingo Wald and Vlastimil Havran, Ingo Wald and Christian Lauterbach, Ingo Wald and Alexei Soupikov, Ingo Wald and Kurt Debattista, Christian Lauterbach and Dinesh Manocha, Christian Lauterbach and Philipp Slusallek, Christian Lauterbach and Vlastimil Havran, Christian Lauterbach and Rui Wang, Christian Lauterbach and David Luebke, Christian Lauterbach and Alexei Soupikov, Dinesh Manocha and Rui Wang, Dinesh Manocha and Philipp Slusallek, Dinesh Manocha and Peter Wonka, Dinesh Manocha and Steven G. Parker, Dinesh Manocha and Heiko Friedrich, Dinesh Manocha and David Luebke, Dinesh Manocha and Johannes Günther, Dinesh Manocha and Alexei Soupikov, Dinesh Manocha and Vlastimil Havran, Philipp Slusallek and Rui Wang, Philipp Slusallek and Alan Chalmers, Philipp Slusallek and Steven G. Parker, Philipp Slusallek and Heiko Friedrich, Philipp Slusallek and David Luebke, Philipp Slusallek and Alexei Soupikov, Philipp Slusallek and Kurt Debattista, Philipp Slusallek and Johannes Günther, Philipp Slusallek and Vlastimil Havran, Heiko Friedrich and Rui Wang, Heiko Friedrich and Steven G. Parker, Heiko Friedrich and David Luebke, Heiko Friedrich and Alexei Soupikov, Heiko Friedrich and Johannes Günther, Alan Chalmers and Rui Wang, Alan Chalmers and Kurt Debattista, Alan Chalmers and Peter Wonka, Alan Chalmers and Steven G. Parker, Alan Chalmers and David Luebke, Alan Chalmers and Johannes Günther, Alan Chalmers and Alexei Soupikov, Rui Wang and Peter Wonka, Rui Wang and Steven G. Parker, Rui Wang and David Luebke, Rui Wang and Alexei Soupikov, Rui Wang and Johannes Günther, Vlastimil Havran and Peter Wonka, Vlastimil Havran and Steven G. Parker, Vlastimil Havran and Alexei Soupikov, David Luebke and Kurt Debattista, David Luebke and Peter Wonka, David Luebke and Steven G. Parker, David Luebke and Alexei Soupikov, Steven G. Parker and Kurt Debattista, Steven G. Parker and Johannes Günther, Steven G. Parker and Alexei Soupikov, Johannes Günther and Kurt Debattista, Johannes Günther and Alexei Soupikov, Alexei Soupikov and Kurt Debattista, Alexei Soupikov and Peter Wonka.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ivan Markovic, Nosayba El-Sayed, Wei Wang, Jürgen Umbrich, Yanyong Zhang, Nik Bessis, Jing Li, Lydia Y. Chen, Saurabh Gupta, Bianca Schroeder, Devesh Tiwari, Yudi Zheng, Alexander Toshev, David Taniar\n- Research collaborations between these authors: Nosayba El-Sayed and Lydia Y. Chen, Nosayba El-Sayed and Saurabh Gupta, Nosayba El-Sayed and Devesh Tiwari, Nosayba El-Sayed and David Taniar, Nosayba El-Sayed and Bianca Schroeder, Wei Wang and David Taniar, Wei Wang and Jing Li, Wei Wang and Alexander Toshev, Wei Wang and Bianca Schroeder, Wei Wang and Lydia Y. Chen, Yanyong Zhang and Lydia Y. Chen, Yanyong Zhang and Saurabh Gupta, Yanyong Zhang and Bianca Schroeder, Yanyong Zhang and Devesh Tiwari, Nik Bessis and David Taniar, Lydia Y. Chen and Yudi Zheng, Lydia Y. Chen and Bianca Schroeder, Saurabh Gupta and Bianca Schroeder, Saurabh Gupta and Devesh Tiwari, Saurabh Gupta and Alexander Toshev, Bianca Schroeder and Devesh Tiwari.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Ivan Markovic\", \"id\": 61728}, {\"name\": \"Nosayba El-Sayed\", \"id\": 556194}, {\"name\": \"Yanyong Zhang\", \"id\": 43907}, {\"name\": \"J\\u00fcrgen Umbrich\", \"id\": 30596}, {\"name\": \"Wei Wang\", \"id\": 4578}, {\"name\": \"Nik Bessis\", \"id\": 71046}, {\"name\": \"Jing Li\", \"id\": 29701}, {\"name\": \"Lydia Y. Chen\", \"id\": 14476}, {\"name\": \"Saurabh Gupta\", \"id\": 183537}, {\"name\": \"Bianca Schroeder\", \"id\": 358962}, {\"name\": \"Devesh Tiwari\", \"id\": 365302}, {\"name\": \"Yudi Zheng\", \"id\": 37878}, {\"name\": \"David Taniar\", \"id\": 3199}, {\"name\": \"Alexander Toshev\", \"id\": 193599}], \"links\": [{\"source\": 556194, \"target\": 14476}, {\"source\": 556194, \"target\": 183537}, {\"source\": 556194, \"target\": 365302}, {\"source\": 556194, \"target\": 3199}, {\"source\": 556194, \"target\": 358962}, {\"source\": 43907, \"target\": 14476}, {\"source\": 43907, \"target\": 183537}, {\"source\": 43907, \"target\": 358962}, {\"source\": 43907, \"target\": 365302}, {\"source\": 4578, \"target\": 3199}, {\"source\": 4578, \"target\": 29701}, {\"source\": 4578, \"target\": 193599}, {\"source\": 4578, \"target\": 358962}, {\"source\": 4578, \"target\": 14476}, {\"source\": 71046, \"target\": 3199}, {\"source\": 14476, \"target\": 37878}, {\"source\": 14476, \"target\": 358962}, {\"source\": 183537, \"target\": 358962}, {\"source\": 183537, \"target\": 365302}, {\"source\": 183537, \"target\": 193599}, {\"source\": 358962, \"target\": 365302}]}",
"id": 407,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ivan Markovic, Nosayba El-Sayed, Wei Wang, Jürgen Umbrich, Yanyong Zhang, Nik Bessis, Jing Li, Lydia Y. Chen, Saurabh Gupta, Bianca Schroeder, Devesh Tiwari, Yudi Zheng, Alexander Toshev, David Taniar\n- Research collaborations between these authors: Nosayba El-Sayed and Lydia Y. Chen, Nosayba El-Sayed and Saurabh Gupta, Nosayba El-Sayed and Devesh Tiwari, Nosayba El-Sayed and David Taniar, Nosayba El-Sayed and Bianca Schroeder, Wei Wang and David Taniar, Wei Wang and Jing Li, Wei Wang and Alexander Toshev, Wei Wang and Bianca Schroeder, Wei Wang and Lydia Y. Chen, Yanyong Zhang and Lydia Y. Chen, Yanyong Zhang and Saurabh Gupta, Yanyong Zhang and Bianca Schroeder, Yanyong Zhang and Devesh Tiwari, Nik Bessis and David Taniar, Lydia Y. Chen and Yudi Zheng, Lydia Y. Chen and Bianca Schroeder, Saurabh Gupta and Bianca Schroeder, Saurabh Gupta and Devesh Tiwari, Saurabh Gupta and Alexander Toshev, Bianca Schroeder and Devesh Tiwari.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Huifu Xu, Annamaria Barbagallo, Joachim Gwinner, Baasansuren Jadamba, Xiaojun Chen, Maria Bernadette Donato, Monica Milasi, Patrizia Daniele, Sofia Giuffrè, Antonino Maugeri, Carmela Vitanza, Masao Fukushima, Fabio Raciti, Laura Scrimali\n- Research collaborations between these authors: Huifu Xu and Xiaojun Chen, Huifu Xu and Masao Fukushima, Huifu Xu and Fabio Raciti, Annamaria Barbagallo and Fabio Raciti, Annamaria Barbagallo and Maria Bernadette Donato, Annamaria Barbagallo and Monica Milasi, Annamaria Barbagallo and Patrizia Daniele, Annamaria Barbagallo and Sofia Giuffrè, Annamaria Barbagallo and Antonino Maugeri, Joachim Gwinner and Fabio Raciti, Joachim Gwinner and Baasansuren Jadamba, Baasansuren Jadamba and Masao Fukushima, Baasansuren Jadamba and Fabio Raciti, Xiaojun Chen and Masao Fukushima, Xiaojun Chen and Fabio Raciti, Maria Bernadette Donato and Monica Milasi, Maria Bernadette Donato and Carmela Vitanza, Maria Bernadette Donato and Laura Scrimali, Monica Milasi and Carmela Vitanza, Monica Milasi and Laura Scrimali, Patrizia Daniele and Fabio Raciti, Patrizia Daniele and Sofia Giuffrè, Patrizia Daniele and Antonino Maugeri, Patrizia Daniele and Laura Scrimali, Sofia Giuffrè and Fabio Raciti, Sofia Giuffrè and Antonino Maugeri, Antonino Maugeri and Fabio Raciti, Antonino Maugeri and Laura Scrimali, Carmela Vitanza and Laura Scrimali, Masao Fukushima and Fabio Raciti, Fabio Raciti and Laura Scrimali.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Huifu Xu\", \"id\": 511235}, {\"name\": \"Annamaria Barbagallo\", \"id\": 521284}, {\"name\": \"Joachim Gwinner\", \"id\": 65306}, {\"name\": \"Baasansuren Jadamba\", \"id\": 629229}, {\"name\": \"Xiaojun Chen\", \"id\": 16783}, {\"name\": \"Maria Bernadette Donato\", \"id\": 547024}, {\"name\": \"Monica Milasi\", \"id\": 547025}, {\"name\": \"Patrizia Daniele\", \"id\": 554674}, {\"name\": \"Sofia Giuffr\\u00e8\", \"id\": 554675}, {\"name\": \"Antonino Maugeri\", \"id\": 554676}, {\"name\": \"Carmela Vitanza\", \"id\": 751090}, {\"name\": \"Masao Fukushima\", \"id\": 332758}, {\"name\": \"Fabio Raciti\", \"id\": 513018}, {\"name\": \"Laura Scrimali\", \"id\": 580475}], \"links\": [{\"source\": 511235, \"target\": 16783}, {\"source\": 511235, \"target\": 332758}, {\"source\": 511235, \"target\": 513018}, {\"source\": 521284, \"target\": 513018}, {\"source\": 521284, \"target\": 547024}, {\"source\": 521284, \"target\": 547025}, {\"source\": 521284, \"target\": 554674}, {\"source\": 521284, \"target\": 554675}, {\"source\": 521284, \"target\": 554676}, {\"source\": 65306, \"target\": 513018}, {\"source\": 65306, \"target\": 629229}, {\"source\": 629229, \"target\": 332758}, {\"source\": 629229, \"target\": 513018}, {\"source\": 16783, \"target\": 332758}, {\"source\": 16783, \"target\": 513018}, {\"source\": 547024, \"target\": 547025}, {\"source\": 547024, \"target\": 751090}, {\"source\": 547024, \"target\": 580475}, {\"source\": 547025, \"target\": 751090}, {\"source\": 547025, \"target\": 580475}, {\"source\": 554674, \"target\": 513018}, {\"source\": 554674, \"target\": 554675}, {\"source\": 554674, \"target\": 554676}, {\"source\": 554674, \"target\": 580475}, {\"source\": 554675, \"target\": 513018}, {\"source\": 554675, \"target\": 554676}, {\"source\": 554676, \"target\": 513018}, {\"source\": 554676, \"target\": 580475}, {\"source\": 751090, \"target\": 580475}, {\"source\": 332758, \"target\": 513018}, {\"source\": 513018, \"target\": 580475}]}",
"id": 2938,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Huifu Xu, Annamaria Barbagallo, Joachim Gwinner, Baasansuren Jadamba, Xiaojun Chen, Maria Bernadette Donato, Monica Milasi, Patrizia Daniele, Sofia Giuffrè, Antonino Maugeri, Carmela Vitanza, Masao Fukushima, Fabio Raciti, Laura Scrimali\n- Research collaborations between these authors: Huifu Xu and Xiaojun Chen, Huifu Xu and Masao Fukushima, Huifu Xu and Fabio Raciti, Annamaria Barbagallo and Fabio Raciti, Annamaria Barbagallo and Maria Bernadette Donato, Annamaria Barbagallo and Monica Milasi, Annamaria Barbagallo and Patrizia Daniele, Annamaria Barbagallo and Sofia Giuffrè, Annamaria Barbagallo and Antonino Maugeri, Joachim Gwinner and Fabio Raciti, Joachim Gwinner and Baasansuren Jadamba, Baasansuren Jadamba and Masao Fukushima, Baasansuren Jadamba and Fabio Raciti, Xiaojun Chen and Masao Fukushima, Xiaojun Chen and Fabio Raciti, Maria Bernadette Donato and Monica Milasi, Maria Bernadette Donato and Carmela Vitanza, Maria Bernadette Donato and Laura Scrimali, Monica Milasi and Carmela Vitanza, Monica Milasi and Laura Scrimali, Patrizia Daniele and Fabio Raciti, Patrizia Daniele and Sofia Giuffrè, Patrizia Daniele and Antonino Maugeri, Patrizia Daniele and Laura Scrimali, Sofia Giuffrè and Fabio Raciti, Sofia Giuffrè and Antonino Maugeri, Antonino Maugeri and Fabio Raciti, Antonino Maugeri and Laura Scrimali, Carmela Vitanza and Laura Scrimali, Masao Fukushima and Fabio Raciti, Fabio Raciti and Laura Scrimali.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Soung Chang Liew, Tamer Khattab, Yefim Haim Michlin, Zhigang Cao, Georgios B. Giannakis, Ying-Chang Liang, Lajos Hanzo, Juan Liu, Wei Chen, Young Kwon, Geoffrey Ye Li, Simon Haykin, Ying Jun Zhang, Xiaojun Yuan\n- Research collaborations between these authors: Soung Chang Liew and Wei Chen, Soung Chang Liew and Ying-Chang Liang, Soung Chang Liew and Ying Jun Zhang, Soung Chang Liew and Xiaojun Yuan, Soung Chang Liew and Georgios B. Giannakis, Soung Chang Liew and Zhigang Cao, Tamer Khattab and Juan Liu, Tamer Khattab and Wei Chen, Tamer Khattab and Zhigang Cao, Tamer Khattab and Ying-Chang Liang, Tamer Khattab and Ying Jun Zhang, Tamer Khattab and Simon Haykin, Zhigang Cao and Juan Liu, Zhigang Cao and Wei Chen, Zhigang Cao and Ying-Chang Liang, Zhigang Cao and Ying Jun Zhang, Zhigang Cao and Georgios B. Giannakis, Zhigang Cao and Lajos Hanzo, Zhigang Cao and Simon Haykin, Zhigang Cao and Geoffrey Ye Li, Zhigang Cao and Young Kwon, Georgios B. Giannakis and Wei Chen, Georgios B. Giannakis and Ying-Chang Liang, Georgios B. Giannakis and Ying Jun Zhang, Georgios B. Giannakis and Xiaojun Yuan, Georgios B. Giannakis and Simon Haykin, Georgios B. Giannakis and Lajos Hanzo, Georgios B. Giannakis and Geoffrey Ye Li, Ying-Chang Liang and Juan Liu, Ying-Chang Liang and Wei Chen, Ying-Chang Liang and Simon Haykin, Ying-Chang Liang and Geoffrey Ye Li, Ying-Chang Liang and Ying Jun Zhang, Ying-Chang Liang and Xiaojun Yuan, Ying-Chang Liang and Lajos Hanzo, Lajos Hanzo and Wei Chen, Lajos Hanzo and Ying Jun Zhang, Lajos Hanzo and Simon Haykin, Lajos Hanzo and Geoffrey Ye Li, Juan Liu and Wei Chen, Juan Liu and Ying Jun Zhang, Juan Liu and Simon Haykin, Juan Liu and Geoffrey Ye Li, Juan Liu and Young Kwon, Wei Chen and Ying Jun Zhang, Wei Chen and Simon Haykin, Wei Chen and Geoffrey Ye Li, Wei Chen and Young Kwon, Young Kwon and Ying Jun Zhang, Geoffrey Ye Li and Ying Jun Zhang, Geoffrey Ye Li and Simon Haykin, Simon Haykin and Ying Jun Zhang, Ying Jun Zhang and Xiaojun Yuan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Soung Chang Liew\", \"id\": 38338}, {\"name\": \"Yefim Haim Michlin\", \"id\": 321283}, {\"name\": \"Tamer Khattab\", \"id\": 264771}, {\"name\": \"Georgios B. Giannakis\", \"id\": 77571}, {\"name\": \"Zhigang Cao\", \"id\": 62533}, {\"name\": \"Ying-Chang Liang\", \"id\": 70722}, {\"name\": \"Lajos Hanzo\", \"id\": 122248}, {\"name\": \"Juan Liu\", \"id\": 5130}, {\"name\": \"Wei Chen\", \"id\": 13200}, {\"name\": \"Young Kwon\", \"id\": 1079541}, {\"name\": \"Geoffrey Ye Li\", \"id\": 232661}, {\"name\": \"Simon Haykin\", \"id\": 222295}, {\"name\": \"Ying Jun Zhang\", \"id\": 71294}, {\"name\": \"Xiaojun Yuan\", \"id\": 71295}], \"links\": [{\"source\": 38338, \"target\": 13200}, {\"source\": 38338, \"target\": 70722}, {\"source\": 38338, \"target\": 71294}, {\"source\": 38338, \"target\": 71295}, {\"source\": 38338, \"target\": 77571}, {\"source\": 38338, \"target\": 62533}, {\"source\": 264771, \"target\": 5130}, {\"source\": 264771, \"target\": 13200}, {\"source\": 264771, \"target\": 62533}, {\"source\": 264771, \"target\": 70722}, {\"source\": 264771, \"target\": 71294}, {\"source\": 264771, \"target\": 222295}, {\"source\": 77571, \"target\": 13200}, {\"source\": 77571, \"target\": 62533}, {\"source\": 77571, \"target\": 70722}, {\"source\": 77571, \"target\": 71294}, {\"source\": 77571, \"target\": 71295}, {\"source\": 77571, \"target\": 222295}, {\"source\": 77571, \"target\": 122248}, {\"source\": 77571, \"target\": 232661}, {\"source\": 62533, \"target\": 5130}, {\"source\": 62533, \"target\": 13200}, {\"source\": 62533, \"target\": 70722}, {\"source\": 62533, \"target\": 71294}, {\"source\": 62533, \"target\": 122248}, {\"source\": 62533, \"target\": 222295}, {\"source\": 62533, \"target\": 232661}, {\"source\": 62533, \"target\": 1079541}, {\"source\": 70722, \"target\": 5130}, {\"source\": 70722, \"target\": 13200}, {\"source\": 70722, \"target\": 222295}, {\"source\": 70722, \"target\": 232661}, {\"source\": 70722, \"target\": 71294}, {\"source\": 70722, \"target\": 71295}, {\"source\": 70722, \"target\": 122248}, {\"source\": 122248, \"target\": 13200}, {\"source\": 122248, \"target\": 71294}, {\"source\": 122248, \"target\": 222295}, {\"source\": 122248, \"target\": 232661}, {\"source\": 5130, \"target\": 13200}, {\"source\": 5130, \"target\": 71294}, {\"source\": 5130, \"target\": 222295}, {\"source\": 5130, \"target\": 232661}, {\"source\": 5130, \"target\": 1079541}, {\"source\": 13200, \"target\": 71294}, {\"source\": 13200, \"target\": 222295}, {\"source\": 13200, \"target\": 232661}, {\"source\": 13200, \"target\": 1079541}, {\"source\": 1079541, \"target\": 71294}, {\"source\": 232661, \"target\": 71294}, {\"source\": 232661, \"target\": 222295}, {\"source\": 222295, \"target\": 71294}, {\"source\": 71294, \"target\": 71295}]}",
"id": 2420,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Soung Chang Liew, Tamer Khattab, Yefim Haim Michlin, Zhigang Cao, Georgios B. Giannakis, Ying-Chang Liang, Lajos Hanzo, Juan Liu, Wei Chen, Young Kwon, Geoffrey Ye Li, Simon Haykin, Ying Jun Zhang, Xiaojun Yuan\n- Research collaborations between these authors: Soung Chang Liew and Wei Chen, Soung Chang Liew and Ying-Chang Liang, Soung Chang Liew and Ying Jun Zhang, Soung Chang Liew and Xiaojun Yuan, Soung Chang Liew and Georgios B. Giannakis, Soung Chang Liew and Zhigang Cao, Tamer Khattab and Juan Liu, Tamer Khattab and Wei Chen, Tamer Khattab and Zhigang Cao, Tamer Khattab and Ying-Chang Liang, Tamer Khattab and Ying Jun Zhang, Tamer Khattab and Simon Haykin, Zhigang Cao and Juan Liu, Zhigang Cao and Wei Chen, Zhigang Cao and Ying-Chang Liang, Zhigang Cao and Ying Jun Zhang, Zhigang Cao and Georgios B. Giannakis, Zhigang Cao and Lajos Hanzo, Zhigang Cao and Simon Haykin, Zhigang Cao and Geoffrey Ye Li, Zhigang Cao and Young Kwon, Georgios B. Giannakis and Wei Chen, Georgios B. Giannakis and Ying-Chang Liang, Georgios B. Giannakis and Ying Jun Zhang, Georgios B. Giannakis and Xiaojun Yuan, Georgios B. Giannakis and Simon Haykin, Georgios B. Giannakis and Lajos Hanzo, Georgios B. Giannakis and Geoffrey Ye Li, Ying-Chang Liang and Juan Liu, Ying-Chang Liang and Wei Chen, Ying-Chang Liang and Simon Haykin, Ying-Chang Liang and Geoffrey Ye Li, Ying-Chang Liang and Ying Jun Zhang, Ying-Chang Liang and Xiaojun Yuan, Ying-Chang Liang and Lajos Hanzo, Lajos Hanzo and Wei Chen, Lajos Hanzo and Ying Jun Zhang, Lajos Hanzo and Simon Haykin, Lajos Hanzo and Geoffrey Ye Li, Juan Liu and Wei Chen, Juan Liu and Ying Jun Zhang, Juan Liu and Simon Haykin, Juan Liu and Geoffrey Ye Li, Juan Liu and Young Kwon, Wei Chen and Ying Jun Zhang, Wei Chen and Simon Haykin, Wei Chen and Geoffrey Ye Li, Wei Chen and Young Kwon, Young Kwon and Ying Jun Zhang, Geoffrey Ye Li and Ying Jun Zhang, Geoffrey Ye Li and Simon Haykin, Simon Haykin and Ying Jun Zhang, Ying Jun Zhang and Xiaojun Yuan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jin-Fu Li, Russell P. Kraft, Chao You, Cheng-Wen Wu, Gabriel H. Loh, Paul M. Belemjian, Yuan Xie, Michael Chu, Aamir Zia, Srikumar Raman, Jong-Ru Guo, Kuan Zhou, Bryan S. Goda, John F. McDonald\n- Research collaborations between these authors: Jin-Fu Li and Gabriel H. Loh, Jin-Fu Li and Yuan Xie, Jin-Fu Li and Cheng-Wen Wu, Jin-Fu Li and Michael Chu, Jin-Fu Li and John F. McDonald, Jin-Fu Li and Russell P. Kraft, Jin-Fu Li and Aamir Zia, Jin-Fu Li and Paul M. Belemjian, Russell P. Kraft and Gabriel H. Loh, Russell P. Kraft and Yuan Xie, Russell P. Kraft and Cheng-Wen Wu, Russell P. Kraft and Michael Chu, Russell P. Kraft and Chao You, Russell P. Kraft and Srikumar Raman, Russell P. Kraft and Jong-Ru Guo, Russell P. Kraft and Kuan Zhou, Russell P. Kraft and Bryan S. Goda, Russell P. Kraft and John F. McDonald, Russell P. Kraft and Aamir Zia, Russell P. Kraft and Paul M. Belemjian, Chao You and Michael Chu, Chao You and Jong-Ru Guo, Chao You and Kuan Zhou, Chao You and Bryan S. Goda, Chao You and John F. McDonald, Cheng-Wen Wu and Gabriel H. Loh, Cheng-Wen Wu and Yuan Xie, Cheng-Wen Wu and Michael Chu, Cheng-Wen Wu and John F. McDonald, Cheng-Wen Wu and Aamir Zia, Cheng-Wen Wu and Paul M. Belemjian, Gabriel H. Loh and Yuan Xie, Gabriel H. Loh and Kuan Zhou, Gabriel H. Loh and John F. McDonald, Gabriel H. Loh and Paul M. Belemjian, Gabriel H. Loh and Aamir Zia, Paul M. Belemjian and Yuan Xie, Paul M. Belemjian and Michael Chu, Paul M. Belemjian and Srikumar Raman, Paul M. Belemjian and John F. McDonald, Paul M. Belemjian and Aamir Zia, Yuan Xie and John F. McDonald, Yuan Xie and Aamir Zia, Michael Chu and Jong-Ru Guo, Michael Chu and Kuan Zhou, Michael Chu and Bryan S. Goda, Michael Chu and John F. McDonald, Michael Chu and Aamir Zia, Michael Chu and Srikumar Raman, Aamir Zia and Srikumar Raman, Aamir Zia and John F. McDonald, Srikumar Raman and John F. McDonald, Jong-Ru Guo and Kuan Zhou, Jong-Ru Guo and Bryan S. Goda, Jong-Ru Guo and John F. McDonald, Kuan Zhou and John F. McDonald, Kuan Zhou and Bryan S. Goda, Bryan S. Goda and John F. McDonald.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Jin-Fu Li\", \"id\": 159969}, {\"name\": \"Russell P. Kraft\", \"id\": 322308}, {\"name\": \"Chao You\", \"id\": 287204}, {\"name\": \"Cheng-Wen Wu\", \"id\": 250087}, {\"name\": \"Gabriel H. Loh\", \"id\": 35337}, {\"name\": \"Paul M. Belemjian\", \"id\": 825258}, {\"name\": \"Yuan Xie\", \"id\": 210475}, {\"name\": \"Michael Chu\", \"id\": 255889}, {\"name\": \"Aamir Zia\", \"id\": 569718}, {\"name\": \"Srikumar Raman\", \"id\": 287767}, {\"name\": \"Jong-Ru Guo\", \"id\": 287768}, {\"name\": \"Kuan Zhou\", \"id\": 287769}, {\"name\": \"Bryan S. Goda\", \"id\": 287771}, {\"name\": \"John F. McDonald\", \"id\": 287772}], \"links\": [{\"source\": 159969, \"target\": 35337}, {\"source\": 159969, \"target\": 210475}, {\"source\": 159969, \"target\": 250087}, {\"source\": 159969, \"target\": 255889}, {\"source\": 159969, \"target\": 287772}, {\"source\": 159969, \"target\": 322308}, {\"source\": 159969, \"target\": 569718}, {\"source\": 159969, \"target\": 825258}, {\"source\": 322308, \"target\": 35337}, {\"source\": 322308, \"target\": 210475}, {\"source\": 322308, \"target\": 250087}, {\"source\": 322308, \"target\": 255889}, {\"source\": 322308, \"target\": 287204}, {\"source\": 322308, \"target\": 287767}, {\"source\": 322308, \"target\": 287768}, {\"source\": 322308, \"target\": 287769}, {\"source\": 322308, \"target\": 287771}, {\"source\": 322308, \"target\": 287772}, {\"source\": 322308, \"target\": 569718}, {\"source\": 322308, \"target\": 825258}, {\"source\": 287204, \"target\": 255889}, {\"source\": 287204, \"target\": 287768}, {\"source\": 287204, \"target\": 287769}, {\"source\": 287204, \"target\": 287771}, {\"source\": 287204, \"target\": 287772}, {\"source\": 250087, \"target\": 35337}, {\"source\": 250087, \"target\": 210475}, {\"source\": 250087, \"target\": 255889}, {\"source\": 250087, \"target\": 287772}, {\"source\": 250087, \"target\": 569718}, {\"source\": 250087, \"target\": 825258}, {\"source\": 35337, \"target\": 210475}, {\"source\": 35337, \"target\": 287769}, {\"source\": 35337, \"target\": 287772}, {\"source\": 35337, \"target\": 825258}, {\"source\": 35337, \"target\": 569718}, {\"source\": 825258, \"target\": 210475}, {\"source\": 825258, \"target\": 255889}, {\"source\": 825258, \"target\": 287767}, {\"source\": 825258, \"target\": 287772}, {\"source\": 825258, \"target\": 569718}, {\"source\": 210475, \"target\": 287772}, {\"source\": 210475, \"target\": 569718}, {\"source\": 255889, \"target\": 287768}, {\"source\": 255889, \"target\": 287769}, {\"source\": 255889, \"target\": 287771}, {\"source\": 255889, \"target\": 287772}, {\"source\": 255889, \"target\": 569718}, {\"source\": 255889, \"target\": 287767}, {\"source\": 569718, \"target\": 287767}, {\"source\": 569718, \"target\": 287772}, {\"source\": 287767, \"target\": 287772}, {\"source\": 287768, \"target\": 287769}, {\"source\": 287768, \"target\": 287771}, {\"source\": 287768, \"target\": 287772}, {\"source\": 287769, \"target\": 287772}, {\"source\": 287769, \"target\": 287771}, {\"source\": 287771, \"target\": 287772}]}",
"id": 989,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jin-Fu Li, Russell P. Kraft, Chao You, Cheng-Wen Wu, Gabriel H. Loh, Paul M. Belemjian, Yuan Xie, Michael Chu, Aamir Zia, Srikumar Raman, Jong-Ru Guo, Kuan Zhou, Bryan S. Goda, John F. McDonald\n- Research collaborations between these authors: Jin-Fu Li and Gabriel H. Loh, Jin-Fu Li and Yuan Xie, Jin-Fu Li and Cheng-Wen Wu, Jin-Fu Li and Michael Chu, Jin-Fu Li and John F. McDonald, Jin-Fu Li and Russell P. Kraft, Jin-Fu Li and Aamir Zia, Jin-Fu Li and Paul M. Belemjian, Russell P. Kraft and Gabriel H. Loh, Russell P. Kraft and Yuan Xie, Russell P. Kraft and Cheng-Wen Wu, Russell P. Kraft and Michael Chu, Russell P. Kraft and Chao You, Russell P. Kraft and Srikumar Raman, Russell P. Kraft and Jong-Ru Guo, Russell P. Kraft and Kuan Zhou, Russell P. Kraft and Bryan S. Goda, Russell P. Kraft and John F. McDonald, Russell P. Kraft and Aamir Zia, Russell P. Kraft and Paul M. Belemjian, Chao You and Michael Chu, Chao You and Jong-Ru Guo, Chao You and Kuan Zhou, Chao You and Bryan S. Goda, Chao You and John F. McDonald, Cheng-Wen Wu and Gabriel H. Loh, Cheng-Wen Wu and Yuan Xie, Cheng-Wen Wu and Michael Chu, Cheng-Wen Wu and John F. McDonald, Cheng-Wen Wu and Aamir Zia, Cheng-Wen Wu and Paul M. Belemjian, Gabriel H. Loh and Yuan Xie, Gabriel H. Loh and Kuan Zhou, Gabriel H. Loh and John F. McDonald, Gabriel H. Loh and Paul M. Belemjian, Gabriel H. Loh and Aamir Zia, Paul M. Belemjian and Yuan Xie, Paul M. Belemjian and Michael Chu, Paul M. Belemjian and Srikumar Raman, Paul M. Belemjian and John F. McDonald, Paul M. Belemjian and Aamir Zia, Yuan Xie and John F. McDonald, Yuan Xie and Aamir Zia, Michael Chu and Jong-Ru Guo, Michael Chu and Kuan Zhou, Michael Chu and Bryan S. Goda, Michael Chu and John F. McDonald, Michael Chu and Aamir Zia, Michael Chu and Srikumar Raman, Aamir Zia and Srikumar Raman, Aamir Zia and John F. McDonald, Srikumar Raman and John F. McDonald, Jong-Ru Guo and Kuan Zhou, Jong-Ru Guo and Bryan S. Goda, Jong-Ru Guo and John F. McDonald, Kuan Zhou and John F. McDonald, Kuan Zhou and Bryan S. Goda, Bryan S. Goda and John F. McDonald.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: David J. Dittman, Bernhard Pfahringer, Chadi Assi, I-Shyan Hwang, Shui Yu, Mourad Debbabi, Dhruba Kr. Bhattacharyya, Barbara Pes, Elias Bou-Harb, Alireza Fazelpour, Dhruba K. Bhattacharyya, Jugal K. Kalita, Amri Napolitano, Taghi M. Khoshgoftaar\n- Research collaborations between these authors: David J. Dittman and Taghi M. Khoshgoftaar, David J. Dittman and Barbara Pes, David J. Dittman and Amri Napolitano, David J. Dittman and Bernhard Pfahringer, David J. Dittman and Dhruba Kr. Bhattacharyya, David J. Dittman and Alireza Fazelpour, Bernhard Pfahringer and Taghi M. Khoshgoftaar, Bernhard Pfahringer and Jugal K. Kalita, Bernhard Pfahringer and Barbara Pes, Bernhard Pfahringer and Amri Napolitano, Bernhard Pfahringer and Alireza Fazelpour, Chadi Assi and Mourad Debbabi, Chadi Assi and Jugal K. Kalita, Chadi Assi and Dhruba Kr. Bhattacharyya, Chadi Assi and Elias Bou-Harb, Chadi Assi and I-Shyan Hwang, Shui Yu and Dhruba K. Bhattacharyya, Shui Yu and Jugal K. Kalita, Mourad Debbabi and Jugal K. Kalita, Mourad Debbabi and Dhruba Kr. Bhattacharyya, Mourad Debbabi and Elias Bou-Harb, Dhruba Kr. Bhattacharyya and Taghi M. Khoshgoftaar, Dhruba Kr. Bhattacharyya and Dhruba K. Bhattacharyya, Dhruba Kr. Bhattacharyya and Amri Napolitano, Dhruba Kr. Bhattacharyya and Jugal K. Kalita, Dhruba Kr. Bhattacharyya and Elias Bou-Harb, Dhruba Kr. Bhattacharyya and Alireza Fazelpour, Barbara Pes and Taghi M. Khoshgoftaar, Barbara Pes and Amri Napolitano, Elias Bou-Harb and Jugal K. Kalita, Alireza Fazelpour and Taghi M. Khoshgoftaar, Alireza Fazelpour and Amri Napolitano, Dhruba K. Bhattacharyya and Jugal K. Kalita, Amri Napolitano and Taghi M. Khoshgoftaar.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"David J. Dittman\", \"id\": 465697}, {\"name\": \"Bernhard Pfahringer\", \"id\": 6210}, {\"name\": \"Chadi Assi\", \"id\": 66083}, {\"name\": \"I-Shyan Hwang\", \"id\": 94148}, {\"name\": \"Mourad Debbabi\", \"id\": 38572}, {\"name\": \"Barbara Pes\", \"id\": 43794}, {\"name\": \"Elias Bou-Harb\", \"id\": 434099}, {\"name\": \"Alireza Fazelpour\", \"id\": 466709}, {\"name\": \"Dhruba K. Bhattacharyya\", \"id\": 10295}, {\"name\": \"Dhruba Kr. Bhattacharyya\", \"id\": 287543}, {\"name\": \"Jugal K. Kalita\", \"id\": 10296}, {\"name\": \"Shui Yu\", \"id\": 94171}, {\"name\": \"Amri Napolitano\", \"id\": 51899}, {\"name\": \"Taghi M. Khoshgoftaar\", \"id\": 7295}], \"links\": [{\"source\": 465697, \"target\": 7295}, {\"source\": 465697, \"target\": 43794}, {\"source\": 465697, \"target\": 51899}, {\"source\": 465697, \"target\": 6210}, {\"source\": 465697, \"target\": 287543}, {\"source\": 465697, \"target\": 466709}, {\"source\": 6210, \"target\": 7295}, {\"source\": 6210, \"target\": 10296}, {\"source\": 6210, \"target\": 43794}, {\"source\": 6210, \"target\": 51899}, {\"source\": 6210, \"target\": 466709}, {\"source\": 66083, \"target\": 38572}, {\"source\": 66083, \"target\": 10296}, {\"source\": 66083, \"target\": 287543}, {\"source\": 66083, \"target\": 434099}, {\"source\": 66083, \"target\": 94148}, {\"source\": 38572, \"target\": 10296}, {\"source\": 38572, \"target\": 287543}, {\"source\": 38572, \"target\": 434099}, {\"source\": 43794, \"target\": 7295}, {\"source\": 43794, \"target\": 51899}, {\"source\": 434099, \"target\": 10296}, {\"source\": 434099, \"target\": 287543}, {\"source\": 466709, \"target\": 7295}, {\"source\": 466709, \"target\": 51899}, {\"source\": 466709, \"target\": 287543}, {\"source\": 10295, \"target\": 10296}, {\"source\": 10295, \"target\": 94171}, {\"source\": 10295, \"target\": 287543}, {\"source\": 287543, \"target\": 7295}, {\"source\": 287543, \"target\": 51899}, {\"source\": 287543, \"target\": 10296}, {\"source\": 10296, \"target\": 94171}, {\"source\": 51899, \"target\": 7295}]}",
"id": 218,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: David J. Dittman, Bernhard Pfahringer, Chadi Assi, I-Shyan Hwang, Shui Yu, Mourad Debbabi, Dhruba Kr. Bhattacharyya, Barbara Pes, Elias Bou-Harb, Alireza Fazelpour, Dhruba K. Bhattacharyya, Jugal K. Kalita, Amri Napolitano, Taghi M. Khoshgoftaar\n- Research collaborations between these authors: David J. Dittman and Taghi M. Khoshgoftaar, David J. Dittman and Barbara Pes, David J. Dittman and Amri Napolitano, David J. Dittman and Bernhard Pfahringer, David J. Dittman and Dhruba Kr. Bhattacharyya, David J. Dittman and Alireza Fazelpour, Bernhard Pfahringer and Taghi M. Khoshgoftaar, Bernhard Pfahringer and Jugal K. Kalita, Bernhard Pfahringer and Barbara Pes, Bernhard Pfahringer and Amri Napolitano, Bernhard Pfahringer and Alireza Fazelpour, Chadi Assi and Mourad Debbabi, Chadi Assi and Jugal K. Kalita, Chadi Assi and Dhruba Kr. Bhattacharyya, Chadi Assi and Elias Bou-Harb, Chadi Assi and I-Shyan Hwang, Shui Yu and Dhruba K. Bhattacharyya, Shui Yu and Jugal K. Kalita, Mourad Debbabi and Jugal K. Kalita, Mourad Debbabi and Dhruba Kr. Bhattacharyya, Mourad Debbabi and Elias Bou-Harb, Dhruba Kr. Bhattacharyya and Taghi M. Khoshgoftaar, Dhruba Kr. Bhattacharyya and Dhruba K. Bhattacharyya, Dhruba Kr. Bhattacharyya and Amri Napolitano, Dhruba Kr. Bhattacharyya and Jugal K. Kalita, Dhruba Kr. Bhattacharyya and Elias Bou-Harb, Dhruba Kr. Bhattacharyya and Alireza Fazelpour, Barbara Pes and Taghi M. Khoshgoftaar, Barbara Pes and Amri Napolitano, Elias Bou-Harb and Jugal K. Kalita, Alireza Fazelpour and Taghi M. Khoshgoftaar, Alireza Fazelpour and Amri Napolitano, Dhruba K. Bhattacharyya and Jugal K. Kalita, Amri Napolitano and Taghi M. Khoshgoftaar.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hong Zhang, Xingyu Gao, John Wright, Rodney Anthony Stewart, Siwei Ma, Luc J. Van Gool, Tomás Filler, Shutao Li, Martin Haenggi, Stephan Brusch, D.L. Schuler, Greg Turk, David M. Cole, Khoi Anh Nguyen\n- Research collaborations between these authors: Hong Zhang and Luc J. Van Gool, Hong Zhang and Shutao Li, Hong Zhang and Tomás Filler, Hong Zhang and John Wright, Hong Zhang and Rodney Anthony Stewart, Hong Zhang and D.L. Schuler, Hong Zhang and David M. Cole, Hong Zhang and Stephan Brusch, Hong Zhang and Siwei Ma, Hong Zhang and Xingyu Gao, John Wright and Luc J. Van Gool, John Wright and Shutao Li, Rodney Anthony Stewart and Khoi Anh Nguyen, Siwei Ma and Luc J. Van Gool.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Hong Zhang\", \"id\": 13857}, {\"name\": \"Xingyu Gao\", \"id\": 183496}, {\"name\": \"John Wright\", \"id\": 94345}, {\"name\": \"Rodney Anthony Stewart\", \"id\": 208427}, {\"name\": \"Siwei Ma\", \"id\": 13899}, {\"name\": \"Luc J. Van Gool\", \"id\": 7179}, {\"name\": \"Tom\\u00e1s Filler\", \"id\": 29296}, {\"name\": \"Shutao Li\", \"id\": 19217}, {\"name\": \"Martin Haenggi\", \"id\": 200082}, {\"name\": \"Stephan Brusch\", \"id\": 913237}, {\"name\": \"D.L. Schuler\", \"id\": 304662}, {\"name\": \"Greg Turk\", \"id\": 230775}, {\"name\": \"David M. Cole\", \"id\": 508731}, {\"name\": \"Khoi Anh Nguyen\", \"id\": 781150}], \"links\": [{\"source\": 13857, \"target\": 7179}, {\"source\": 13857, \"target\": 19217}, {\"source\": 13857, \"target\": 29296}, {\"source\": 13857, \"target\": 94345}, {\"source\": 13857, \"target\": 208427}, {\"source\": 13857, \"target\": 304662}, {\"source\": 13857, \"target\": 508731}, {\"source\": 13857, \"target\": 913237}, {\"source\": 13857, \"target\": 13899}, {\"source\": 13857, \"target\": 183496}, {\"source\": 94345, \"target\": 7179}, {\"source\": 94345, \"target\": 19217}, {\"source\": 208427, \"target\": 781150}, {\"source\": 13899, \"target\": 7179}]}",
"id": 2820,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hong Zhang, Xingyu Gao, John Wright, Rodney Anthony Stewart, Siwei Ma, Luc J. Van Gool, Tomás Filler, Shutao Li, Martin Haenggi, Stephan Brusch, D.L. Schuler, Greg Turk, David M. Cole, Khoi Anh Nguyen\n- Research collaborations between these authors: Hong Zhang and Luc J. Van Gool, Hong Zhang and Shutao Li, Hong Zhang and Tomás Filler, Hong Zhang and John Wright, Hong Zhang and Rodney Anthony Stewart, Hong Zhang and D.L. Schuler, Hong Zhang and David M. Cole, Hong Zhang and Stephan Brusch, Hong Zhang and Siwei Ma, Hong Zhang and Xingyu Gao, John Wright and Luc J. Van Gool, John Wright and Shutao Li, Rodney Anthony Stewart and Khoi Anh Nguyen, Siwei Ma and Luc J. Van Gool.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Marta Z. Kwiatkowska, Thomas Brihaye, Gerd Behrmann, Fabrice Chevalier, Patricia Bouyer, Geir E. Dullerud, Jean-François Raskin, Mahesh Viswanathan, Joost-Pieter Katoen, Michał Rutkowski, Kim Guldstrand Larsen, Jiří Srba, Nir Piterman, Marcin Jurdzinski\n- Research collaborations between these authors: Marta Z. Kwiatkowska and Jiří Srba, Marta Z. Kwiatkowska and Kim Guldstrand Larsen, Marta Z. Kwiatkowska and Joost-Pieter Katoen, Marta Z. Kwiatkowska and Mahesh Viswanathan, Marta Z. Kwiatkowska and Jean-François Raskin, Marta Z. Kwiatkowska and Patricia Bouyer, Marta Z. Kwiatkowska and Gerd Behrmann, Marta Z. Kwiatkowska and Thomas Brihaye, Marta Z. Kwiatkowska and Marcin Jurdzinski, Marta Z. Kwiatkowska and Nir Piterman, Thomas Brihaye and Kim Guldstrand Larsen, Thomas Brihaye and Joost-Pieter Katoen, Thomas Brihaye and Mahesh Viswanathan, Thomas Brihaye and Jean-François Raskin, Thomas Brihaye and Patricia Bouyer, Thomas Brihaye and Jiří Srba, Thomas Brihaye and Gerd Behrmann, Thomas Brihaye and Fabrice Chevalier, Thomas Brihaye and Marcin Jurdzinski, Thomas Brihaye and Michał Rutkowski, Thomas Brihaye and Geir E. Dullerud, Gerd Behrmann and Jiří Srba, Gerd Behrmann and Kim Guldstrand Larsen, Gerd Behrmann and Joost-Pieter Katoen, Gerd Behrmann and Jean-François Raskin, Gerd Behrmann and Patricia Bouyer, Gerd Behrmann and Marcin Jurdzinski, Fabrice Chevalier and Mahesh Viswanathan, Fabrice Chevalier and Patricia Bouyer, Fabrice Chevalier and Kim Guldstrand Larsen, Fabrice Chevalier and Jean-François Raskin, Fabrice Chevalier and Marcin Jurdzinski, Fabrice Chevalier and Michał Rutkowski, Fabrice Chevalier and Geir E. Dullerud, Patricia Bouyer and Jiří Srba, Patricia Bouyer and Kim Guldstrand Larsen, Patricia Bouyer and Joost-Pieter Katoen, Patricia Bouyer and Mahesh Viswanathan, Patricia Bouyer and Jean-François Raskin, Patricia Bouyer and Nir Piterman, Patricia Bouyer and Marcin Jurdzinski, Patricia Bouyer and Michał Rutkowski, Patricia Bouyer and Geir E. Dullerud, Geir E. Dullerud and Mahesh Viswanathan, Geir E. Dullerud and Jean-François Raskin, Jean-François Raskin and Kim Guldstrand Larsen, Jean-François Raskin and Joost-Pieter Katoen, Jean-François Raskin and Mahesh Viswanathan, Jean-François Raskin and Jiří Srba, Jean-François Raskin and Nir Piterman, Jean-François Raskin and Marcin Jurdzinski, Mahesh Viswanathan and Kim Guldstrand Larsen, Mahesh Viswanathan and Joost-Pieter Katoen, Joost-Pieter Katoen and Kim Guldstrand Larsen, Joost-Pieter Katoen and Jiří Srba, Joost-Pieter Katoen and Nir Piterman, Joost-Pieter Katoen and Marcin Jurdzinski, Michał Rutkowski and Kim Guldstrand Larsen, Michał Rutkowski and Marcin Jurdzinski, Kim Guldstrand Larsen and Jiří Srba, Kim Guldstrand Larsen and Nir Piterman, Kim Guldstrand Larsen and Marcin Jurdzinski, Nir Piterman and Marcin Jurdzinski.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Marta Z. Kwiatkowska\", \"id\": 1026}, {\"name\": \"Thomas Brihaye\", \"id\": 53667}, {\"name\": \"Gerd Behrmann\", \"id\": 49668}, {\"name\": \"Fabrice Chevalier\", \"id\": 119175}, {\"name\": \"Patricia Bouyer\", \"id\": 37101}, {\"name\": \"Geir E. Dullerud\", \"id\": 252525}, {\"name\": \"Jean-Fran\\u00e7ois Raskin\", \"id\": 15919}, {\"name\": \"Mahesh Viswanathan\", \"id\": 14768}, {\"name\": \"Joost-Pieter Katoen\", \"id\": 13073}, {\"name\": \"Micha\\u0142 Rutkowski\", \"id\": 247061}, {\"name\": \"Kim Guldstrand Larsen\", \"id\": 5367}, {\"name\": \"Ji\\u0159\\u00ed Srba\", \"id\": 122}, {\"name\": \"Nir Piterman\", \"id\": 221883}, {\"name\": \"Marcin Jurdzinski\", \"id\": 242109}], \"links\": [{\"source\": 1026, \"target\": 122}, {\"source\": 1026, \"target\": 5367}, {\"source\": 1026, \"target\": 13073}, {\"source\": 1026, \"target\": 14768}, {\"source\": 1026, \"target\": 15919}, {\"source\": 1026, \"target\": 37101}, {\"source\": 1026, \"target\": 49668}, {\"source\": 1026, \"target\": 53667}, {\"source\": 1026, \"target\": 242109}, {\"source\": 1026, \"target\": 221883}, {\"source\": 53667, \"target\": 5367}, {\"source\": 53667, \"target\": 13073}, {\"source\": 53667, \"target\": 14768}, {\"source\": 53667, \"target\": 15919}, {\"source\": 53667, \"target\": 37101}, {\"source\": 53667, \"target\": 122}, {\"source\": 53667, \"target\": 49668}, {\"source\": 53667, \"target\": 119175}, {\"source\": 53667, \"target\": 242109}, {\"source\": 53667, \"target\": 247061}, {\"source\": 53667, \"target\": 252525}, {\"source\": 49668, \"target\": 122}, {\"source\": 49668, \"target\": 5367}, {\"source\": 49668, \"target\": 13073}, {\"source\": 49668, \"target\": 15919}, {\"source\": 49668, \"target\": 37101}, {\"source\": 49668, \"target\": 242109}, {\"source\": 119175, \"target\": 14768}, {\"source\": 119175, \"target\": 37101}, {\"source\": 119175, \"target\": 5367}, {\"source\": 119175, \"target\": 15919}, {\"source\": 119175, \"target\": 242109}, {\"source\": 119175, \"target\": 247061}, {\"source\": 119175, \"target\": 252525}, {\"source\": 37101, \"target\": 122}, {\"source\": 37101, \"target\": 5367}, {\"source\": 37101, \"target\": 13073}, {\"source\": 37101, \"target\": 14768}, {\"source\": 37101, \"target\": 15919}, {\"source\": 37101, \"target\": 221883}, {\"source\": 37101, \"target\": 242109}, {\"source\": 37101, \"target\": 247061}, {\"source\": 37101, \"target\": 252525}, {\"source\": 252525, \"target\": 14768}, {\"source\": 252525, \"target\": 15919}, {\"source\": 15919, \"target\": 5367}, {\"source\": 15919, \"target\": 13073}, {\"source\": 15919, \"target\": 14768}, {\"source\": 15919, \"target\": 122}, {\"source\": 15919, \"target\": 221883}, {\"source\": 15919, \"target\": 242109}, {\"source\": 14768, \"target\": 5367}, {\"source\": 14768, \"target\": 13073}, {\"source\": 13073, \"target\": 5367}, {\"source\": 13073, \"target\": 122}, {\"source\": 13073, \"target\": 221883}, {\"source\": 13073, \"target\": 242109}, {\"source\": 247061, \"target\": 5367}, {\"source\": 247061, \"target\": 242109}, {\"source\": 5367, \"target\": 122}, {\"source\": 5367, \"target\": 221883}, {\"source\": 5367, \"target\": 242109}, {\"source\": 221883, \"target\": 242109}]}",
"id": 781,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Marta Z. Kwiatkowska, Thomas Brihaye, Gerd Behrmann, Fabrice Chevalier, Patricia Bouyer, Geir E. Dullerud, Jean-François Raskin, Mahesh Viswanathan, Joost-Pieter Katoen, Michał Rutkowski, Kim Guldstrand Larsen, Jiří Srba, Nir Piterman, Marcin Jurdzinski\n- Research collaborations between these authors: Marta Z. Kwiatkowska and Jiří Srba, Marta Z. Kwiatkowska and Kim Guldstrand Larsen, Marta Z. Kwiatkowska and Joost-Pieter Katoen, Marta Z. Kwiatkowska and Mahesh Viswanathan, Marta Z. Kwiatkowska and Jean-François Raskin, Marta Z. Kwiatkowska and Patricia Bouyer, Marta Z. Kwiatkowska and Gerd Behrmann, Marta Z. Kwiatkowska and Thomas Brihaye, Marta Z. Kwiatkowska and Marcin Jurdzinski, Marta Z. Kwiatkowska and Nir Piterman, Thomas Brihaye and Kim Guldstrand Larsen, Thomas Brihaye and Joost-Pieter Katoen, Thomas Brihaye and Mahesh Viswanathan, Thomas Brihaye and Jean-François Raskin, Thomas Brihaye and Patricia Bouyer, Thomas Brihaye and Jiří Srba, Thomas Brihaye and Gerd Behrmann, Thomas Brihaye and Fabrice Chevalier, Thomas Brihaye and Marcin Jurdzinski, Thomas Brihaye and Michał Rutkowski, Thomas Brihaye and Geir E. Dullerud, Gerd Behrmann and Jiří Srba, Gerd Behrmann and Kim Guldstrand Larsen, Gerd Behrmann and Joost-Pieter Katoen, Gerd Behrmann and Jean-François Raskin, Gerd Behrmann and Patricia Bouyer, Gerd Behrmann and Marcin Jurdzinski, Fabrice Chevalier and Mahesh Viswanathan, Fabrice Chevalier and Patricia Bouyer, Fabrice Chevalier and Kim Guldstrand Larsen, Fabrice Chevalier and Jean-François Raskin, Fabrice Chevalier and Marcin Jurdzinski, Fabrice Chevalier and Michał Rutkowski, Fabrice Chevalier and Geir E. Dullerud, Patricia Bouyer and Jiří Srba, Patricia Bouyer and Kim Guldstrand Larsen, Patricia Bouyer and Joost-Pieter Katoen, Patricia Bouyer and Mahesh Viswanathan, Patricia Bouyer and Jean-François Raskin, Patricia Bouyer and Nir Piterman, Patricia Bouyer and Marcin Jurdzinski, Patricia Bouyer and Michał Rutkowski, Patricia Bouyer and Geir E. Dullerud, Geir E. Dullerud and Mahesh Viswanathan, Geir E. Dullerud and Jean-François Raskin, Jean-François Raskin and Kim Guldstrand Larsen, Jean-François Raskin and Joost-Pieter Katoen, Jean-François Raskin and Mahesh Viswanathan, Jean-François Raskin and Jiří Srba, Jean-François Raskin and Nir Piterman, Jean-François Raskin and Marcin Jurdzinski, Mahesh Viswanathan and Kim Guldstrand Larsen, Mahesh Viswanathan and Joost-Pieter Katoen, Joost-Pieter Katoen and Kim Guldstrand Larsen, Joost-Pieter Katoen and Jiří Srba, Joost-Pieter Katoen and Nir Piterman, Joost-Pieter Katoen and Marcin Jurdzinski, Michał Rutkowski and Kim Guldstrand Larsen, Michał Rutkowski and Marcin Jurdzinski, Kim Guldstrand Larsen and Jiří Srba, Kim Guldstrand Larsen and Nir Piterman, Kim Guldstrand Larsen and Marcin Jurdzinski, Nir Piterman and Marcin Jurdzinski.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Desney S. Tan, Rebecca H. Allen, Dan Morris, Pattie Maes, Leah Findlater, Kongqiao Wang, Stephen A. Brewster, Luc J. Van Gool, Xiang Chen, Adrian David Cheok, Nan Xiao, Bharath Hariharan, T. Scott Saponas, Joaquim A. Jorge\n- Research collaborations between these authors: Desney S. Tan and Xiang Chen, Desney S. Tan and Stephen A. Brewster, Desney S. Tan and Pattie Maes, Desney S. Tan and Dan Morris, Desney S. Tan and T. Scott Saponas, Desney S. Tan and Rebecca H. Allen, Desney S. Tan and Leah Findlater, Desney S. Tan and Kongqiao Wang, Rebecca H. Allen and Joaquim A. Jorge, Rebecca H. Allen and Xiang Chen, Rebecca H. Allen and Kongqiao Wang, Rebecca H. Allen and Pattie Maes, Rebecca H. Allen and Dan Morris, Rebecca H. Allen and T. Scott Saponas, Rebecca H. Allen and Stephen A. Brewster, Dan Morris and Xiang Chen, Dan Morris and Leah Findlater, Dan Morris and Kongqiao Wang, Dan Morris and Pattie Maes, Dan Morris and T. Scott Saponas, Pattie Maes and Leah Findlater, Pattie Maes and Stephen A. Brewster, Pattie Maes and Adrian David Cheok, Pattie Maes and T. Scott Saponas, Leah Findlater and Stephen A. Brewster, Leah Findlater and Joaquim A. Jorge, Leah Findlater and T. Scott Saponas, Kongqiao Wang and Xiang Chen, Kongqiao Wang and Luc J. Van Gool, Kongqiao Wang and T. Scott Saponas, Stephen A. Brewster and Joaquim A. Jorge, Luc J. Van Gool and Bharath Hariharan, Xiang Chen and Nan Xiao, Xiang Chen and T. Scott Saponas.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Desney S. Tan\", \"id\": 19681}, {\"name\": \"Rebecca H. Allen\", \"id\": 673443}, {\"name\": \"Dan Morris\", \"id\": 143588}, {\"name\": \"Pattie Maes\", \"id\": 89477}, {\"name\": \"Leah Findlater\", \"id\": 38724}, {\"name\": \"Kongqiao Wang\", \"id\": 58087}, {\"name\": \"Stephen A. Brewster\", \"id\": 2090}, {\"name\": \"Luc J. Van Gool\", \"id\": 7179}, {\"name\": \"Xiang Chen\", \"id\": 15244}, {\"name\": \"Adrian David Cheok\", \"id\": 64722}, {\"name\": \"Nan Xiao\", \"id\": 103891}, {\"name\": \"Bharath Hariharan\", \"id\": 85460}, {\"name\": \"T. Scott Saponas\", \"id\": 375320}, {\"name\": \"Joaquim A. Jorge\", \"id\": 1311}], \"links\": [{\"source\": 19681, \"target\": 15244}, {\"source\": 19681, \"target\": 2090}, {\"source\": 19681, \"target\": 89477}, {\"source\": 19681, \"target\": 143588}, {\"source\": 19681, \"target\": 375320}, {\"source\": 19681, \"target\": 673443}, {\"source\": 19681, \"target\": 38724}, {\"source\": 19681, \"target\": 58087}, {\"source\": 673443, \"target\": 1311}, {\"source\": 673443, \"target\": 15244}, {\"source\": 673443, \"target\": 58087}, {\"source\": 673443, \"target\": 89477}, {\"source\": 673443, \"target\": 143588}, {\"source\": 673443, \"target\": 375320}, {\"source\": 673443, \"target\": 2090}, {\"source\": 143588, \"target\": 15244}, {\"source\": 143588, \"target\": 38724}, {\"source\": 143588, \"target\": 58087}, {\"source\": 143588, \"target\": 89477}, {\"source\": 143588, \"target\": 375320}, {\"source\": 89477, \"target\": 38724}, {\"source\": 89477, \"target\": 2090}, {\"source\": 89477, \"target\": 64722}, {\"source\": 89477, \"target\": 375320}, {\"source\": 38724, \"target\": 2090}, {\"source\": 38724, \"target\": 1311}, {\"source\": 38724, \"target\": 375320}, {\"source\": 58087, \"target\": 15244}, {\"source\": 58087, \"target\": 7179}, {\"source\": 58087, \"target\": 375320}, {\"source\": 2090, \"target\": 1311}, {\"source\": 7179, \"target\": 85460}, {\"source\": 15244, \"target\": 103891}, {\"source\": 15244, \"target\": 375320}]}",
"id": 2805,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Desney S. Tan, Rebecca H. Allen, Dan Morris, Pattie Maes, Leah Findlater, Kongqiao Wang, Stephen A. Brewster, Luc J. Van Gool, Xiang Chen, Adrian David Cheok, Nan Xiao, Bharath Hariharan, T. Scott Saponas, Joaquim A. Jorge\n- Research collaborations between these authors: Desney S. Tan and Xiang Chen, Desney S. Tan and Stephen A. Brewster, Desney S. Tan and Pattie Maes, Desney S. Tan and Dan Morris, Desney S. Tan and T. Scott Saponas, Desney S. Tan and Rebecca H. Allen, Desney S. Tan and Leah Findlater, Desney S. Tan and Kongqiao Wang, Rebecca H. Allen and Joaquim A. Jorge, Rebecca H. Allen and Xiang Chen, Rebecca H. Allen and Kongqiao Wang, Rebecca H. Allen and Pattie Maes, Rebecca H. Allen and Dan Morris, Rebecca H. Allen and T. Scott Saponas, Rebecca H. Allen and Stephen A. Brewster, Dan Morris and Xiang Chen, Dan Morris and Leah Findlater, Dan Morris and Kongqiao Wang, Dan Morris and Pattie Maes, Dan Morris and T. Scott Saponas, Pattie Maes and Leah Findlater, Pattie Maes and Stephen A. Brewster, Pattie Maes and Adrian David Cheok, Pattie Maes and T. Scott Saponas, Leah Findlater and Stephen A. Brewster, Leah Findlater and Joaquim A. Jorge, Leah Findlater and T. Scott Saponas, Kongqiao Wang and Xiang Chen, Kongqiao Wang and Luc J. Van Gool, Kongqiao Wang and T. Scott Saponas, Stephen A. Brewster and Joaquim A. Jorge, Luc J. Van Gool and Bharath Hariharan, Xiang Chen and Nan Xiao, Xiang Chen and T. Scott Saponas.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Lino Marques, Yisheng Guan, Fengyu Xu, Carlos Viegas, Seung-kook Yun, Roque J. Saltarén, Eugenio Yime, Rafael Aracil, Anibal T. de Almeida, José Maria Azorín, Daniela Rus, Mahmoud Tavakoli, Manuel Ferre, Yangsheng Xu\n- Research collaborations between these authors: Lino Marques and Rafael Aracil, Lino Marques and Mahmoud Tavakoli, Lino Marques and Roque J. Saltarén, Lino Marques and Anibal T. de Almeida, Lino Marques and Yisheng Guan, Lino Marques and Carlos Viegas, Yisheng Guan and Daniela Rus, Yisheng Guan and Rafael Aracil, Yisheng Guan and Mahmoud Tavakoli, Yisheng Guan and Roque J. Saltarén, Fengyu Xu and Rafael Aracil, Fengyu Xu and Roque J. Saltarén, Carlos Viegas and Mahmoud Tavakoli, Carlos Viegas and Anibal T. de Almeida, Carlos Viegas and Rafael Aracil, Carlos Viegas and Roque J. Saltarén, Seung-kook Yun and Daniela Rus, Seung-kook Yun and Rafael Aracil, Seung-kook Yun and Roque J. Saltarén, Roque J. Saltarén and Daniela Rus, Roque J. Saltarén and Rafael Aracil, Roque J. Saltarén and Mahmoud Tavakoli, Roque J. Saltarén and José Maria Azorín, Roque J. Saltarén and Eugenio Yime, Roque J. Saltarén and Yangsheng Xu, Roque J. Saltarén and Anibal T. de Almeida, Eugenio Yime and Rafael Aracil, Rafael Aracil and Daniela Rus, Rafael Aracil and Manuel Ferre, Rafael Aracil and José Maria Azorín, Rafael Aracil and Mahmoud Tavakoli, Rafael Aracil and Yangsheng Xu, Rafael Aracil and Anibal T. de Almeida, Anibal T. de Almeida and Mahmoud Tavakoli, José Maria Azorín and Manuel Ferre, Daniela Rus and Manuel Ferre, Daniela Rus and Yangsheng Xu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Lino Marques\", \"id\": 56802}, {\"name\": \"Yisheng Guan\", \"id\": 327427}, {\"name\": \"Fengyu Xu\", \"id\": 711628}, {\"name\": \"Seung-kook Yun\", \"id\": 632014}, {\"name\": \"Carlos Viegas\", \"id\": 604942}, {\"name\": \"Roque J. Saltar\\u00e9n\", \"id\": 227569}, {\"name\": \"Eugenio Yime\", \"id\": 227570}, {\"name\": \"Rafael Aracil\", \"id\": 25395}, {\"name\": \"Anibal T. de Almeida\", \"id\": 267891}, {\"name\": \"Jos\\u00e9 Maria Azor\\u00edn\", \"id\": 183797}, {\"name\": \"Daniela Rus\", \"id\": 18837}, {\"name\": \"Mahmoud Tavakoli\", \"id\": 175098}, {\"name\": \"Manuel Ferre\", \"id\": 22299}, {\"name\": \"Yangsheng Xu\", \"id\": 252894}], \"links\": [{\"source\": 56802, \"target\": 25395}, {\"source\": 56802, \"target\": 175098}, {\"source\": 56802, \"target\": 227569}, {\"source\": 56802, \"target\": 267891}, {\"source\": 56802, \"target\": 327427}, {\"source\": 56802, \"target\": 604942}, {\"source\": 327427, \"target\": 18837}, {\"source\": 327427, \"target\": 25395}, {\"source\": 327427, \"target\": 175098}, {\"source\": 327427, \"target\": 227569}, {\"source\": 711628, \"target\": 25395}, {\"source\": 711628, \"target\": 227569}, {\"source\": 632014, \"target\": 18837}, {\"source\": 632014, \"target\": 25395}, {\"source\": 632014, \"target\": 227569}, {\"source\": 604942, \"target\": 175098}, {\"source\": 604942, \"target\": 267891}, {\"source\": 604942, \"target\": 25395}, {\"source\": 604942, \"target\": 227569}, {\"source\": 227569, \"target\": 18837}, {\"source\": 227569, \"target\": 25395}, {\"source\": 227569, \"target\": 175098}, {\"source\": 227569, \"target\": 183797}, {\"source\": 227569, \"target\": 227570}, {\"source\": 227569, \"target\": 252894}, {\"source\": 227569, \"target\": 267891}, {\"source\": 227570, \"target\": 25395}, {\"source\": 25395, \"target\": 18837}, {\"source\": 25395, \"target\": 22299}, {\"source\": 25395, \"target\": 183797}, {\"source\": 25395, \"target\": 175098}, {\"source\": 25395, \"target\": 252894}, {\"source\": 25395, \"target\": 267891}, {\"source\": 267891, \"target\": 175098}, {\"source\": 183797, \"target\": 22299}, {\"source\": 18837, \"target\": 22299}, {\"source\": 18837, \"target\": 252894}]}",
"id": 735,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Lino Marques, Yisheng Guan, Fengyu Xu, Carlos Viegas, Seung-kook Yun, Roque J. Saltarén, Eugenio Yime, Rafael Aracil, Anibal T. de Almeida, José Maria Azorín, Daniela Rus, Mahmoud Tavakoli, Manuel Ferre, Yangsheng Xu\n- Research collaborations between these authors: Lino Marques and Rafael Aracil, Lino Marques and Mahmoud Tavakoli, Lino Marques and Roque J. Saltarén, Lino Marques and Anibal T. de Almeida, Lino Marques and Yisheng Guan, Lino Marques and Carlos Viegas, Yisheng Guan and Daniela Rus, Yisheng Guan and Rafael Aracil, Yisheng Guan and Mahmoud Tavakoli, Yisheng Guan and Roque J. Saltarén, Fengyu Xu and Rafael Aracil, Fengyu Xu and Roque J. Saltarén, Carlos Viegas and Mahmoud Tavakoli, Carlos Viegas and Anibal T. de Almeida, Carlos Viegas and Rafael Aracil, Carlos Viegas and Roque J. Saltarén, Seung-kook Yun and Daniela Rus, Seung-kook Yun and Rafael Aracil, Seung-kook Yun and Roque J. Saltarén, Roque J. Saltarén and Daniela Rus, Roque J. Saltarén and Rafael Aracil, Roque J. Saltarén and Mahmoud Tavakoli, Roque J. Saltarén and José Maria Azorín, Roque J. Saltarén and Eugenio Yime, Roque J. Saltarén and Yangsheng Xu, Roque J. Saltarén and Anibal T. de Almeida, Eugenio Yime and Rafael Aracil, Rafael Aracil and Daniela Rus, Rafael Aracil and Manuel Ferre, Rafael Aracil and José Maria Azorín, Rafael Aracil and Mahmoud Tavakoli, Rafael Aracil and Yangsheng Xu, Rafael Aracil and Anibal T. de Almeida, Anibal T. de Almeida and Mahmoud Tavakoli, José Maria Azorín and Manuel Ferre, Daniela Rus and Manuel Ferre, Daniela Rus and Yangsheng Xu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Xiaojun Wang, Bijan Parsia, Hongbing Wang, Soundar R. T. Kumara, Allel Hadjali, Srini Narayanan, Anupriya Ankolekar, Ian Horrocks, Chien-Hsiang Lee, Miroslaw Malek, David Poole, Karim Benouaret, Qin Wu, Hongbign Wang\n- Research collaborations between these authors: Xiaojun Wang and Hongbing Wang, Xiaojun Wang and Qin Wu, Xiaojun Wang and Bijan Parsia, Bijan Parsia and Hongbing Wang, Bijan Parsia and Ian Horrocks, Bijan Parsia and Srini Narayanan, Hongbing Wang and Ian Horrocks, Hongbing Wang and Qin Wu, Hongbing Wang and Miroslaw Malek, Hongbing Wang and Soundar R. T. Kumara, Hongbing Wang and Anupriya Ankolekar, Hongbing Wang and David Poole, Hongbing Wang and Srini Narayanan, Hongbing Wang and Chien-Hsiang Lee, Hongbing Wang and Allel Hadjali, Hongbing Wang and Karim Benouaret, Hongbing Wang and Hongbign Wang, Allel Hadjali and Karim Benouaret, Srini Narayanan and Miroslaw Malek, Srini Narayanan and Anupriya Ankolekar, Anupriya Ankolekar and Ian Horrocks.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Xiaojun Wang\", \"id\": 110113}, {\"name\": \"Soundar R. T. Kumara\", \"id\": 46979}, {\"name\": \"Hongbing Wang\", \"id\": 12036}, {\"name\": \"Bijan Parsia\", \"id\": 14179}, {\"name\": \"Allel Hadjali\", \"id\": 31558}, {\"name\": \"Srini Narayanan\", \"id\": 158441}, {\"name\": \"Anupriya Ankolekar\", \"id\": 53897}, {\"name\": \"Ian Horrocks\", \"id\": 18063}, {\"name\": \"Chien-Hsiang Lee\", \"id\": 485168}, {\"name\": \"Miroslaw Malek\", \"id\": 46644}, {\"name\": \"David Poole\", \"id\": 78967}, {\"name\": \"Karim Benouaret\", \"id\": 81688}, {\"name\": \"Qin Wu\", \"id\": 36633}, {\"name\": \"Hongbign Wang\", \"id\": 1353438}], \"links\": [{\"source\": 110113, \"target\": 12036}, {\"source\": 110113, \"target\": 36633}, {\"source\": 110113, \"target\": 14179}, {\"source\": 46979, \"target\": 12036}, {\"source\": 12036, \"target\": 14179}, {\"source\": 12036, \"target\": 18063}, {\"source\": 12036, \"target\": 36633}, {\"source\": 12036, \"target\": 46644}, {\"source\": 12036, \"target\": 53897}, {\"source\": 12036, \"target\": 78967}, {\"source\": 12036, \"target\": 158441}, {\"source\": 12036, \"target\": 485168}, {\"source\": 12036, \"target\": 31558}, {\"source\": 12036, \"target\": 81688}, {\"source\": 12036, \"target\": 1353438}, {\"source\": 14179, \"target\": 18063}, {\"source\": 14179, \"target\": 158441}, {\"source\": 31558, \"target\": 81688}, {\"source\": 158441, \"target\": 46644}, {\"source\": 158441, \"target\": 53897}, {\"source\": 53897, \"target\": 18063}]}",
"id": 1177,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Xiaojun Wang, Bijan Parsia, Hongbing Wang, Soundar R. T. Kumara, Allel Hadjali, Srini Narayanan, Anupriya Ankolekar, Ian Horrocks, Chien-Hsiang Lee, Miroslaw Malek, David Poole, Karim Benouaret, Qin Wu, Hongbign Wang\n- Research collaborations between these authors: Xiaojun Wang and Hongbing Wang, Xiaojun Wang and Qin Wu, Xiaojun Wang and Bijan Parsia, Bijan Parsia and Hongbing Wang, Bijan Parsia and Ian Horrocks, Bijan Parsia and Srini Narayanan, Hongbing Wang and Ian Horrocks, Hongbing Wang and Qin Wu, Hongbing Wang and Miroslaw Malek, Hongbing Wang and Soundar R. T. Kumara, Hongbing Wang and Anupriya Ankolekar, Hongbing Wang and David Poole, Hongbing Wang and Srini Narayanan, Hongbing Wang and Chien-Hsiang Lee, Hongbing Wang and Allel Hadjali, Hongbing Wang and Karim Benouaret, Hongbing Wang and Hongbign Wang, Allel Hadjali and Karim Benouaret, Srini Narayanan and Miroslaw Malek, Srini Narayanan and Anupriya Ankolekar, Anupriya Ankolekar and Ian Horrocks.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Rocco Gasteiger, Frédo Durand, Alejandro F. Frangi, Helwig Hauser, Holger Theisel, Bernhard Preim, Oliver Beuing, Kai Lawonn, Samuel Voss, Matthias Gutberlet, Mathias Neugebauer, Tobias Isenberg, Martin Skalej, Anna Vilanova\n- Research collaborations between these authors: Rocco Gasteiger and Bernhard Preim, Rocco Gasteiger and Tobias Isenberg, Rocco Gasteiger and Mathias Neugebauer, Rocco Gasteiger and Kai Lawonn, Rocco Gasteiger and Alejandro F. Frangi, Rocco Gasteiger and Helwig Hauser, Rocco Gasteiger and Martin Skalej, Rocco Gasteiger and Anna Vilanova, Rocco Gasteiger and Oliver Beuing, Rocco Gasteiger and Holger Theisel, Rocco Gasteiger and Matthias Gutberlet, Rocco Gasteiger and Samuel Voss, Frédo Durand and Bernhard Preim, Frédo Durand and Kai Lawonn, Frédo Durand and Tobias Isenberg, Alejandro F. Frangi and Bernhard Preim, Alejandro F. Frangi and Mathias Neugebauer, Alejandro F. Frangi and Kai Lawonn, Helwig Hauser and Bernhard Preim, Helwig Hauser and Tobias Isenberg, Helwig Hauser and Mathias Neugebauer, Helwig Hauser and Kai Lawonn, Helwig Hauser and Holger Theisel, Helwig Hauser and Anna Vilanova, Helwig Hauser and Oliver Beuing, Holger Theisel and Bernhard Preim, Holger Theisel and Kai Lawonn, Holger Theisel and Mathias Neugebauer, Holger Theisel and Martin Skalej, Holger Theisel and Anna Vilanova, Holger Theisel and Oliver Beuing, Bernhard Preim and Tobias Isenberg, Bernhard Preim and Mathias Neugebauer, Bernhard Preim and Kai Lawonn, Bernhard Preim and Martin Skalej, Bernhard Preim and Matthias Gutberlet, Bernhard Preim and Anna Vilanova, Bernhard Preim and Oliver Beuing, Bernhard Preim and Samuel Voss, Oliver Beuing and Mathias Neugebauer, Oliver Beuing and Kai Lawonn, Oliver Beuing and Martin Skalej, Oliver Beuing and Matthias Gutberlet, Oliver Beuing and Anna Vilanova, Kai Lawonn and Tobias Isenberg, Kai Lawonn and Mathias Neugebauer, Kai Lawonn and Martin Skalej, Kai Lawonn and Matthias Gutberlet, Kai Lawonn and Anna Vilanova, Kai Lawonn and Samuel Voss, Samuel Voss and Anna Vilanova, Matthias Gutberlet and Mathias Neugebauer, Matthias Gutberlet and Anna Vilanova, Mathias Neugebauer and Tobias Isenberg, Mathias Neugebauer and Martin Skalej, Mathias Neugebauer and Anna Vilanova, Tobias Isenberg and Anna Vilanova, Martin Skalej and Anna Vilanova.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Rocco Gasteiger\", \"id\": 26560}, {\"name\": \"Fr\\u00e9do Durand\", \"id\": 244674}, {\"name\": \"Alejandro F. Frangi\", \"id\": 546}, {\"name\": \"Helwig Hauser\", \"id\": 61508}, {\"name\": \"Holger Theisel\", \"id\": 109542}, {\"name\": \"Bernhard Preim\", \"id\": 2759}, {\"name\": \"Oliver Beuing\", \"id\": 498504}, {\"name\": \"Kai Lawonn\", \"id\": 24430}, {\"name\": \"Samuel Voss\", \"id\": 1282224}, {\"name\": \"Matthias Gutberlet\", \"id\": 253841}, {\"name\": \"Mathias Neugebauer\", \"id\": 21010}, {\"name\": \"Tobias Isenberg\", \"id\": 5268}, {\"name\": \"Martin Skalej\", \"id\": 186778}, {\"name\": \"Anna Vilanova\", \"id\": 279358}], \"links\": [{\"source\": 26560, \"target\": 2759}, {\"source\": 26560, \"target\": 5268}, {\"source\": 26560, \"target\": 21010}, {\"source\": 26560, \"target\": 24430}, {\"source\": 26560, \"target\": 546}, {\"source\": 26560, \"target\": 61508}, {\"source\": 26560, \"target\": 186778}, {\"source\": 26560, \"target\": 279358}, {\"source\": 26560, \"target\": 498504}, {\"source\": 26560, \"target\": 109542}, {\"source\": 26560, \"target\": 253841}, {\"source\": 26560, \"target\": 1282224}, {\"source\": 244674, \"target\": 2759}, {\"source\": 244674, \"target\": 24430}, {\"source\": 244674, \"target\": 5268}, {\"source\": 546, \"target\": 2759}, {\"source\": 546, \"target\": 21010}, {\"source\": 546, \"target\": 24430}, {\"source\": 61508, \"target\": 2759}, {\"source\": 61508, \"target\": 5268}, {\"source\": 61508, \"target\": 21010}, {\"source\": 61508, \"target\": 24430}, {\"source\": 61508, \"target\": 109542}, {\"source\": 61508, \"target\": 279358}, {\"source\": 61508, \"target\": 498504}, {\"source\": 109542, \"target\": 2759}, {\"source\": 109542, \"target\": 24430}, {\"source\": 109542, \"target\": 21010}, {\"source\": 109542, \"target\": 186778}, {\"source\": 109542, \"target\": 279358}, {\"source\": 109542, \"target\": 498504}, {\"source\": 2759, \"target\": 5268}, {\"source\": 2759, \"target\": 21010}, {\"source\": 2759, \"target\": 24430}, {\"source\": 2759, \"target\": 186778}, {\"source\": 2759, \"target\": 253841}, {\"source\": 2759, \"target\": 279358}, {\"source\": 2759, \"target\": 498504}, {\"source\": 2759, \"target\": 1282224}, {\"source\": 498504, \"target\": 21010}, {\"source\": 498504, \"target\": 24430}, {\"source\": 498504, \"target\": 186778}, {\"source\": 498504, \"target\": 253841}, {\"source\": 498504, \"target\": 279358}, {\"source\": 24430, \"target\": 5268}, {\"source\": 24430, \"target\": 21010}, {\"source\": 24430, \"target\": 186778}, {\"source\": 24430, \"target\": 253841}, {\"source\": 24430, \"target\": 279358}, {\"source\": 24430, \"target\": 1282224}, {\"source\": 1282224, \"target\": 279358}, {\"source\": 253841, \"target\": 21010}, {\"source\": 253841, \"target\": 279358}, {\"source\": 21010, \"target\": 5268}, {\"source\": 21010, \"target\": 186778}, {\"source\": 21010, \"target\": 279358}, {\"source\": 5268, \"target\": 279358}, {\"source\": 186778, \"target\": 279358}]}",
"id": 605,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Rocco Gasteiger, Frédo Durand, Alejandro F. Frangi, Helwig Hauser, Holger Theisel, Bernhard Preim, Oliver Beuing, Kai Lawonn, Samuel Voss, Matthias Gutberlet, Mathias Neugebauer, Tobias Isenberg, Martin Skalej, Anna Vilanova\n- Research collaborations between these authors: Rocco Gasteiger and Bernhard Preim, Rocco Gasteiger and Tobias Isenberg, Rocco Gasteiger and Mathias Neugebauer, Rocco Gasteiger and Kai Lawonn, Rocco Gasteiger and Alejandro F. Frangi, Rocco Gasteiger and Helwig Hauser, Rocco Gasteiger and Martin Skalej, Rocco Gasteiger and Anna Vilanova, Rocco Gasteiger and Oliver Beuing, Rocco Gasteiger and Holger Theisel, Rocco Gasteiger and Matthias Gutberlet, Rocco Gasteiger and Samuel Voss, Frédo Durand and Bernhard Preim, Frédo Durand and Kai Lawonn, Frédo Durand and Tobias Isenberg, Alejandro F. Frangi and Bernhard Preim, Alejandro F. Frangi and Mathias Neugebauer, Alejandro F. Frangi and Kai Lawonn, Helwig Hauser and Bernhard Preim, Helwig Hauser and Tobias Isenberg, Helwig Hauser and Mathias Neugebauer, Helwig Hauser and Kai Lawonn, Helwig Hauser and Holger Theisel, Helwig Hauser and Anna Vilanova, Helwig Hauser and Oliver Beuing, Holger Theisel and Bernhard Preim, Holger Theisel and Kai Lawonn, Holger Theisel and Mathias Neugebauer, Holger Theisel and Martin Skalej, Holger Theisel and Anna Vilanova, Holger Theisel and Oliver Beuing, Bernhard Preim and Tobias Isenberg, Bernhard Preim and Mathias Neugebauer, Bernhard Preim and Kai Lawonn, Bernhard Preim and Martin Skalej, Bernhard Preim and Matthias Gutberlet, Bernhard Preim and Anna Vilanova, Bernhard Preim and Oliver Beuing, Bernhard Preim and Samuel Voss, Oliver Beuing and Mathias Neugebauer, Oliver Beuing and Kai Lawonn, Oliver Beuing and Martin Skalej, Oliver Beuing and Matthias Gutberlet, Oliver Beuing and Anna Vilanova, Kai Lawonn and Tobias Isenberg, Kai Lawonn and Mathias Neugebauer, Kai Lawonn and Martin Skalej, Kai Lawonn and Matthias Gutberlet, Kai Lawonn and Anna Vilanova, Kai Lawonn and Samuel Voss, Samuel Voss and Anna Vilanova, Matthias Gutberlet and Mathias Neugebauer, Matthias Gutberlet and Anna Vilanova, Mathias Neugebauer and Tobias Isenberg, Mathias Neugebauer and Martin Skalej, Mathias Neugebauer and Anna Vilanova, Tobias Isenberg and Anna Vilanova, Martin Skalej and Anna Vilanova.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wangmeng Zuo, Rafael Molina, Frédo Durand, Terence Tao, Shinichi Nakajima, S. Derin Babacan, Andrew Zisserman, Peyman Milanfar, David P. Wipf, Zhihui Wei, Guillaume Bouchard, Zhaofu Chen, Minh N. Do, Michael Elad\n- Research collaborations between these authors: Wangmeng Zuo and Andrew Zisserman, Wangmeng Zuo and S. Derin Babacan, Wangmeng Zuo and Rafael Molina, Wangmeng Zuo and Peyman Milanfar, Wangmeng Zuo and Michael Elad, Wangmeng Zuo and Frédo Durand, Rafael Molina and Shinichi Nakajima, Rafael Molina and S. Derin Babacan, Rafael Molina and Zhihui Wei, Rafael Molina and David P. Wipf, Rafael Molina and Andrew Zisserman, Rafael Molina and Peyman Milanfar, Rafael Molina and Minh N. Do, Rafael Molina and Michael Elad, Rafael Molina and Terence Tao, Rafael Molina and Frédo Durand, Rafael Molina and Zhaofu Chen, Frédo Durand and Andrew Zisserman, Frédo Durand and S. Derin Babacan, Frédo Durand and Zhihui Wei, Frédo Durand and David P. Wipf, Frédo Durand and Peyman Milanfar, Frédo Durand and Minh N. Do, Frédo Durand and Michael Elad, Terence Tao and S. Derin Babacan, Terence Tao and Zhihui Wei, Terence Tao and David P. Wipf, Terence Tao and Minh N. Do, Terence Tao and Michael Elad, Shinichi Nakajima and Guillaume Bouchard, Shinichi Nakajima and Andrew Zisserman, Shinichi Nakajima and S. Derin Babacan, S. Derin Babacan and Guillaume Bouchard, S. Derin Babacan and Andrew Zisserman, S. Derin Babacan and David P. Wipf, S. Derin Babacan and Peyman Milanfar, S. Derin Babacan and Minh N. Do, S. Derin Babacan and Michael Elad, S. Derin Babacan and Zhihui Wei, S. Derin Babacan and Zhaofu Chen, Andrew Zisserman and Peyman Milanfar, Andrew Zisserman and Michael Elad, Andrew Zisserman and Zhihui Wei, Andrew Zisserman and David P. Wipf, Andrew Zisserman and Minh N. Do, Peyman Milanfar and Zhihui Wei, Peyman Milanfar and David P. Wipf, Peyman Milanfar and Michael Elad, Peyman Milanfar and Minh N. Do, David P. Wipf and Zhihui Wei, David P. Wipf and Minh N. Do, David P. Wipf and Michael Elad, Zhihui Wei and Minh N. Do, Zhihui Wei and Michael Elad, Minh N. Do and Michael Elad.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Fr\\u00e9do Durand\", \"id\": 244674}, {\"name\": \"Rafael Molina\", \"id\": 91139}, {\"name\": \"Wangmeng Zuo\", \"id\": 2402}, {\"name\": \"Terence Tao\", \"id\": 227366}, {\"name\": \"Shinichi Nakajima\", \"id\": 22377}, {\"name\": \"S. Derin Babacan\", \"id\": 69963}, {\"name\": \"Andrew Zisserman\", \"id\": 62508}, {\"name\": \"Peyman Milanfar\", \"id\": 138669}, {\"name\": \"David P. Wipf\", \"id\": 82126}, {\"name\": \"Zhihui Wei\", \"id\": 78604}, {\"name\": \"Guillaume Bouchard\", \"id\": 58128}, {\"name\": \"Zhaofu Chen\", \"id\": 364978}, {\"name\": \"Minh N. Do\", \"id\": 143635}, {\"name\": \"Michael Elad\", \"id\": 144447}], \"links\": [{\"source\": 244674, \"target\": 2402}, {\"source\": 244674, \"target\": 62508}, {\"source\": 244674, \"target\": 69963}, {\"source\": 244674, \"target\": 78604}, {\"source\": 244674, \"target\": 82126}, {\"source\": 244674, \"target\": 91139}, {\"source\": 244674, \"target\": 138669}, {\"source\": 244674, \"target\": 143635}, {\"source\": 244674, \"target\": 144447}, {\"source\": 91139, \"target\": 2402}, {\"source\": 91139, \"target\": 22377}, {\"source\": 91139, \"target\": 69963}, {\"source\": 91139, \"target\": 78604}, {\"source\": 91139, \"target\": 82126}, {\"source\": 91139, \"target\": 62508}, {\"source\": 91139, \"target\": 138669}, {\"source\": 91139, \"target\": 143635}, {\"source\": 91139, \"target\": 144447}, {\"source\": 91139, \"target\": 227366}, {\"source\": 91139, \"target\": 364978}, {\"source\": 2402, \"target\": 62508}, {\"source\": 2402, \"target\": 69963}, {\"source\": 2402, \"target\": 138669}, {\"source\": 2402, \"target\": 144447}, {\"source\": 227366, \"target\": 69963}, {\"source\": 227366, \"target\": 78604}, {\"source\": 227366, \"target\": 82126}, {\"source\": 227366, \"target\": 143635}, {\"source\": 227366, \"target\": 144447}, {\"source\": 22377, \"target\": 58128}, {\"source\": 22377, \"target\": 62508}, {\"source\": 22377, \"target\": 69963}, {\"source\": 69963, \"target\": 58128}, {\"source\": 69963, \"target\": 62508}, {\"source\": 69963, \"target\": 82126}, {\"source\": 69963, \"target\": 138669}, {\"source\": 69963, \"target\": 143635}, {\"source\": 69963, \"target\": 144447}, {\"source\": 69963, \"target\": 78604}, {\"source\": 69963, \"target\": 364978}, {\"source\": 62508, \"target\": 138669}, {\"source\": 62508, \"target\": 144447}, {\"source\": 62508, \"target\": 78604}, {\"source\": 62508, \"target\": 82126}, {\"source\": 62508, \"target\": 143635}, {\"source\": 138669, \"target\": 78604}, {\"source\": 138669, \"target\": 82126}, {\"source\": 138669, \"target\": 144447}, {\"source\": 138669, \"target\": 143635}, {\"source\": 82126, \"target\": 78604}, {\"source\": 82126, \"target\": 143635}, {\"source\": 82126, \"target\": 144447}, {\"source\": 78604, \"target\": 143635}, {\"source\": 78604, \"target\": 144447}, {\"source\": 143635, \"target\": 144447}]}",
"id": 2562,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wangmeng Zuo, Rafael Molina, Frédo Durand, Terence Tao, Shinichi Nakajima, S. Derin Babacan, Andrew Zisserman, Peyman Milanfar, David P. Wipf, Zhihui Wei, Guillaume Bouchard, Zhaofu Chen, Minh N. Do, Michael Elad\n- Research collaborations between these authors: Wangmeng Zuo and Andrew Zisserman, Wangmeng Zuo and S. Derin Babacan, Wangmeng Zuo and Rafael Molina, Wangmeng Zuo and Peyman Milanfar, Wangmeng Zuo and Michael Elad, Wangmeng Zuo and Frédo Durand, Rafael Molina and Shinichi Nakajima, Rafael Molina and S. Derin Babacan, Rafael Molina and Zhihui Wei, Rafael Molina and David P. Wipf, Rafael Molina and Andrew Zisserman, Rafael Molina and Peyman Milanfar, Rafael Molina and Minh N. Do, Rafael Molina and Michael Elad, Rafael Molina and Terence Tao, Rafael Molina and Frédo Durand, Rafael Molina and Zhaofu Chen, Frédo Durand and Andrew Zisserman, Frédo Durand and S. Derin Babacan, Frédo Durand and Zhihui Wei, Frédo Durand and David P. Wipf, Frédo Durand and Peyman Milanfar, Frédo Durand and Minh N. Do, Frédo Durand and Michael Elad, Terence Tao and S. Derin Babacan, Terence Tao and Zhihui Wei, Terence Tao and David P. Wipf, Terence Tao and Minh N. Do, Terence Tao and Michael Elad, Shinichi Nakajima and Guillaume Bouchard, Shinichi Nakajima and Andrew Zisserman, Shinichi Nakajima and S. Derin Babacan, S. Derin Babacan and Guillaume Bouchard, S. Derin Babacan and Andrew Zisserman, S. Derin Babacan and David P. Wipf, S. Derin Babacan and Peyman Milanfar, S. Derin Babacan and Minh N. Do, S. Derin Babacan and Michael Elad, S. Derin Babacan and Zhihui Wei, S. Derin Babacan and Zhaofu Chen, Andrew Zisserman and Peyman Milanfar, Andrew Zisserman and Michael Elad, Andrew Zisserman and Zhihui Wei, Andrew Zisserman and David P. Wipf, Andrew Zisserman and Minh N. Do, Peyman Milanfar and Zhihui Wei, Peyman Milanfar and David P. Wipf, Peyman Milanfar and Michael Elad, Peyman Milanfar and Minh N. Do, David P. Wipf and Zhihui Wei, David P. Wipf and Minh N. Do, David P. Wipf and Michael Elad, Zhihui Wei and Minh N. Do, Zhihui Wei and Michael Elad, Minh N. Do and Michael Elad.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Javier Sedano, Concha Bielza, José Ramón Villar, Maritza Correa, Joaquim Ciurana, José R. Alique, Juan José Rodríguez, Maciej Grzenda, Andres Bustillo, Silvia González, Daniel Teixidor, Guillem Quintana, Emilio Corchado, Álvaro Herrero\n- Research collaborations between these authors: Javier Sedano and Emilio Corchado, Javier Sedano and José Ramón Villar, Javier Sedano and Silvia González, Javier Sedano and Álvaro Herrero, Javier Sedano and Joaquim Ciurana, Concha Bielza and Maciej Grzenda, Concha Bielza and Andres Bustillo, Concha Bielza and Joaquim Ciurana, Concha Bielza and Maritza Correa, Concha Bielza and Guillem Quintana, José Ramón Villar and Emilio Corchado, José Ramón Villar and Silvia González, José Ramón Villar and Álvaro Herrero, José Ramón Villar and Joaquim Ciurana, Maritza Correa and Maciej Grzenda, Maritza Correa and Andres Bustillo, Maritza Correa and Joaquim Ciurana, Maritza Correa and José R. Alique, Maritza Correa and Guillem Quintana, Joaquim Ciurana and Maciej Grzenda, Joaquim Ciurana and Andres Bustillo, Joaquim Ciurana and Silvia González, Joaquim Ciurana and Emilio Corchado, Joaquim Ciurana and Juan José Rodríguez, Joaquim Ciurana and Guillem Quintana, José R. Alique and Andres Bustillo, Juan José Rodríguez and Andres Bustillo, Maciej Grzenda and Andres Bustillo, Maciej Grzenda and Guillem Quintana, Andres Bustillo and Emilio Corchado, Andres Bustillo and Guillem Quintana, Andres Bustillo and Daniel Teixidor, Silvia González and Emilio Corchado, Silvia González and Álvaro Herrero, Daniel Teixidor and Guillem Quintana, Emilio Corchado and Álvaro Herrero.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Javier Sedano\", \"id\": 23814}, {\"name\": \"Joaquim Ciurana\", \"id\": 133799}, {\"name\": \"Jos\\u00e9 Ram\\u00f3n Villar\", \"id\": 23815}, {\"name\": \"Maritza Correa\", \"id\": 258057}, {\"name\": \"Concha Bielza\", \"id\": 99719}, {\"name\": \"Jos\\u00e9 R. Alique\", \"id\": 258058}, {\"name\": \"Juan Jos\\u00e9 Rodr\\u00edguez\", \"id\": 50638}, {\"name\": \"Andres Bustillo\", \"id\": 50639}, {\"name\": \"Silvia Gonz\\u00e1lez\", \"id\": 55247}, {\"name\": \"Daniel Teixidor\", \"id\": 558710}, {\"name\": \"Maciej Grzenda\", \"id\": 26487}, {\"name\": \"Emilio Corchado\", \"id\": 13784}, {\"name\": \"\\u00c1lvaro Herrero\", \"id\": 76153}, {\"name\": \"Guillem Quintana\", \"id\": 357751}], \"links\": [{\"source\": 23814, \"target\": 13784}, {\"source\": 23814, \"target\": 23815}, {\"source\": 23814, \"target\": 55247}, {\"source\": 23814, \"target\": 76153}, {\"source\": 23814, \"target\": 133799}, {\"source\": 133799, \"target\": 26487}, {\"source\": 133799, \"target\": 50639}, {\"source\": 133799, \"target\": 55247}, {\"source\": 133799, \"target\": 13784}, {\"source\": 133799, \"target\": 23815}, {\"source\": 133799, \"target\": 50638}, {\"source\": 133799, \"target\": 99719}, {\"source\": 133799, \"target\": 258057}, {\"source\": 133799, \"target\": 357751}, {\"source\": 23815, \"target\": 13784}, {\"source\": 23815, \"target\": 55247}, {\"source\": 23815, \"target\": 76153}, {\"source\": 258057, \"target\": 26487}, {\"source\": 258057, \"target\": 50639}, {\"source\": 258057, \"target\": 99719}, {\"source\": 258057, \"target\": 258058}, {\"source\": 258057, \"target\": 357751}, {\"source\": 99719, \"target\": 26487}, {\"source\": 99719, \"target\": 50639}, {\"source\": 99719, \"target\": 357751}, {\"source\": 258058, \"target\": 50639}, {\"source\": 50638, \"target\": 50639}, {\"source\": 50639, \"target\": 26487}, {\"source\": 50639, \"target\": 13784}, {\"source\": 50639, \"target\": 357751}, {\"source\": 50639, \"target\": 558710}, {\"source\": 55247, \"target\": 13784}, {\"source\": 55247, \"target\": 76153}, {\"source\": 558710, \"target\": 357751}, {\"source\": 26487, \"target\": 357751}, {\"source\": 13784, \"target\": 76153}]}",
"id": 2854,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Javier Sedano, Concha Bielza, José Ramón Villar, Maritza Correa, Joaquim Ciurana, José R. Alique, Juan José Rodríguez, Maciej Grzenda, Andres Bustillo, Silvia González, Daniel Teixidor, Guillem Quintana, Emilio Corchado, Álvaro Herrero\n- Research collaborations between these authors: Javier Sedano and Emilio Corchado, Javier Sedano and José Ramón Villar, Javier Sedano and Silvia González, Javier Sedano and Álvaro Herrero, Javier Sedano and Joaquim Ciurana, Concha Bielza and Maciej Grzenda, Concha Bielza and Andres Bustillo, Concha Bielza and Joaquim Ciurana, Concha Bielza and Maritza Correa, Concha Bielza and Guillem Quintana, José Ramón Villar and Emilio Corchado, José Ramón Villar and Silvia González, José Ramón Villar and Álvaro Herrero, José Ramón Villar and Joaquim Ciurana, Maritza Correa and Maciej Grzenda, Maritza Correa and Andres Bustillo, Maritza Correa and Joaquim Ciurana, Maritza Correa and José R. Alique, Maritza Correa and Guillem Quintana, Joaquim Ciurana and Maciej Grzenda, Joaquim Ciurana and Andres Bustillo, Joaquim Ciurana and Silvia González, Joaquim Ciurana and Emilio Corchado, Joaquim Ciurana and Juan José Rodríguez, Joaquim Ciurana and Guillem Quintana, José R. Alique and Andres Bustillo, Juan José Rodríguez and Andres Bustillo, Maciej Grzenda and Andres Bustillo, Maciej Grzenda and Guillem Quintana, Andres Bustillo and Emilio Corchado, Andres Bustillo and Guillem Quintana, Andres Bustillo and Daniel Teixidor, Silvia González and Emilio Corchado, Silvia González and Álvaro Herrero, Daniel Teixidor and Guillem Quintana, Emilio Corchado and Álvaro Herrero.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Feng Ding, Yang Shi, Bing Chen, Yan Wang, Jing Chen, Dongqing Wang, Jie Ding, Tongwen Chen, Jie Jia, Shaocheng Tong, Ruifeng Ding, Yanjun Liu, Guangjun Liu, Xuehai Wang\n- Research collaborations between these authors: Feng Ding and Jie Ding, Feng Ding and Yan Wang, Feng Ding and Jing Chen, Feng Ding and Tongwen Chen, Feng Ding and Guangjun Liu, Feng Ding and Jie Jia, Feng Ding and Yang Shi, Feng Ding and Xuehai Wang, Feng Ding and Yanjun Liu, Feng Ding and Dongqing Wang, Feng Ding and Ruifeng Ding, Yang Shi and Jie Ding, Yang Shi and Jing Chen, Yang Shi and Tongwen Chen, Yang Shi and Guangjun Liu, Yang Shi and Shaocheng Tong, Yang Shi and Yanjun Liu, Yang Shi and Xuehai Wang, Yang Shi and Dongqing Wang, Yang Shi and Ruifeng Ding, Bing Chen and Shaocheng Tong, Bing Chen and Tongwen Chen, Bing Chen and Yanjun Liu, Yan Wang and Tongwen Chen, Yan Wang and Guangjun Liu, Yan Wang and Yanjun Liu, Yan Wang and Dongqing Wang, Jing Chen and Jie Ding, Jing Chen and Tongwen Chen, Jing Chen and Guangjun Liu, Jing Chen and Yanjun Liu, Jing Chen and Dongqing Wang, Jing Chen and Ruifeng Ding, Dongqing Wang and Jie Ding, Dongqing Wang and Guangjun Liu, Dongqing Wang and Jie Jia, Dongqing Wang and Xuehai Wang, Dongqing Wang and Yanjun Liu, Dongqing Wang and Tongwen Chen, Dongqing Wang and Ruifeng Ding, Jie Ding and Tongwen Chen, Jie Ding and Guangjun Liu, Jie Ding and Yanjun Liu, Jie Ding and Jie Jia, Jie Ding and Xuehai Wang, Jie Ding and Ruifeng Ding, Tongwen Chen and Guangjun Liu, Tongwen Chen and Jie Jia, Tongwen Chen and Xuehai Wang, Tongwen Chen and Yanjun Liu, Tongwen Chen and Ruifeng Ding, Jie Jia and Guangjun Liu, Jie Jia and Yanjun Liu, Jie Jia and Ruifeng Ding, Shaocheng Tong and Yanjun Liu, Ruifeng Ding and Guangjun Liu, Ruifeng Ding and Yanjun Liu, Yanjun Liu and Guangjun Liu, Yanjun Liu and Xuehai Wang, Guangjun Liu and Xuehai Wang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Feng Ding\", \"id\": 179904}, {\"name\": \"Jing Chen\", \"id\": 31182}, {\"name\": \"Dongqing Wang\", \"id\": 422768}, {\"name\": \"Jie Ding\", \"id\": 4657}, {\"name\": \"Yanjun Liu\", \"id\": 284888}, {\"name\": \"Xuehai Wang\", \"id\": 179903}, {\"name\": \"Tongwen Chen\", \"id\": 77172}, {\"name\": \"Jie Jia\", \"id\": 120564}, {\"name\": \"Shaocheng Tong\", \"id\": 59254}, {\"name\": \"Ruifeng Ding\", \"id\": 508727}, {\"name\": \"Yan Wang\", \"id\": 5656}, {\"name\": \"Yang Shi\", \"id\": 155769}, {\"name\": \"Guangjun Liu\", \"id\": 106233}, {\"name\": \"Bing Chen\", \"id\": 176479}], \"links\": [{\"source\": 179904, \"target\": 4657}, {\"source\": 179904, \"target\": 5656}, {\"source\": 179904, \"target\": 31182}, {\"source\": 179904, \"target\": 77172}, {\"source\": 179904, \"target\": 106233}, {\"source\": 179904, \"target\": 120564}, {\"source\": 179904, \"target\": 155769}, {\"source\": 179904, \"target\": 179903}, {\"source\": 179904, \"target\": 284888}, {\"source\": 179904, \"target\": 422768}, {\"source\": 179904, \"target\": 508727}, {\"source\": 31182, \"target\": 4657}, {\"source\": 31182, \"target\": 77172}, {\"source\": 31182, \"target\": 106233}, {\"source\": 31182, \"target\": 155769}, {\"source\": 31182, \"target\": 284888}, {\"source\": 31182, \"target\": 422768}, {\"source\": 31182, \"target\": 508727}, {\"source\": 422768, \"target\": 4657}, {\"source\": 422768, \"target\": 5656}, {\"source\": 422768, \"target\": 106233}, {\"source\": 422768, \"target\": 120564}, {\"source\": 422768, \"target\": 179903}, {\"source\": 422768, \"target\": 284888}, {\"source\": 422768, \"target\": 77172}, {\"source\": 422768, \"target\": 155769}, {\"source\": 422768, \"target\": 508727}, {\"source\": 4657, \"target\": 77172}, {\"source\": 4657, \"target\": 106233}, {\"source\": 4657, \"target\": 155769}, {\"source\": 4657, \"target\": 284888}, {\"source\": 4657, \"target\": 120564}, {\"source\": 4657, \"target\": 179903}, {\"source\": 4657, \"target\": 508727}, {\"source\": 284888, \"target\": 5656}, {\"source\": 284888, \"target\": 59254}, {\"source\": 284888, \"target\": 106233}, {\"source\": 284888, \"target\": 120564}, {\"source\": 284888, \"target\": 155769}, {\"source\": 284888, \"target\": 176479}, {\"source\": 284888, \"target\": 77172}, {\"source\": 284888, \"target\": 179903}, {\"source\": 284888, \"target\": 508727}, {\"source\": 179903, \"target\": 77172}, {\"source\": 179903, \"target\": 106233}, {\"source\": 179903, \"target\": 155769}, {\"source\": 77172, \"target\": 5656}, {\"source\": 77172, \"target\": 155769}, {\"source\": 77172, \"target\": 106233}, {\"source\": 77172, \"target\": 120564}, {\"source\": 77172, \"target\": 176479}, {\"source\": 77172, \"target\": 508727}, {\"source\": 120564, \"target\": 106233}, {\"source\": 120564, \"target\": 508727}, {\"source\": 59254, \"target\": 176479}, {\"source\": 59254, \"target\": 155769}, {\"source\": 508727, \"target\": 106233}, {\"source\": 508727, \"target\": 155769}, {\"source\": 5656, \"target\": 106233}, {\"source\": 155769, \"target\": 106233}]}",
"id": 44,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Feng Ding, Yang Shi, Bing Chen, Yan Wang, Jing Chen, Dongqing Wang, Jie Ding, Tongwen Chen, Jie Jia, Shaocheng Tong, Ruifeng Ding, Yanjun Liu, Guangjun Liu, Xuehai Wang\n- Research collaborations between these authors: Feng Ding and Jie Ding, Feng Ding and Yan Wang, Feng Ding and Jing Chen, Feng Ding and Tongwen Chen, Feng Ding and Guangjun Liu, Feng Ding and Jie Jia, Feng Ding and Yang Shi, Feng Ding and Xuehai Wang, Feng Ding and Yanjun Liu, Feng Ding and Dongqing Wang, Feng Ding and Ruifeng Ding, Yang Shi and Jie Ding, Yang Shi and Jing Chen, Yang Shi and Tongwen Chen, Yang Shi and Guangjun Liu, Yang Shi and Shaocheng Tong, Yang Shi and Yanjun Liu, Yang Shi and Xuehai Wang, Yang Shi and Dongqing Wang, Yang Shi and Ruifeng Ding, Bing Chen and Shaocheng Tong, Bing Chen and Tongwen Chen, Bing Chen and Yanjun Liu, Yan Wang and Tongwen Chen, Yan Wang and Guangjun Liu, Yan Wang and Yanjun Liu, Yan Wang and Dongqing Wang, Jing Chen and Jie Ding, Jing Chen and Tongwen Chen, Jing Chen and Guangjun Liu, Jing Chen and Yanjun Liu, Jing Chen and Dongqing Wang, Jing Chen and Ruifeng Ding, Dongqing Wang and Jie Ding, Dongqing Wang and Guangjun Liu, Dongqing Wang and Jie Jia, Dongqing Wang and Xuehai Wang, Dongqing Wang and Yanjun Liu, Dongqing Wang and Tongwen Chen, Dongqing Wang and Ruifeng Ding, Jie Ding and Tongwen Chen, Jie Ding and Guangjun Liu, Jie Ding and Yanjun Liu, Jie Ding and Jie Jia, Jie Ding and Xuehai Wang, Jie Ding and Ruifeng Ding, Tongwen Chen and Guangjun Liu, Tongwen Chen and Jie Jia, Tongwen Chen and Xuehai Wang, Tongwen Chen and Yanjun Liu, Tongwen Chen and Ruifeng Ding, Jie Jia and Guangjun Liu, Jie Jia and Yanjun Liu, Jie Jia and Ruifeng Ding, Shaocheng Tong and Yanjun Liu, Ruifeng Ding and Guangjun Liu, Ruifeng Ding and Yanjun Liu, Yanjun Liu and Guangjun Liu, Yanjun Liu and Xuehai Wang, Guangjun Liu and Xuehai Wang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Mario Garcia-Lozano, Silvia Ruiz, Karsten Brueninghaus, DongSeop Lee, D. Gonzalez, Joan J. Olmos, A. Serra, David González G, Klaus I. Pedersen, Gholam-ali Seraji, Silvia Ruiz Boque, David Astely, Angeliki Alexiou, Halim Yanikomeroglu\n- Research collaborations between these authors: Mario Garcia-Lozano and Silvia Ruiz, Mario Garcia-Lozano and Joan J. Olmos, Mario Garcia-Lozano and Halim Yanikomeroglu, Mario Garcia-Lozano and Klaus I. Pedersen, Mario Garcia-Lozano and Angeliki Alexiou, Mario Garcia-Lozano and David Astely, Mario Garcia-Lozano and A. Serra, Mario Garcia-Lozano and David González G, Mario Garcia-Lozano and Silvia Ruiz Boque, Mario Garcia-Lozano and D. Gonzalez, Mario Garcia-Lozano and Karsten Brueninghaus, Mario Garcia-Lozano and Gholam-ali Seraji, Mario Garcia-Lozano and DongSeop Lee, Silvia Ruiz and Joan J. Olmos, Silvia Ruiz and Halim Yanikomeroglu, Silvia Ruiz and Klaus I. Pedersen, Silvia Ruiz and Angeliki Alexiou, Silvia Ruiz and David Astely, Silvia Ruiz and A. Serra, Silvia Ruiz and David González G, Silvia Ruiz and D. Gonzalez, Silvia Ruiz and Karsten Brueninghaus, Silvia Ruiz and Gholam-ali Seraji, Silvia Ruiz and Silvia Ruiz Boque, Karsten Brueninghaus and Joan J. Olmos, Karsten Brueninghaus and Klaus I. Pedersen, DongSeop Lee and Joan J. Olmos, DongSeop Lee and David González G, D. Gonzalez and Joan J. Olmos, D. Gonzalez and David González G, Joan J. Olmos and Halim Yanikomeroglu, Joan J. Olmos and Klaus I. Pedersen, Joan J. Olmos and Angeliki Alexiou, Joan J. Olmos and David Astely, Joan J. Olmos and A. Serra, Joan J. Olmos and David González G, Joan J. Olmos and Gholam-ali Seraji, Joan J. Olmos and Silvia Ruiz Boque, A. Serra and David González G, David González G and Halim Yanikomeroglu, David González G and Klaus I. Pedersen, David González G and Silvia Ruiz Boque, Klaus I. Pedersen and Angeliki Alexiou, Klaus I. Pedersen and David Astely, Klaus I. Pedersen and Gholam-ali Seraji, Silvia Ruiz Boque and Halim Yanikomeroglu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Mario Garcia-Lozano\", \"id\": 170464}, {\"name\": \"Silvia Ruiz\", \"id\": 170465}, {\"name\": \"Karsten Brueninghaus\", \"id\": 1106180}, {\"name\": \"DongSeop Lee\", \"id\": 670725}, {\"name\": \"D. Gonzalez\", \"id\": 791174}, {\"name\": \"Joan J. Olmos\", \"id\": 216295}, {\"name\": \"A. Serra\", \"id\": 319240}, {\"name\": \"David Gonz\\u00e1lez G\", \"id\": 381065}, {\"name\": \"Klaus I. Pedersen\", \"id\": 261609}, {\"name\": \"Gholam-ali Seraji\", \"id\": 1106182}, {\"name\": \"Silvia Ruiz Boque\", \"id\": 395987}, {\"name\": \"David Astely\", \"id\": 271671}, {\"name\": \"Angeliki Alexiou\", \"id\": 262814}, {\"name\": \"Halim Yanikomeroglu\", \"id\": 232799}], \"links\": [{\"source\": 170464, \"target\": 170465}, {\"source\": 170464, \"target\": 216295}, {\"source\": 170464, \"target\": 232799}, {\"source\": 170464, \"target\": 261609}, {\"source\": 170464, \"target\": 262814}, {\"source\": 170464, \"target\": 271671}, {\"source\": 170464, \"target\": 319240}, {\"source\": 170464, \"target\": 381065}, {\"source\": 170464, \"target\": 395987}, {\"source\": 170464, \"target\": 791174}, {\"source\": 170464, \"target\": 1106180}, {\"source\": 170464, \"target\": 1106182}, {\"source\": 170464, \"target\": 670725}, {\"source\": 170465, \"target\": 216295}, {\"source\": 170465, \"target\": 232799}, {\"source\": 170465, \"target\": 261609}, {\"source\": 170465, \"target\": 262814}, {\"source\": 170465, \"target\": 271671}, {\"source\": 170465, \"target\": 319240}, {\"source\": 170465, \"target\": 381065}, {\"source\": 170465, \"target\": 791174}, {\"source\": 170465, \"target\": 1106180}, {\"source\": 170465, \"target\": 1106182}, {\"source\": 170465, \"target\": 395987}, {\"source\": 1106180, \"target\": 216295}, {\"source\": 1106180, \"target\": 261609}, {\"source\": 670725, \"target\": 216295}, {\"source\": 670725, \"target\": 381065}, {\"source\": 791174, \"target\": 216295}, {\"source\": 791174, \"target\": 381065}, {\"source\": 216295, \"target\": 232799}, {\"source\": 216295, \"target\": 261609}, {\"source\": 216295, \"target\": 262814}, {\"source\": 216295, \"target\": 271671}, {\"source\": 216295, \"target\": 319240}, {\"source\": 216295, \"target\": 381065}, {\"source\": 216295, \"target\": 1106182}, {\"source\": 216295, \"target\": 395987}, {\"source\": 319240, \"target\": 381065}, {\"source\": 381065, \"target\": 232799}, {\"source\": 381065, \"target\": 261609}, {\"source\": 381065, \"target\": 395987}, {\"source\": 261609, \"target\": 262814}, {\"source\": 261609, \"target\": 271671}, {\"source\": 261609, \"target\": 1106182}, {\"source\": 395987, \"target\": 232799}]}",
"id": 2391,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Mario Garcia-Lozano, Silvia Ruiz, Karsten Brueninghaus, DongSeop Lee, D. Gonzalez, Joan J. Olmos, A. Serra, David González G, Klaus I. Pedersen, Gholam-ali Seraji, Silvia Ruiz Boque, David Astely, Angeliki Alexiou, Halim Yanikomeroglu\n- Research collaborations between these authors: Mario Garcia-Lozano and Silvia Ruiz, Mario Garcia-Lozano and Joan J. Olmos, Mario Garcia-Lozano and Halim Yanikomeroglu, Mario Garcia-Lozano and Klaus I. Pedersen, Mario Garcia-Lozano and Angeliki Alexiou, Mario Garcia-Lozano and David Astely, Mario Garcia-Lozano and A. Serra, Mario Garcia-Lozano and David González G, Mario Garcia-Lozano and Silvia Ruiz Boque, Mario Garcia-Lozano and D. Gonzalez, Mario Garcia-Lozano and Karsten Brueninghaus, Mario Garcia-Lozano and Gholam-ali Seraji, Mario Garcia-Lozano and DongSeop Lee, Silvia Ruiz and Joan J. Olmos, Silvia Ruiz and Halim Yanikomeroglu, Silvia Ruiz and Klaus I. Pedersen, Silvia Ruiz and Angeliki Alexiou, Silvia Ruiz and David Astely, Silvia Ruiz and A. Serra, Silvia Ruiz and David González G, Silvia Ruiz and D. Gonzalez, Silvia Ruiz and Karsten Brueninghaus, Silvia Ruiz and Gholam-ali Seraji, Silvia Ruiz and Silvia Ruiz Boque, Karsten Brueninghaus and Joan J. Olmos, Karsten Brueninghaus and Klaus I. Pedersen, DongSeop Lee and Joan J. Olmos, DongSeop Lee and David González G, D. Gonzalez and Joan J. Olmos, D. Gonzalez and David González G, Joan J. Olmos and Halim Yanikomeroglu, Joan J. Olmos and Klaus I. Pedersen, Joan J. Olmos and Angeliki Alexiou, Joan J. Olmos and David Astely, Joan J. Olmos and A. Serra, Joan J. Olmos and David González G, Joan J. Olmos and Gholam-ali Seraji, Joan J. Olmos and Silvia Ruiz Boque, A. Serra and David González G, David González G and Halim Yanikomeroglu, David González G and Klaus I. Pedersen, David González G and Silvia Ruiz Boque, Klaus I. Pedersen and Angeliki Alexiou, Klaus I. Pedersen and David Astely, Klaus I. Pedersen and Gholam-ali Seraji, Silvia Ruiz Boque and Halim Yanikomeroglu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Edgar Galván-López, Yasemin Altun, David Hsu, Christopher K. I. Williams, Andrew Y. Ng, Kaijen Hsiao, Marc Toussaint, Wolfram Burgard, Max Mindt, Sachin Patil, Franziska Zacharias, Peter Pastor, Peter Stone, Maurice Bruynooghe\n- Research collaborations between these authors: Edgar Galván-López and Marc Toussaint, Yasemin Altun and Marc Toussaint, David Hsu and Andrew Y. Ng, David Hsu and Peter Stone, David Hsu and Kaijen Hsiao, David Hsu and Marc Toussaint, David Hsu and Sachin Patil, Christopher K. I. Williams and Andrew Y. Ng, Christopher K. I. Williams and Marc Toussaint, Andrew Y. Ng and Wolfram Burgard, Andrew Y. Ng and Peter Stone, Andrew Y. Ng and Kaijen Hsiao, Andrew Y. Ng and Marc Toussaint, Andrew Y. Ng and Sachin Patil, Andrew Y. Ng and Peter Pastor, Kaijen Hsiao and Marc Toussaint, Kaijen Hsiao and Sachin Patil, Kaijen Hsiao and Peter Pastor, Marc Toussaint and Wolfram Burgard, Marc Toussaint and Franziska Zacharias, Marc Toussaint and Maurice Bruynooghe, Marc Toussaint and Peter Pastor, Marc Toussaint and Peter Stone, Marc Toussaint and Sachin Patil, Marc Toussaint and Max Mindt, Wolfram Burgard and Peter Stone, Wolfram Burgard and Sachin Patil, Wolfram Burgard and Peter Pastor.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Edgar Galv\\u00e1n-L\\u00f3pez\", \"id\": 33540}, {\"name\": \"Yasemin Altun\", \"id\": 32295}, {\"name\": \"David Hsu\", \"id\": 3369}, {\"name\": \"Christopher K. I. Williams\", \"id\": 185323}, {\"name\": \"Andrew Y. Ng\", \"id\": 460}, {\"name\": \"Kaijen Hsiao\", \"id\": 484236}, {\"name\": \"Marc Toussaint\", \"id\": 31376}, {\"name\": \"Wolfram Burgard\", \"id\": 3120}, {\"name\": \"Max Mindt\", \"id\": 822580}, {\"name\": \"Sachin Patil\", \"id\": 59766}, {\"name\": \"Franziska Zacharias\", \"id\": 32246}, {\"name\": \"Peter Pastor\", \"id\": 496408}, {\"name\": \"Peter Stone\", \"id\": 40182}, {\"name\": \"Maurice Bruynooghe\", \"id\": 36670}], \"links\": [{\"source\": 33540, \"target\": 31376}, {\"source\": 32295, \"target\": 31376}, {\"source\": 3369, \"target\": 460}, {\"source\": 3369, \"target\": 40182}, {\"source\": 3369, \"target\": 484236}, {\"source\": 3369, \"target\": 31376}, {\"source\": 3369, \"target\": 59766}, {\"source\": 185323, \"target\": 460}, {\"source\": 185323, \"target\": 31376}, {\"source\": 460, \"target\": 3120}, {\"source\": 460, \"target\": 40182}, {\"source\": 460, \"target\": 484236}, {\"source\": 460, \"target\": 31376}, {\"source\": 460, \"target\": 59766}, {\"source\": 460, \"target\": 496408}, {\"source\": 484236, \"target\": 31376}, {\"source\": 484236, \"target\": 59766}, {\"source\": 484236, \"target\": 496408}, {\"source\": 31376, \"target\": 3120}, {\"source\": 31376, \"target\": 32246}, {\"source\": 31376, \"target\": 36670}, {\"source\": 31376, \"target\": 496408}, {\"source\": 31376, \"target\": 40182}, {\"source\": 31376, \"target\": 59766}, {\"source\": 31376, \"target\": 822580}, {\"source\": 3120, \"target\": 40182}, {\"source\": 3120, \"target\": 59766}, {\"source\": 3120, \"target\": 496408}]}",
"id": 1348,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Edgar Galván-López, Yasemin Altun, David Hsu, Christopher K. I. Williams, Andrew Y. Ng, Kaijen Hsiao, Marc Toussaint, Wolfram Burgard, Max Mindt, Sachin Patil, Franziska Zacharias, Peter Pastor, Peter Stone, Maurice Bruynooghe\n- Research collaborations between these authors: Edgar Galván-López and Marc Toussaint, Yasemin Altun and Marc Toussaint, David Hsu and Andrew Y. Ng, David Hsu and Peter Stone, David Hsu and Kaijen Hsiao, David Hsu and Marc Toussaint, David Hsu and Sachin Patil, Christopher K. I. Williams and Andrew Y. Ng, Christopher K. I. Williams and Marc Toussaint, Andrew Y. Ng and Wolfram Burgard, Andrew Y. Ng and Peter Stone, Andrew Y. Ng and Kaijen Hsiao, Andrew Y. Ng and Marc Toussaint, Andrew Y. Ng and Sachin Patil, Andrew Y. Ng and Peter Pastor, Kaijen Hsiao and Marc Toussaint, Kaijen Hsiao and Sachin Patil, Kaijen Hsiao and Peter Pastor, Marc Toussaint and Wolfram Burgard, Marc Toussaint and Franziska Zacharias, Marc Toussaint and Maurice Bruynooghe, Marc Toussaint and Peter Pastor, Marc Toussaint and Peter Stone, Marc Toussaint and Sachin Patil, Marc Toussaint and Max Mindt, Wolfram Burgard and Peter Stone, Wolfram Burgard and Sachin Patil, Wolfram Burgard and Peter Pastor.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jamal Bentahar, Christopher L. Buckley, Rob Mills, Andrew Philippides, Seth Bullock, Ezequiel A. Di Paolo, Jeffrey O. Kephart, Michael O'Shea, Thomas Schmickl, H. Van Dyke Parunak, Richard A. Watson, Marco Dorigo, Philippe Thiran, John Cartlidge\n- Research collaborations between these authors: Jamal Bentahar and Philippe Thiran, Jamal Bentahar and Seth Bullock, Christopher L. Buckley and Richard A. Watson, Christopher L. Buckley and Seth Bullock, Christopher L. Buckley and Andrew Philippides, Christopher L. Buckley and Ezequiel A. Di Paolo, Christopher L. Buckley and Rob Mills, Rob Mills and Richard A. Watson, Rob Mills and Seth Bullock, Andrew Philippides and Ezequiel A. Di Paolo, Andrew Philippides and Michael O'Shea, Andrew Philippides and Seth Bullock, Seth Bullock and Philippe Thiran, Seth Bullock and Jeffrey O. Kephart, Seth Bullock and Thomas Schmickl, Seth Bullock and Marco Dorigo, Seth Bullock and H. Van Dyke Parunak, Seth Bullock and Richard A. Watson, Seth Bullock and Ezequiel A. Di Paolo, Seth Bullock and Michael O'Shea, Seth Bullock and John Cartlidge, Ezequiel A. Di Paolo and Marco Dorigo, Ezequiel A. Di Paolo and Michael O'Shea, Thomas Schmickl and Marco Dorigo.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Jamal Bentahar\", \"id\": 11140}, {\"name\": \"Christopher L. Buckley\", \"id\": 351752}, {\"name\": \"Rob Mills\", \"id\": 386952}, {\"name\": \"Andrew Philippides\", \"id\": 11978}, {\"name\": \"Seth Bullock\", \"id\": 123468}, {\"name\": \"Ezequiel A. Di Paolo\", \"id\": 81965}, {\"name\": \"Jeffrey O. Kephart\", \"id\": 14701}, {\"name\": \"Michael O'Shea\", \"id\": 409550}, {\"name\": \"Thomas Schmickl\", \"id\": 23890}, {\"name\": \"H. Van Dyke Parunak\", \"id\": 46163}, {\"name\": \"Richard A. Watson\", \"id\": 74900}, {\"name\": \"Marco Dorigo\", \"id\": 30264}, {\"name\": \"Philippe Thiran\", \"id\": 33401}, {\"name\": \"John Cartlidge\", \"id\": 233754}], \"links\": [{\"source\": 11140, \"target\": 33401}, {\"source\": 11140, \"target\": 123468}, {\"source\": 351752, \"target\": 74900}, {\"source\": 351752, \"target\": 123468}, {\"source\": 351752, \"target\": 11978}, {\"source\": 351752, \"target\": 81965}, {\"source\": 351752, \"target\": 386952}, {\"source\": 386952, \"target\": 74900}, {\"source\": 386952, \"target\": 123468}, {\"source\": 11978, \"target\": 81965}, {\"source\": 11978, \"target\": 409550}, {\"source\": 11978, \"target\": 123468}, {\"source\": 123468, \"target\": 33401}, {\"source\": 123468, \"target\": 14701}, {\"source\": 123468, \"target\": 23890}, {\"source\": 123468, \"target\": 30264}, {\"source\": 123468, \"target\": 46163}, {\"source\": 123468, \"target\": 74900}, {\"source\": 123468, \"target\": 81965}, {\"source\": 123468, \"target\": 409550}, {\"source\": 123468, \"target\": 233754}, {\"source\": 81965, \"target\": 30264}, {\"source\": 81965, \"target\": 409550}, {\"source\": 23890, \"target\": 30264}]}",
"id": 2138,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jamal Bentahar, Christopher L. Buckley, Rob Mills, Andrew Philippides, Seth Bullock, Ezequiel A. Di Paolo, Jeffrey O. Kephart, Michael O'Shea, Thomas Schmickl, H. Van Dyke Parunak, Richard A. Watson, Marco Dorigo, Philippe Thiran, John Cartlidge\n- Research collaborations between these authors: Jamal Bentahar and Philippe Thiran, Jamal Bentahar and Seth Bullock, Christopher L. Buckley and Richard A. Watson, Christopher L. Buckley and Seth Bullock, Christopher L. Buckley and Andrew Philippides, Christopher L. Buckley and Ezequiel A. Di Paolo, Christopher L. Buckley and Rob Mills, Rob Mills and Richard A. Watson, Rob Mills and Seth Bullock, Andrew Philippides and Ezequiel A. Di Paolo, Andrew Philippides and Michael O'Shea, Andrew Philippides and Seth Bullock, Seth Bullock and Philippe Thiran, Seth Bullock and Jeffrey O. Kephart, Seth Bullock and Thomas Schmickl, Seth Bullock and Marco Dorigo, Seth Bullock and H. Van Dyke Parunak, Seth Bullock and Richard A. Watson, Seth Bullock and Ezequiel A. Di Paolo, Seth Bullock and Michael O'Shea, Seth Bullock and John Cartlidge, Ezequiel A. Di Paolo and Marco Dorigo, Ezequiel A. Di Paolo and Michael O'Shea, Thomas Schmickl and Marco Dorigo.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jose Rodriguez, S. Sandeep Pradhan, Ciprian Dobre, Wonjun Lee, Virgílio A. F. Almeida, Jie Wu, Ali Nazari, Charles Elkan, Jianzhong Zhang, Haibin Song, Peter Druschel, Mike McRoberts, Rong Pan, Scott Shenker\n- Research collaborations between these authors: S. Sandeep Pradhan and Ali Nazari, Ciprian Dobre and Scott Shenker, Wonjun Lee and Jie Wu, Virgílio A. F. Almeida and Scott Shenker, Virgílio A. F. Almeida and Peter Druschel, Jie Wu and Scott Shenker, Jie Wu and Peter Druschel, Charles Elkan and Rong Pan, Jianzhong Zhang and Scott Shenker, Jianzhong Zhang and Peter Druschel, Haibin Song and Scott Shenker, Peter Druschel and Scott Shenker, Mike McRoberts and Scott Shenker, Rong Pan and Scott Shenker.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Jose Rodriguez\", \"id\": 100032}, {\"name\": \"S. Sandeep Pradhan\", \"id\": 230693}, {\"name\": \"Ciprian Dobre\", \"id\": 15462}, {\"name\": \"Virg\\u00edlio A. F. Almeida\", \"id\": 8424}, {\"name\": \"Wonjun Lee\", \"id\": 223784}, {\"name\": \"Jie Wu\", \"id\": 18568}, {\"name\": \"Ali Nazari\", \"id\": 263147}, {\"name\": \"Charles Elkan\", \"id\": 42603}, {\"name\": \"Jianzhong Zhang\", \"id\": 105870}, {\"name\": \"Haibin Song\", \"id\": 796310}, {\"name\": \"Peter Druschel\", \"id\": 44951}, {\"name\": \"Mike McRoberts\", \"id\": 125528}, {\"name\": \"Rong Pan\", \"id\": 45242}, {\"name\": \"Scott Shenker\", \"id\": 32157}], \"links\": [{\"source\": 230693, \"target\": 263147}, {\"source\": 15462, \"target\": 32157}, {\"source\": 8424, \"target\": 32157}, {\"source\": 8424, \"target\": 44951}, {\"source\": 223784, \"target\": 18568}, {\"source\": 18568, \"target\": 32157}, {\"source\": 18568, \"target\": 44951}, {\"source\": 42603, \"target\": 45242}, {\"source\": 105870, \"target\": 32157}, {\"source\": 105870, \"target\": 44951}, {\"source\": 796310, \"target\": 32157}, {\"source\": 44951, \"target\": 32157}, {\"source\": 125528, \"target\": 32157}, {\"source\": 45242, \"target\": 32157}]}",
"id": 562,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Jose Rodriguez, S. Sandeep Pradhan, Ciprian Dobre, Wonjun Lee, Virgílio A. F. Almeida, Jie Wu, Ali Nazari, Charles Elkan, Jianzhong Zhang, Haibin Song, Peter Druschel, Mike McRoberts, Rong Pan, Scott Shenker\n- Research collaborations between these authors: S. Sandeep Pradhan and Ali Nazari, Ciprian Dobre and Scott Shenker, Wonjun Lee and Jie Wu, Virgílio A. F. Almeida and Scott Shenker, Virgílio A. F. Almeida and Peter Druschel, Jie Wu and Scott Shenker, Jie Wu and Peter Druschel, Charles Elkan and Rong Pan, Jianzhong Zhang and Scott Shenker, Jianzhong Zhang and Peter Druschel, Haibin Song and Scott Shenker, Peter Druschel and Scott Shenker, Mike McRoberts and Scott Shenker, Rong Pan and Scott Shenker.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Xiaojun Wang, Bijan Parsia, Hongbing Wang, Soundar R. T. Kumara, Allel Hadjali, Srini Narayanan, Anupriya Ankolekar, Ian Horrocks, Chien-Hsiang Lee, Miroslaw Malek, David Poole, Karim Benouaret, Qin Wu, Hongbign Wang\n- Research collaborations between these authors: Xiaojun Wang and Hongbing Wang, Xiaojun Wang and Qin Wu, Xiaojun Wang and Bijan Parsia, Bijan Parsia and Hongbing Wang, Bijan Parsia and Ian Horrocks, Bijan Parsia and Srini Narayanan, Hongbing Wang and Ian Horrocks, Hongbing Wang and Qin Wu, Hongbing Wang and Miroslaw Malek, Hongbing Wang and Soundar R. T. Kumara, Hongbing Wang and Anupriya Ankolekar, Hongbing Wang and David Poole, Hongbing Wang and Srini Narayanan, Hongbing Wang and Chien-Hsiang Lee, Hongbing Wang and Allel Hadjali, Hongbing Wang and Karim Benouaret, Hongbing Wang and Hongbign Wang, Allel Hadjali and Karim Benouaret, Srini Narayanan and Miroslaw Malek, Srini Narayanan and Anupriya Ankolekar, Anupriya Ankolekar and Ian Horrocks.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Xiaojun Wang\", \"id\": 110113}, {\"name\": \"Soundar R. T. Kumara\", \"id\": 46979}, {\"name\": \"Hongbing Wang\", \"id\": 12036}, {\"name\": \"Bijan Parsia\", \"id\": 14179}, {\"name\": \"Allel Hadjali\", \"id\": 31558}, {\"name\": \"Srini Narayanan\", \"id\": 158441}, {\"name\": \"Anupriya Ankolekar\", \"id\": 53897}, {\"name\": \"Ian Horrocks\", \"id\": 18063}, {\"name\": \"Chien-Hsiang Lee\", \"id\": 485168}, {\"name\": \"Miroslaw Malek\", \"id\": 46644}, {\"name\": \"David Poole\", \"id\": 78967}, {\"name\": \"Karim Benouaret\", \"id\": 81688}, {\"name\": \"Qin Wu\", \"id\": 36633}, {\"name\": \"Hongbign Wang\", \"id\": 1353438}], \"links\": [{\"source\": 110113, \"target\": 12036}, {\"source\": 110113, \"target\": 36633}, {\"source\": 110113, \"target\": 14179}, {\"source\": 46979, \"target\": 12036}, {\"source\": 12036, \"target\": 14179}, {\"source\": 12036, \"target\": 18063}, {\"source\": 12036, \"target\": 36633}, {\"source\": 12036, \"target\": 46644}, {\"source\": 12036, \"target\": 53897}, {\"source\": 12036, \"target\": 78967}, {\"source\": 12036, \"target\": 158441}, {\"source\": 12036, \"target\": 485168}, {\"source\": 12036, \"target\": 31558}, {\"source\": 12036, \"target\": 81688}, {\"source\": 12036, \"target\": 1353438}, {\"source\": 14179, \"target\": 18063}, {\"source\": 14179, \"target\": 158441}, {\"source\": 31558, \"target\": 81688}, {\"source\": 158441, \"target\": 46644}, {\"source\": 158441, \"target\": 53897}, {\"source\": 53897, \"target\": 18063}]}",
"id": 16,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Xiaojun Wang, Bijan Parsia, Hongbing Wang, Soundar R. T. Kumara, Allel Hadjali, Srini Narayanan, Anupriya Ankolekar, Ian Horrocks, Chien-Hsiang Lee, Miroslaw Malek, David Poole, Karim Benouaret, Qin Wu, Hongbign Wang\n- Research collaborations between these authors: Xiaojun Wang and Hongbing Wang, Xiaojun Wang and Qin Wu, Xiaojun Wang and Bijan Parsia, Bijan Parsia and Hongbing Wang, Bijan Parsia and Ian Horrocks, Bijan Parsia and Srini Narayanan, Hongbing Wang and Ian Horrocks, Hongbing Wang and Qin Wu, Hongbing Wang and Miroslaw Malek, Hongbing Wang and Soundar R. T. Kumara, Hongbing Wang and Anupriya Ankolekar, Hongbing Wang and David Poole, Hongbing Wang and Srini Narayanan, Hongbing Wang and Chien-Hsiang Lee, Hongbing Wang and Allel Hadjali, Hongbing Wang and Karim Benouaret, Hongbing Wang and Hongbign Wang, Allel Hadjali and Karim Benouaret, Srini Narayanan and Miroslaw Malek, Srini Narayanan and Anupriya Ankolekar, Anupriya Ankolekar and Ian Horrocks.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Nenad Mladenović, Mario Pavone, Gilbert Laporte, Xiong Wang, Eduardo Uchoa, Christian Prins, Pierre Hansen, Panos M. Pardalos, Mauricio G. C. Resende, Eduardo Álvarez-Miranda, Celso C. Ribeiro, Yang Wang, Charlotte Truchet, José Fernando Gonçalves\n- Research collaborations between these authors: Nenad Mladenović and Gilbert Laporte, Nenad Mladenović and Mauricio G. C. Resende, Nenad Mladenović and Christian Prins, Nenad Mladenović and Pierre Hansen, Nenad Mladenović and Panos M. Pardalos, Nenad Mladenović and Celso C. Ribeiro, Mario Pavone and Mauricio G. C. Resende, Mario Pavone and Celso C. Ribeiro, Gilbert Laporte and Mauricio G. C. Resende, Gilbert Laporte and Christian Prins, Gilbert Laporte and Eduardo Uchoa, Gilbert Laporte and Celso C. Ribeiro, Gilbert Laporte and Pierre Hansen, Gilbert Laporte and Panos M. Pardalos, Xiong Wang and Mauricio G. C. Resende, Eduardo Uchoa and Mauricio G. C. Resende, Eduardo Uchoa and Christian Prins, Eduardo Uchoa and Celso C. Ribeiro, Christian Prins and Mauricio G. C. Resende, Christian Prins and Pierre Hansen, Christian Prins and Panos M. Pardalos, Pierre Hansen and Mauricio G. C. Resende, Pierre Hansen and Celso C. Ribeiro, Pierre Hansen and Panos M. Pardalos, Panos M. Pardalos and Yang Wang, Panos M. Pardalos and Mauricio G. C. Resende, Panos M. Pardalos and Celso C. Ribeiro, Panos M. Pardalos and José Fernando Gonçalves, Mauricio G. C. Resende and Yang Wang, Mauricio G. C. Resende and Celso C. Ribeiro, Mauricio G. C. Resende and José Fernando Gonçalves, Mauricio G. C. Resende and Eduardo Álvarez-Miranda, Mauricio G. C. Resende and Charlotte Truchet, Celso C. Ribeiro and Yang Wang, Celso C. Ribeiro and José Fernando Gonçalves, Celso C. Ribeiro and Charlotte Truchet.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Nenad Mladenovi\\u0107\", \"id\": 120896}, {\"name\": \"Mario Pavone\", \"id\": 71361}, {\"name\": \"Gilbert Laporte\", \"id\": 7940}, {\"name\": \"Xiong Wang\", \"id\": 123268}, {\"name\": \"Christian Prins\", \"id\": 27660}, {\"name\": \"Pierre Hansen\", \"id\": 43053}, {\"name\": \"Panos M. Pardalos\", \"id\": 48077}, {\"name\": \"Mauricio G. C. Resende\", \"id\": 11023}, {\"name\": \"Eduardo \\u00c1lvarez-Miranda\", \"id\": 38547}, {\"name\": \"Celso C. Ribeiro\", \"id\": 54579}, {\"name\": \"Jos\\u00e9 Fernando Gon\\u00e7alves\", \"id\": 275390}, {\"name\": \"Yang Wang\", \"id\": 8025}, {\"name\": \"Charlotte Truchet\", \"id\": 91132}, {\"name\": \"Eduardo Uchoa\", \"id\": 30366}], \"links\": [{\"source\": 120896, \"target\": 7940}, {\"source\": 120896, \"target\": 11023}, {\"source\": 120896, \"target\": 27660}, {\"source\": 120896, \"target\": 43053}, {\"source\": 120896, \"target\": 48077}, {\"source\": 120896, \"target\": 54579}, {\"source\": 71361, \"target\": 11023}, {\"source\": 71361, \"target\": 54579}, {\"source\": 7940, \"target\": 11023}, {\"source\": 7940, \"target\": 27660}, {\"source\": 7940, \"target\": 30366}, {\"source\": 7940, \"target\": 54579}, {\"source\": 7940, \"target\": 43053}, {\"source\": 7940, \"target\": 48077}, {\"source\": 123268, \"target\": 11023}, {\"source\": 27660, \"target\": 11023}, {\"source\": 27660, \"target\": 30366}, {\"source\": 27660, \"target\": 43053}, {\"source\": 27660, \"target\": 48077}, {\"source\": 43053, \"target\": 11023}, {\"source\": 43053, \"target\": 54579}, {\"source\": 43053, \"target\": 48077}, {\"source\": 48077, \"target\": 8025}, {\"source\": 48077, \"target\": 11023}, {\"source\": 48077, \"target\": 54579}, {\"source\": 48077, \"target\": 275390}, {\"source\": 11023, \"target\": 8025}, {\"source\": 11023, \"target\": 30366}, {\"source\": 11023, \"target\": 54579}, {\"source\": 11023, \"target\": 275390}, {\"source\": 11023, \"target\": 38547}, {\"source\": 11023, \"target\": 91132}, {\"source\": 54579, \"target\": 8025}, {\"source\": 54579, \"target\": 30366}, {\"source\": 54579, \"target\": 275390}, {\"source\": 54579, \"target\": 91132}]}",
"id": 2036,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Nenad Mladenović, Mario Pavone, Gilbert Laporte, Xiong Wang, Eduardo Uchoa, Christian Prins, Pierre Hansen, Panos M. Pardalos, Mauricio G. C. Resende, Eduardo Álvarez-Miranda, Celso C. Ribeiro, Yang Wang, Charlotte Truchet, José Fernando Gonçalves\n- Research collaborations between these authors: Nenad Mladenović and Gilbert Laporte, Nenad Mladenović and Mauricio G. C. Resende, Nenad Mladenović and Christian Prins, Nenad Mladenović and Pierre Hansen, Nenad Mladenović and Panos M. Pardalos, Nenad Mladenović and Celso C. Ribeiro, Mario Pavone and Mauricio G. C. Resende, Mario Pavone and Celso C. Ribeiro, Gilbert Laporte and Mauricio G. C. Resende, Gilbert Laporte and Christian Prins, Gilbert Laporte and Eduardo Uchoa, Gilbert Laporte and Celso C. Ribeiro, Gilbert Laporte and Pierre Hansen, Gilbert Laporte and Panos M. Pardalos, Xiong Wang and Mauricio G. C. Resende, Eduardo Uchoa and Mauricio G. C. Resende, Eduardo Uchoa and Christian Prins, Eduardo Uchoa and Celso C. Ribeiro, Christian Prins and Mauricio G. C. Resende, Christian Prins and Pierre Hansen, Christian Prins and Panos M. Pardalos, Pierre Hansen and Mauricio G. C. Resende, Pierre Hansen and Celso C. Ribeiro, Pierre Hansen and Panos M. Pardalos, Panos M. Pardalos and Yang Wang, Panos M. Pardalos and Mauricio G. C. Resende, Panos M. Pardalos and Celso C. Ribeiro, Panos M. Pardalos and José Fernando Gonçalves, Mauricio G. C. Resende and Yang Wang, Mauricio G. C. Resende and Celso C. Ribeiro, Mauricio G. C. Resende and José Fernando Gonçalves, Mauricio G. C. Resende and Eduardo Álvarez-Miranda, Mauricio G. C. Resende and Charlotte Truchet, Celso C. Ribeiro and Yang Wang, Celso C. Ribeiro and José Fernando Gonçalves, Celso C. Ribeiro and Charlotte Truchet.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Tomoya Enokido, Ricardo Bianchini, Takuro Inoue, Kenichi Watanabe, Dilawaer Duolikun, Makoto Takizawa, Wenny Rahayu, Ion Stoica, Tomoya Nokido, Yan Yang, Bala Srinivasan, David Taniar, Ailixier Aikebaier, Kota Suzuki\n- Research collaborations between these authors: Tomoya Enokido and Makoto Takizawa, Tomoya Enokido and Kenichi Watanabe, Tomoya Enokido and Bala Srinivasan, Tomoya Enokido and David Taniar, Tomoya Enokido and Yan Yang, Tomoya Enokido and Ricardo Bianchini, Tomoya Enokido and Ion Stoica, Tomoya Enokido and Takuro Inoue, Tomoya Enokido and Ailixier Aikebaier, Tomoya Enokido and Dilawaer Duolikun, Tomoya Enokido and Wenny Rahayu, Tomoya Enokido and Kota Suzuki, Tomoya Enokido and Tomoya Nokido, Ricardo Bianchini and Ion Stoica, Ricardo Bianchini and Makoto Takizawa, Ricardo Bianchini and Takuro Inoue, Ricardo Bianchini and Ailixier Aikebaier, Ricardo Bianchini and Dilawaer Duolikun, Ricardo Bianchini and Kota Suzuki, Takuro Inoue and Makoto Takizawa, Takuro Inoue and Bala Srinivasan, Takuro Inoue and David Taniar, Takuro Inoue and Yan Yang, Takuro Inoue and Ailixier Aikebaier, Takuro Inoue and Wenny Rahayu, Takuro Inoue and Kota Suzuki, Takuro Inoue and Dilawaer Duolikun, Takuro Inoue and Tomoya Nokido, Kenichi Watanabe and Makoto Takizawa, Kenichi Watanabe and Ion Stoica, Kenichi Watanabe and Ailixier Aikebaier, Kenichi Watanabe and Dilawaer Duolikun, Dilawaer Duolikun and Makoto Takizawa, Dilawaer Duolikun and Ailixier Aikebaier, Dilawaer Duolikun and Bala Srinivasan, Dilawaer Duolikun and David Taniar, Dilawaer Duolikun and Yan Yang, Dilawaer Duolikun and Wenny Rahayu, Dilawaer Duolikun and Kota Suzuki, Makoto Takizawa and Bala Srinivasan, Makoto Takizawa and David Taniar, Makoto Takizawa and Yan Yang, Makoto Takizawa and Ion Stoica, Makoto Takizawa and Ailixier Aikebaier, Makoto Takizawa and Wenny Rahayu, Makoto Takizawa and Kota Suzuki, Makoto Takizawa and Tomoya Nokido, Wenny Rahayu and Bala Srinivasan, Wenny Rahayu and David Taniar, Wenny Rahayu and Ailixier Aikebaier, Ion Stoica and Bala Srinivasan, Ion Stoica and Ailixier Aikebaier, Tomoya Nokido and Ailixier Aikebaier, Yan Yang and Ailixier Aikebaier, Bala Srinivasan and David Taniar, Bala Srinivasan and Ailixier Aikebaier, David Taniar and Ailixier Aikebaier, Ailixier Aikebaier and Kota Suzuki.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Tomoya Enokido\", \"id\": 51904}, {\"name\": \"Kota Suzuki\", \"id\": 591199}, {\"name\": \"Ricardo Bianchini\", \"id\": 14471}, {\"name\": \"Takuro Inoue\", \"id\": 111338}, {\"name\": \"Wenny Rahayu\", \"id\": 382206}, {\"name\": \"Dilawaer Duolikun\", \"id\": 253997}, {\"name\": \"Makoto Takizawa\", \"id\": 38669}, {\"name\": \"Ion Stoica\", \"id\": 19443}, {\"name\": \"Tomoya Nokido\", \"id\": 641909}, {\"name\": \"Yan Yang\", \"id\": 9462}, {\"name\": \"Bala Srinivasan\", \"id\": 3198}, {\"name\": \"David Taniar\", \"id\": 3199}, {\"name\": \"Kenichi Watanabe\", \"id\": 51902}, {\"name\": \"Ailixier Aikebaier\", \"id\": 187487}], \"links\": [{\"source\": 51904, \"target\": 38669}, {\"source\": 51904, \"target\": 51902}, {\"source\": 51904, \"target\": 3198}, {\"source\": 51904, \"target\": 3199}, {\"source\": 51904, \"target\": 9462}, {\"source\": 51904, \"target\": 14471}, {\"source\": 51904, \"target\": 19443}, {\"source\": 51904, \"target\": 111338}, {\"source\": 51904, \"target\": 187487}, {\"source\": 51904, \"target\": 253997}, {\"source\": 51904, \"target\": 382206}, {\"source\": 51904, \"target\": 591199}, {\"source\": 51904, \"target\": 641909}, {\"source\": 591199, \"target\": 38669}, {\"source\": 591199, \"target\": 111338}, {\"source\": 591199, \"target\": 187487}, {\"source\": 591199, \"target\": 253997}, {\"source\": 591199, \"target\": 14471}, {\"source\": 14471, \"target\": 19443}, {\"source\": 14471, \"target\": 38669}, {\"source\": 14471, \"target\": 111338}, {\"source\": 14471, \"target\": 187487}, {\"source\": 14471, \"target\": 253997}, {\"source\": 111338, \"target\": 38669}, {\"source\": 111338, \"target\": 3198}, {\"source\": 111338, \"target\": 3199}, {\"source\": 111338, \"target\": 9462}, {\"source\": 111338, \"target\": 187487}, {\"source\": 111338, \"target\": 382206}, {\"source\": 111338, \"target\": 253997}, {\"source\": 111338, \"target\": 641909}, {\"source\": 382206, \"target\": 3198}, {\"source\": 382206, \"target\": 3199}, {\"source\": 382206, \"target\": 38669}, {\"source\": 382206, \"target\": 187487}, {\"source\": 382206, \"target\": 253997}, {\"source\": 253997, \"target\": 38669}, {\"source\": 253997, \"target\": 187487}, {\"source\": 253997, \"target\": 3198}, {\"source\": 253997, \"target\": 3199}, {\"source\": 253997, \"target\": 9462}, {\"source\": 253997, \"target\": 51902}, {\"source\": 38669, \"target\": 3198}, {\"source\": 38669, \"target\": 3199}, {\"source\": 38669, \"target\": 9462}, {\"source\": 38669, \"target\": 19443}, {\"source\": 38669, \"target\": 51902}, {\"source\": 38669, \"target\": 187487}, {\"source\": 38669, \"target\": 641909}, {\"source\": 19443, \"target\": 3198}, {\"source\": 19443, \"target\": 51902}, {\"source\": 19443, \"target\": 187487}, {\"source\": 641909, \"target\": 187487}, {\"source\": 9462, \"target\": 187487}, {\"source\": 3198, \"target\": 3199}, {\"source\": 3198, \"target\": 187487}, {\"source\": 3199, \"target\": 187487}, {\"source\": 51902, \"target\": 187487}]}",
"id": 1771,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Tomoya Enokido, Ricardo Bianchini, Takuro Inoue, Kenichi Watanabe, Dilawaer Duolikun, Makoto Takizawa, Wenny Rahayu, Ion Stoica, Tomoya Nokido, Yan Yang, Bala Srinivasan, David Taniar, Ailixier Aikebaier, Kota Suzuki\n- Research collaborations between these authors: Tomoya Enokido and Makoto Takizawa, Tomoya Enokido and Kenichi Watanabe, Tomoya Enokido and Bala Srinivasan, Tomoya Enokido and David Taniar, Tomoya Enokido and Yan Yang, Tomoya Enokido and Ricardo Bianchini, Tomoya Enokido and Ion Stoica, Tomoya Enokido and Takuro Inoue, Tomoya Enokido and Ailixier Aikebaier, Tomoya Enokido and Dilawaer Duolikun, Tomoya Enokido and Wenny Rahayu, Tomoya Enokido and Kota Suzuki, Tomoya Enokido and Tomoya Nokido, Ricardo Bianchini and Ion Stoica, Ricardo Bianchini and Makoto Takizawa, Ricardo Bianchini and Takuro Inoue, Ricardo Bianchini and Ailixier Aikebaier, Ricardo Bianchini and Dilawaer Duolikun, Ricardo Bianchini and Kota Suzuki, Takuro Inoue and Makoto Takizawa, Takuro Inoue and Bala Srinivasan, Takuro Inoue and David Taniar, Takuro Inoue and Yan Yang, Takuro Inoue and Ailixier Aikebaier, Takuro Inoue and Wenny Rahayu, Takuro Inoue and Kota Suzuki, Takuro Inoue and Dilawaer Duolikun, Takuro Inoue and Tomoya Nokido, Kenichi Watanabe and Makoto Takizawa, Kenichi Watanabe and Ion Stoica, Kenichi Watanabe and Ailixier Aikebaier, Kenichi Watanabe and Dilawaer Duolikun, Dilawaer Duolikun and Makoto Takizawa, Dilawaer Duolikun and Ailixier Aikebaier, Dilawaer Duolikun and Bala Srinivasan, Dilawaer Duolikun and David Taniar, Dilawaer Duolikun and Yan Yang, Dilawaer Duolikun and Wenny Rahayu, Dilawaer Duolikun and Kota Suzuki, Makoto Takizawa and Bala Srinivasan, Makoto Takizawa and David Taniar, Makoto Takizawa and Yan Yang, Makoto Takizawa and Ion Stoica, Makoto Takizawa and Ailixier Aikebaier, Makoto Takizawa and Wenny Rahayu, Makoto Takizawa and Kota Suzuki, Makoto Takizawa and Tomoya Nokido, Wenny Rahayu and Bala Srinivasan, Wenny Rahayu and David Taniar, Wenny Rahayu and Ailixier Aikebaier, Ion Stoica and Bala Srinivasan, Ion Stoica and Ailixier Aikebaier, Tomoya Nokido and Ailixier Aikebaier, Yan Yang and Ailixier Aikebaier, Bala Srinivasan and David Taniar, Bala Srinivasan and Ailixier Aikebaier, David Taniar and Ailixier Aikebaier, Ailixier Aikebaier and Kota Suzuki.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Alexandros Nanopoulos, Andrzej Cichocki, Bamdev Mishra, Reinhold Schneider, Ivan V. Oseledets, Andr ´ E Uschmajew, A. P. Smirnov, Daniel Kressner, Tülay Adali, Albert Cohen, Pierre-Antoine Absil, Michael Steinlechner, Wolfgang Hackbusch, Lieven De Lathauwer\n- Research collaborations between these authors: Alexandros Nanopoulos and Lieven De Lathauwer, Alexandros Nanopoulos and Ivan V. Oseledets, Andrzej Cichocki and Daniel Kressner, Andrzej Cichocki and Lieven De Lathauwer, Andrzej Cichocki and Tülay Adali, Andrzej Cichocki and Wolfgang Hackbusch, Andrzej Cichocki and Reinhold Schneider, Andrzej Cichocki and Michael Steinlechner, Andrzej Cichocki and Ivan V. Oseledets, Andrzej Cichocki and Andr ´ E Uschmajew, Bamdev Mishra and Pierre-Antoine Absil, Bamdev Mishra and Ivan V. Oseledets, Reinhold Schneider and Wolfgang Hackbusch, Reinhold Schneider and Albert Cohen, Reinhold Schneider and Daniel Kressner, Reinhold Schneider and Lieven De Lathauwer, Reinhold Schneider and Ivan V. Oseledets, Ivan V. Oseledets and A. P. Smirnov, Ivan V. Oseledets and Daniel Kressner, Ivan V. Oseledets and Lieven De Lathauwer, Ivan V. Oseledets and Wolfgang Hackbusch, Ivan V. Oseledets and Michael Steinlechner, Ivan V. Oseledets and Pierre-Antoine Absil, Ivan V. Oseledets and Andr ´ E Uschmajew, Daniel Kressner and Wolfgang Hackbusch, Daniel Kressner and Michael Steinlechner, Tülay Adali and Lieven De Lathauwer, Pierre-Antoine Absil and Lieven De Lathauwer, Wolfgang Hackbusch and Lieven De Lathauwer.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Alexandros Nanopoulos\", \"id\": 10848}, {\"name\": \"Andrzej Cichocki\", \"id\": 38530}, {\"name\": \"Bamdev Mishra\", \"id\": 188290}, {\"name\": \"Reinhold Schneider\", \"id\": 202308}, {\"name\": \"Ivan V. Oseledets\", \"id\": 471751}, {\"name\": \"Andr \\u00b4 E Uschmajew\", \"id\": 691755}, {\"name\": \"A. P. Smirnov\", \"id\": 59179}, {\"name\": \"Daniel Kressner\", \"id\": 121773}, {\"name\": \"T\\u00fclay Adali\", \"id\": 154379}, {\"name\": \"Albert Cohen\", \"id\": 48882}, {\"name\": \"Pierre-Antoine Absil\", \"id\": 403514}, {\"name\": \"Michael Steinlechner\", \"id\": 469755}, {\"name\": \"Wolfgang Hackbusch\", \"id\": 171228}, {\"name\": \"Lieven De Lathauwer\", \"id\": 142719}], \"links\": [{\"source\": 10848, \"target\": 142719}, {\"source\": 10848, \"target\": 471751}, {\"source\": 38530, \"target\": 121773}, {\"source\": 38530, \"target\": 142719}, {\"source\": 38530, \"target\": 154379}, {\"source\": 38530, \"target\": 171228}, {\"source\": 38530, \"target\": 202308}, {\"source\": 38530, \"target\": 469755}, {\"source\": 38530, \"target\": 471751}, {\"source\": 38530, \"target\": 691755}, {\"source\": 188290, \"target\": 403514}, {\"source\": 188290, \"target\": 471751}, {\"source\": 202308, \"target\": 171228}, {\"source\": 202308, \"target\": 48882}, {\"source\": 202308, \"target\": 121773}, {\"source\": 202308, \"target\": 142719}, {\"source\": 202308, \"target\": 471751}, {\"source\": 471751, \"target\": 59179}, {\"source\": 471751, \"target\": 121773}, {\"source\": 471751, \"target\": 142719}, {\"source\": 471751, \"target\": 171228}, {\"source\": 471751, \"target\": 469755}, {\"source\": 471751, \"target\": 403514}, {\"source\": 471751, \"target\": 691755}, {\"source\": 121773, \"target\": 171228}, {\"source\": 121773, \"target\": 469755}, {\"source\": 154379, \"target\": 142719}, {\"source\": 403514, \"target\": 142719}, {\"source\": 171228, \"target\": 142719}]}",
"id": 2606,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Alexandros Nanopoulos, Andrzej Cichocki, Bamdev Mishra, Reinhold Schneider, Ivan V. Oseledets, Andr ´ E Uschmajew, A. P. Smirnov, Daniel Kressner, Tülay Adali, Albert Cohen, Pierre-Antoine Absil, Michael Steinlechner, Wolfgang Hackbusch, Lieven De Lathauwer\n- Research collaborations between these authors: Alexandros Nanopoulos and Lieven De Lathauwer, Alexandros Nanopoulos and Ivan V. Oseledets, Andrzej Cichocki and Daniel Kressner, Andrzej Cichocki and Lieven De Lathauwer, Andrzej Cichocki and Tülay Adali, Andrzej Cichocki and Wolfgang Hackbusch, Andrzej Cichocki and Reinhold Schneider, Andrzej Cichocki and Michael Steinlechner, Andrzej Cichocki and Ivan V. Oseledets, Andrzej Cichocki and Andr ´ E Uschmajew, Bamdev Mishra and Pierre-Antoine Absil, Bamdev Mishra and Ivan V. Oseledets, Reinhold Schneider and Wolfgang Hackbusch, Reinhold Schneider and Albert Cohen, Reinhold Schneider and Daniel Kressner, Reinhold Schneider and Lieven De Lathauwer, Reinhold Schneider and Ivan V. Oseledets, Ivan V. Oseledets and A. P. Smirnov, Ivan V. Oseledets and Daniel Kressner, Ivan V. Oseledets and Lieven De Lathauwer, Ivan V. Oseledets and Wolfgang Hackbusch, Ivan V. Oseledets and Michael Steinlechner, Ivan V. Oseledets and Pierre-Antoine Absil, Ivan V. Oseledets and Andr ´ E Uschmajew, Daniel Kressner and Wolfgang Hackbusch, Daniel Kressner and Michael Steinlechner, Tülay Adali and Lieven De Lathauwer, Pierre-Antoine Absil and Lieven De Lathauwer, Wolfgang Hackbusch and Lieven De Lathauwer.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Tony F. Chan, Xiaoyan Sun, Jean-Christophe Pesquet, Stanley Osher, Paul M. Thompson, Nadia Bianchi-Berthouze, Luminita A. Vese, Joachim Weickert, Marius Lysaker, Ke Chen, Dorin Comaniciu, Jeffrey F. Cohn, Marei Algarni, Fang Li\n- Research collaborations between these authors: Tony F. Chan and Ke Chen, Tony F. Chan and Fang Li, Tony F. Chan and Joachim Weickert, Tony F. Chan and Paul M. Thompson, Tony F. Chan and Stanley Osher, Tony F. Chan and Xiaoyan Sun, Tony F. Chan and Luminita A. Vese, Tony F. Chan and Jean-Christophe Pesquet, Tony F. Chan and Marius Lysaker, Tony F. Chan and Marei Algarni, Xiaoyan Sun and Joachim Weickert, Xiaoyan Sun and Stanley Osher, Xiaoyan Sun and Luminita A. Vese, Jean-Christophe Pesquet and Stanley Osher, Jean-Christophe Pesquet and Joachim Weickert, Jean-Christophe Pesquet and Luminita A. Vese, Stanley Osher and Ke Chen, Stanley Osher and Fang Li, Stanley Osher and Joachim Weickert, Stanley Osher and Paul M. Thompson, Stanley Osher and Dorin Comaniciu, Stanley Osher and Luminita A. Vese, Stanley Osher and Marius Lysaker, Paul M. Thompson and Luminita A. Vese, Paul M. Thompson and Dorin Comaniciu, Nadia Bianchi-Berthouze and Jeffrey F. Cohn, Luminita A. Vese and Ke Chen, Luminita A. Vese and Fang Li, Luminita A. Vese and Joachim Weickert, Luminita A. Vese and Marius Lysaker, Joachim Weickert and Marius Lysaker, Marius Lysaker and Ke Chen, Marius Lysaker and Fang Li.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Tony F. Chan\", \"id\": 139138}, {\"name\": \"Xiaoyan Sun\", \"id\": 84707}, {\"name\": \"Stanley Osher\", \"id\": 28133}, {\"name\": \"Jean-Christophe Pesquet\", \"id\": 107653}, {\"name\": \"Paul M. Thompson\", \"id\": 24364}, {\"name\": \"Jeffrey F. Cohn\", \"id\": 46426}, {\"name\": \"Nadia Bianchi-Berthouze\", \"id\": 54642}, {\"name\": \"Luminita A. Vese\", \"id\": 103732}, {\"name\": \"Joachim Weickert\", \"id\": 13461}, {\"name\": \"Marius Lysaker\", \"id\": 642453}, {\"name\": \"Dorin Comaniciu\", \"id\": 42809}, {\"name\": \"Ke Chen\", \"id\": 2746}, {\"name\": \"Marei Algarni\", \"id\": 466651}, {\"name\": \"Fang Li\", \"id\": 3422}], \"links\": [{\"source\": 139138, \"target\": 2746}, {\"source\": 139138, \"target\": 3422}, {\"source\": 139138, \"target\": 13461}, {\"source\": 139138, \"target\": 24364}, {\"source\": 139138, \"target\": 28133}, {\"source\": 139138, \"target\": 84707}, {\"source\": 139138, \"target\": 103732}, {\"source\": 139138, \"target\": 107653}, {\"source\": 139138, \"target\": 642453}, {\"source\": 139138, \"target\": 466651}, {\"source\": 84707, \"target\": 13461}, {\"source\": 84707, \"target\": 28133}, {\"source\": 84707, \"target\": 103732}, {\"source\": 28133, \"target\": 2746}, {\"source\": 28133, \"target\": 3422}, {\"source\": 28133, \"target\": 13461}, {\"source\": 28133, \"target\": 24364}, {\"source\": 28133, \"target\": 42809}, {\"source\": 28133, \"target\": 103732}, {\"source\": 28133, \"target\": 107653}, {\"source\": 28133, \"target\": 642453}, {\"source\": 107653, \"target\": 13461}, {\"source\": 107653, \"target\": 103732}, {\"source\": 24364, \"target\": 103732}, {\"source\": 24364, \"target\": 42809}, {\"source\": 46426, \"target\": 54642}, {\"source\": 103732, \"target\": 2746}, {\"source\": 103732, \"target\": 3422}, {\"source\": 103732, \"target\": 13461}, {\"source\": 103732, \"target\": 642453}, {\"source\": 13461, \"target\": 642453}, {\"source\": 642453, \"target\": 2746}, {\"source\": 642453, \"target\": 3422}]}",
"id": 1593,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Tony F. Chan, Xiaoyan Sun, Jean-Christophe Pesquet, Stanley Osher, Paul M. Thompson, Nadia Bianchi-Berthouze, Luminita A. Vese, Joachim Weickert, Marius Lysaker, Ke Chen, Dorin Comaniciu, Jeffrey F. Cohn, Marei Algarni, Fang Li\n- Research collaborations between these authors: Tony F. Chan and Ke Chen, Tony F. Chan and Fang Li, Tony F. Chan and Joachim Weickert, Tony F. Chan and Paul M. Thompson, Tony F. Chan and Stanley Osher, Tony F. Chan and Xiaoyan Sun, Tony F. Chan and Luminita A. Vese, Tony F. Chan and Jean-Christophe Pesquet, Tony F. Chan and Marius Lysaker, Tony F. Chan and Marei Algarni, Xiaoyan Sun and Joachim Weickert, Xiaoyan Sun and Stanley Osher, Xiaoyan Sun and Luminita A. Vese, Jean-Christophe Pesquet and Stanley Osher, Jean-Christophe Pesquet and Joachim Weickert, Jean-Christophe Pesquet and Luminita A. Vese, Stanley Osher and Ke Chen, Stanley Osher and Fang Li, Stanley Osher and Joachim Weickert, Stanley Osher and Paul M. Thompson, Stanley Osher and Dorin Comaniciu, Stanley Osher and Luminita A. Vese, Stanley Osher and Marius Lysaker, Paul M. Thompson and Luminita A. Vese, Paul M. Thompson and Dorin Comaniciu, Nadia Bianchi-Berthouze and Jeffrey F. Cohn, Luminita A. Vese and Ke Chen, Luminita A. Vese and Fang Li, Luminita A. Vese and Joachim Weickert, Luminita A. Vese and Marius Lysaker, Joachim Weickert and Marius Lysaker, Marius Lysaker and Ke Chen, Marius Lysaker and Fang Li.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: G C Paul Suganthan, Anand Rajaraman, Christian Bizer, Zuoshuang Xiang, Gerhard Weikum, Jens Lehmann, Digvijay Singh Lamba, Sören Auer, Fabian M. Suchanek, Georgi Kobilarov, Richard Cyganiak, Gjergji Kasneci, AnHai Doan, Christopher W. Brown\n- Research collaborations between these authors: G C Paul Suganthan and Anand Rajaraman, G C Paul Suganthan and AnHai Doan, G C Paul Suganthan and Digvijay Singh Lamba, Anand Rajaraman and Christian Bizer, Anand Rajaraman and Jens Lehmann, Anand Rajaraman and Sören Auer, Anand Rajaraman and Gerhard Weikum, Anand Rajaraman and Fabian M. Suchanek, Anand Rajaraman and Georgi Kobilarov, Anand Rajaraman and Richard Cyganiak, Anand Rajaraman and Gjergji Kasneci, Anand Rajaraman and AnHai Doan, Christian Bizer and Jens Lehmann, Christian Bizer and Sören Auer, Christian Bizer and Gerhard Weikum, Christian Bizer and Fabian M. Suchanek, Christian Bizer and Georgi Kobilarov, Christian Bizer and Richard Cyganiak, Christian Bizer and Gjergji Kasneci, Christian Bizer and AnHai Doan, Christian Bizer and Digvijay Singh Lamba, Gerhard Weikum and Jens Lehmann, Gerhard Weikum and Sören Auer, Gerhard Weikum and Fabian M. Suchanek, Gerhard Weikum and Georgi Kobilarov, Gerhard Weikum and Richard Cyganiak, Gerhard Weikum and Gjergji Kasneci, Gerhard Weikum and AnHai Doan, Gerhard Weikum and Digvijay Singh Lamba, Jens Lehmann and Sören Auer, Jens Lehmann and Fabian M. Suchanek, Jens Lehmann and Georgi Kobilarov, Jens Lehmann and Richard Cyganiak, Jens Lehmann and Gjergji Kasneci, Jens Lehmann and AnHai Doan, Jens Lehmann and Digvijay Singh Lamba, Digvijay Singh Lamba and AnHai Doan, Digvijay Singh Lamba and Sören Auer, Digvijay Singh Lamba and Fabian M. Suchanek, Digvijay Singh Lamba and Georgi Kobilarov, Digvijay Singh Lamba and Richard Cyganiak, Digvijay Singh Lamba and Gjergji Kasneci, Sören Auer and Fabian M. Suchanek, Sören Auer and Georgi Kobilarov, Sören Auer and Richard Cyganiak, Sören Auer and Gjergji Kasneci, Sören Auer and AnHai Doan, Fabian M. Suchanek and Georgi Kobilarov, Fabian M. Suchanek and Richard Cyganiak, Fabian M. Suchanek and Gjergji Kasneci, Fabian M. Suchanek and AnHai Doan, Georgi Kobilarov and Richard Cyganiak, Georgi Kobilarov and Gjergji Kasneci, Georgi Kobilarov and AnHai Doan, Richard Cyganiak and Gjergji Kasneci, Richard Cyganiak and AnHai Doan, Gjergji Kasneci and AnHai Doan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 10,
"style": "rule"
}
|
{
"exact_answer": 10,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Anand Rajaraman\", \"id\": 58530}, {\"name\": \"G C Paul Suganthan\", \"id\": 671714}, {\"name\": \"Zuoshuang Xiang\", \"id\": 96490}, {\"name\": \"Christian Bizer\", \"id\": 2954}, {\"name\": \"Gerhard Weikum\", \"id\": 9230}, {\"name\": \"Jens Lehmann\", \"id\": 7152}, {\"name\": \"Digvijay Singh Lamba\", \"id\": 831889}, {\"name\": \"S\\u00f6ren Auer\", \"id\": 7153}, {\"name\": \"Fabian M. Suchanek\", \"id\": 76081}, {\"name\": \"Georgi Kobilarov\", \"id\": 100726}, {\"name\": \"Richard Cyganiak\", \"id\": 100727}, {\"name\": \"Gjergji Kasneci\", \"id\": 104217}, {\"name\": \"AnHai Doan\", \"id\": 110236}, {\"name\": \"Christopher W. Brown\", \"id\": 108127}], \"links\": [{\"source\": 58530, \"target\": 2954}, {\"source\": 58530, \"target\": 7152}, {\"source\": 58530, \"target\": 7153}, {\"source\": 58530, \"target\": 9230}, {\"source\": 58530, \"target\": 76081}, {\"source\": 58530, \"target\": 100726}, {\"source\": 58530, \"target\": 100727}, {\"source\": 58530, \"target\": 104217}, {\"source\": 58530, \"target\": 110236}, {\"source\": 58530, \"target\": 671714}, {\"source\": 671714, \"target\": 110236}, {\"source\": 671714, \"target\": 831889}, {\"source\": 2954, \"target\": 7152}, {\"source\": 2954, \"target\": 7153}, {\"source\": 2954, \"target\": 9230}, {\"source\": 2954, \"target\": 76081}, {\"source\": 2954, \"target\": 100726}, {\"source\": 2954, \"target\": 100727}, {\"source\": 2954, \"target\": 104217}, {\"source\": 2954, \"target\": 110236}, {\"source\": 2954, \"target\": 831889}, {\"source\": 9230, \"target\": 7152}, {\"source\": 9230, \"target\": 7153}, {\"source\": 9230, \"target\": 76081}, {\"source\": 9230, \"target\": 100726}, {\"source\": 9230, \"target\": 100727}, {\"source\": 9230, \"target\": 104217}, {\"source\": 9230, \"target\": 110236}, {\"source\": 9230, \"target\": 831889}, {\"source\": 7152, \"target\": 7153}, {\"source\": 7152, \"target\": 76081}, {\"source\": 7152, \"target\": 100726}, {\"source\": 7152, \"target\": 100727}, {\"source\": 7152, \"target\": 104217}, {\"source\": 7152, \"target\": 110236}, {\"source\": 7152, \"target\": 831889}, {\"source\": 831889, \"target\": 110236}, {\"source\": 831889, \"target\": 7153}, {\"source\": 831889, \"target\": 76081}, {\"source\": 831889, \"target\": 100726}, {\"source\": 831889, \"target\": 100727}, {\"source\": 831889, \"target\": 104217}, {\"source\": 7153, \"target\": 76081}, {\"source\": 7153, \"target\": 100726}, {\"source\": 7153, \"target\": 100727}, {\"source\": 7153, \"target\": 104217}, {\"source\": 7153, \"target\": 110236}, {\"source\": 76081, \"target\": 100726}, {\"source\": 76081, \"target\": 100727}, {\"source\": 76081, \"target\": 104217}, {\"source\": 76081, \"target\": 110236}, {\"source\": 100726, \"target\": 100727}, {\"source\": 100726, \"target\": 104217}, {\"source\": 100726, \"target\": 110236}, {\"source\": 100727, \"target\": 104217}, {\"source\": 100727, \"target\": 110236}, {\"source\": 104217, \"target\": 110236}]}",
"id": 1982,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: G C Paul Suganthan, Anand Rajaraman, Christian Bizer, Zuoshuang Xiang, Gerhard Weikum, Jens Lehmann, Digvijay Singh Lamba, Sören Auer, Fabian M. Suchanek, Georgi Kobilarov, Richard Cyganiak, Gjergji Kasneci, AnHai Doan, Christopher W. Brown\n- Research collaborations between these authors: G C Paul Suganthan and Anand Rajaraman, G C Paul Suganthan and AnHai Doan, G C Paul Suganthan and Digvijay Singh Lamba, Anand Rajaraman and Christian Bizer, Anand Rajaraman and Jens Lehmann, Anand Rajaraman and Sören Auer, Anand Rajaraman and Gerhard Weikum, Anand Rajaraman and Fabian M. Suchanek, Anand Rajaraman and Georgi Kobilarov, Anand Rajaraman and Richard Cyganiak, Anand Rajaraman and Gjergji Kasneci, Anand Rajaraman and AnHai Doan, Christian Bizer and Jens Lehmann, Christian Bizer and Sören Auer, Christian Bizer and Gerhard Weikum, Christian Bizer and Fabian M. Suchanek, Christian Bizer and Georgi Kobilarov, Christian Bizer and Richard Cyganiak, Christian Bizer and Gjergji Kasneci, Christian Bizer and AnHai Doan, Christian Bizer and Digvijay Singh Lamba, Gerhard Weikum and Jens Lehmann, Gerhard Weikum and Sören Auer, Gerhard Weikum and Fabian M. Suchanek, Gerhard Weikum and Georgi Kobilarov, Gerhard Weikum and Richard Cyganiak, Gerhard Weikum and Gjergji Kasneci, Gerhard Weikum and AnHai Doan, Gerhard Weikum and Digvijay Singh Lamba, Jens Lehmann and Sören Auer, Jens Lehmann and Fabian M. Suchanek, Jens Lehmann and Georgi Kobilarov, Jens Lehmann and Richard Cyganiak, Jens Lehmann and Gjergji Kasneci, Jens Lehmann and AnHai Doan, Jens Lehmann and Digvijay Singh Lamba, Digvijay Singh Lamba and AnHai Doan, Digvijay Singh Lamba and Sören Auer, Digvijay Singh Lamba and Fabian M. Suchanek, Digvijay Singh Lamba and Georgi Kobilarov, Digvijay Singh Lamba and Richard Cyganiak, Digvijay Singh Lamba and Gjergji Kasneci, Sören Auer and Fabian M. Suchanek, Sören Auer and Georgi Kobilarov, Sören Auer and Richard Cyganiak, Sören Auer and Gjergji Kasneci, Sören Auer and AnHai Doan, Fabian M. Suchanek and Georgi Kobilarov, Fabian M. Suchanek and Richard Cyganiak, Fabian M. Suchanek and Gjergji Kasneci, Fabian M. Suchanek and AnHai Doan, Georgi Kobilarov and Richard Cyganiak, Georgi Kobilarov and Gjergji Kasneci, Georgi Kobilarov and AnHai Doan, Richard Cyganiak and Gjergji Kasneci, Richard Cyganiak and AnHai Doan, Gjergji Kasneci and AnHai Doan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Gregory D. Abowd, Fabian Abel, Khalid Latif, Asad Masood Khattak, Tiberiu Seceleanu, Rabia Batool, Radu Marculescu, Sungyoung Lee, Geert-Jan Houben, Jean-Luc Hainaut, Anind K. Dey, Thomas B. Sheridan, Chun-Hsian Huang, Tanzeem Choudhury\n- Research collaborations between these authors: Gregory D. Abowd and Sungyoung Lee, Gregory D. Abowd and Anind K. Dey, Gregory D. Abowd and Tanzeem Choudhury, Fabian Abel and Sungyoung Lee, Fabian Abel and Geert-Jan Houben, Fabian Abel and Rabia Batool, Khalid Latif and Sungyoung Lee, Khalid Latif and Asad Masood Khattak, Khalid Latif and Radu Marculescu, Khalid Latif and Tiberiu Seceleanu, Khalid Latif and Chun-Hsian Huang, Khalid Latif and Rabia Batool, Asad Masood Khattak and Sungyoung Lee, Asad Masood Khattak and Rabia Batool, Tiberiu Seceleanu and Radu Marculescu, Tiberiu Seceleanu and Chun-Hsian Huang, Rabia Batool and Sungyoung Lee, Rabia Batool and Geert-Jan Houben, Sungyoung Lee and Anind K. Dey, Sungyoung Lee and Geert-Jan Houben, Sungyoung Lee and Tanzeem Choudhury, Geert-Jan Houben and Jean-Luc Hainaut, Anind K. Dey and Tanzeem Choudhury.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Gregory D. Abowd\", \"id\": 13312}, {\"name\": \"Fabian Abel\", \"id\": 69954}, {\"name\": \"Khalid Latif\", \"id\": 192548}, {\"name\": \"Tiberiu Seceleanu\", \"id\": 318565}, {\"name\": \"Asad Masood Khattak\", \"id\": 60965}, {\"name\": \"Rabia Batool\", \"id\": 530471}, {\"name\": \"Radu Marculescu\", \"id\": 208263}, {\"name\": \"Sungyoung Lee\", \"id\": 8112}, {\"name\": \"Geert-Jan Houben\", \"id\": 24882}, {\"name\": \"Jean-Luc Hainaut\", \"id\": 12595}, {\"name\": \"Anind K. Dey\", \"id\": 19731}, {\"name\": \"Thomas B. Sheridan\", \"id\": 519410}, {\"name\": \"Chun-Hsian Huang\", \"id\": 366454}, {\"name\": \"Tanzeem Choudhury\", \"id\": 69694}], \"links\": [{\"source\": 13312, \"target\": 8112}, {\"source\": 13312, \"target\": 19731}, {\"source\": 13312, \"target\": 69694}, {\"source\": 69954, \"target\": 8112}, {\"source\": 69954, \"target\": 24882}, {\"source\": 69954, \"target\": 530471}, {\"source\": 192548, \"target\": 8112}, {\"source\": 192548, \"target\": 60965}, {\"source\": 192548, \"target\": 208263}, {\"source\": 192548, \"target\": 318565}, {\"source\": 192548, \"target\": 366454}, {\"source\": 192548, \"target\": 530471}, {\"source\": 318565, \"target\": 208263}, {\"source\": 318565, \"target\": 366454}, {\"source\": 60965, \"target\": 8112}, {\"source\": 60965, \"target\": 530471}, {\"source\": 530471, \"target\": 8112}, {\"source\": 530471, \"target\": 24882}, {\"source\": 8112, \"target\": 19731}, {\"source\": 8112, \"target\": 24882}, {\"source\": 8112, \"target\": 69694}, {\"source\": 24882, \"target\": 12595}, {\"source\": 19731, \"target\": 69694}]}",
"id": 2903,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Gregory D. Abowd, Fabian Abel, Khalid Latif, Asad Masood Khattak, Tiberiu Seceleanu, Rabia Batool, Radu Marculescu, Sungyoung Lee, Geert-Jan Houben, Jean-Luc Hainaut, Anind K. Dey, Thomas B. Sheridan, Chun-Hsian Huang, Tanzeem Choudhury\n- Research collaborations between these authors: Gregory D. Abowd and Sungyoung Lee, Gregory D. Abowd and Anind K. Dey, Gregory D. Abowd and Tanzeem Choudhury, Fabian Abel and Sungyoung Lee, Fabian Abel and Geert-Jan Houben, Fabian Abel and Rabia Batool, Khalid Latif and Sungyoung Lee, Khalid Latif and Asad Masood Khattak, Khalid Latif and Radu Marculescu, Khalid Latif and Tiberiu Seceleanu, Khalid Latif and Chun-Hsian Huang, Khalid Latif and Rabia Batool, Asad Masood Khattak and Sungyoung Lee, Asad Masood Khattak and Rabia Batool, Tiberiu Seceleanu and Radu Marculescu, Tiberiu Seceleanu and Chun-Hsian Huang, Rabia Batool and Sungyoung Lee, Rabia Batool and Geert-Jan Houben, Sungyoung Lee and Anind K. Dey, Sungyoung Lee and Geert-Jan Houben, Sungyoung Lee and Tanzeem Choudhury, Geert-Jan Houben and Jean-Luc Hainaut, Anind K. Dey and Tanzeem Choudhury.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: John Korah, Meikang Qiu, Eugene Santos, Jeremy E. Thompson, Suresh Subramanian, David A. Bader, Hui Zhao, Long Pan, John Thomas Wilkinson, Hien Nguyen, Deqing Li, Eunice E. Santos, Keke Gai, Fei Yu\n- Research collaborations between these authors: John Korah and Eugene Santos, John Korah and Eunice E. Santos, John Korah and David A. Bader, John Korah and Fei Yu, John Korah and Hien Nguyen, John Korah and Long Pan, John Korah and John Thomas Wilkinson, John Korah and Deqing Li, Meikang Qiu and Hui Zhao, Meikang Qiu and Keke Gai, Meikang Qiu and Long Pan, Eugene Santos and Eunice E. Santos, Eugene Santos and Fei Yu, Eugene Santos and Hien Nguyen, Eugene Santos and Long Pan, Eugene Santos and John Thomas Wilkinson, Eugene Santos and Deqing Li, Eugene Santos and Jeremy E. Thompson, Eugene Santos and Suresh Subramanian, Jeremy E. Thompson and Eunice E. Santos, Jeremy E. Thompson and Long Pan, Jeremy E. Thompson and John Thomas Wilkinson, Suresh Subramanian and David A. Bader, Suresh Subramanian and Eunice E. Santos, Suresh Subramanian and Long Pan, Suresh Subramanian and John Thomas Wilkinson, David A. Bader and Eunice E. Santos, Hui Zhao and Keke Gai, Hui Zhao and Long Pan, Long Pan and Eunice E. Santos, Long Pan and Keke Gai, Long Pan and John Thomas Wilkinson, John Thomas Wilkinson and Eunice E. Santos, John Thomas Wilkinson and Fei Yu, John Thomas Wilkinson and Deqing Li, Hien Nguyen and Eunice E. Santos, Hien Nguyen and Fei Yu, Deqing Li and Eunice E. Santos, Eunice E. Santos and Fei Yu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"John Korah\", \"id\": 544040}, {\"name\": \"Meikang Qiu\", \"id\": 152074}, {\"name\": \"Eugene Santos\", \"id\": 9227}, {\"name\": \"Jeremy E. Thompson\", \"id\": 805771}, {\"name\": \"Suresh Subramanian\", \"id\": 947535}, {\"name\": \"David A. Bader\", \"id\": 1136}, {\"name\": \"Hui Zhao\", \"id\": 54098}, {\"name\": \"Long Pan\", \"id\": 160307}, {\"name\": \"John Thomas Wilkinson\", \"id\": 160308}, {\"name\": \"Hien Nguyen\", \"id\": 79093}, {\"name\": \"Deqing Li\", \"id\": 199452}, {\"name\": \"Eunice E. Santos\", \"id\": 36925}, {\"name\": \"Keke Gai\", \"id\": 184926}, {\"name\": \"Fei Yu\", \"id\": 52639}], \"links\": [{\"source\": 544040, \"target\": 9227}, {\"source\": 544040, \"target\": 36925}, {\"source\": 544040, \"target\": 1136}, {\"source\": 544040, \"target\": 52639}, {\"source\": 544040, \"target\": 79093}, {\"source\": 544040, \"target\": 160307}, {\"source\": 544040, \"target\": 160308}, {\"source\": 544040, \"target\": 199452}, {\"source\": 152074, \"target\": 54098}, {\"source\": 152074, \"target\": 184926}, {\"source\": 152074, \"target\": 160307}, {\"source\": 9227, \"target\": 36925}, {\"source\": 9227, \"target\": 52639}, {\"source\": 9227, \"target\": 79093}, {\"source\": 9227, \"target\": 160307}, {\"source\": 9227, \"target\": 160308}, {\"source\": 9227, \"target\": 199452}, {\"source\": 9227, \"target\": 805771}, {\"source\": 9227, \"target\": 947535}, {\"source\": 805771, \"target\": 36925}, {\"source\": 805771, \"target\": 160307}, {\"source\": 805771, \"target\": 160308}, {\"source\": 947535, \"target\": 1136}, {\"source\": 947535, \"target\": 36925}, {\"source\": 947535, \"target\": 160307}, {\"source\": 947535, \"target\": 160308}, {\"source\": 1136, \"target\": 36925}, {\"source\": 54098, \"target\": 184926}, {\"source\": 54098, \"target\": 160307}, {\"source\": 160307, \"target\": 36925}, {\"source\": 160307, \"target\": 184926}, {\"source\": 160307, \"target\": 160308}, {\"source\": 160308, \"target\": 36925}, {\"source\": 160308, \"target\": 52639}, {\"source\": 160308, \"target\": 199452}, {\"source\": 79093, \"target\": 36925}, {\"source\": 79093, \"target\": 52639}, {\"source\": 199452, \"target\": 36925}, {\"source\": 36925, \"target\": 52639}]}",
"id": 1241,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: John Korah, Meikang Qiu, Eugene Santos, Jeremy E. Thompson, Suresh Subramanian, David A. Bader, Hui Zhao, Long Pan, John Thomas Wilkinson, Hien Nguyen, Deqing Li, Eunice E. Santos, Keke Gai, Fei Yu\n- Research collaborations between these authors: John Korah and Eugene Santos, John Korah and Eunice E. Santos, John Korah and David A. Bader, John Korah and Fei Yu, John Korah and Hien Nguyen, John Korah and Long Pan, John Korah and John Thomas Wilkinson, John Korah and Deqing Li, Meikang Qiu and Hui Zhao, Meikang Qiu and Keke Gai, Meikang Qiu and Long Pan, Eugene Santos and Eunice E. Santos, Eugene Santos and Fei Yu, Eugene Santos and Hien Nguyen, Eugene Santos and Long Pan, Eugene Santos and John Thomas Wilkinson, Eugene Santos and Deqing Li, Eugene Santos and Jeremy E. Thompson, Eugene Santos and Suresh Subramanian, Jeremy E. Thompson and Eunice E. Santos, Jeremy E. Thompson and Long Pan, Jeremy E. Thompson and John Thomas Wilkinson, Suresh Subramanian and David A. Bader, Suresh Subramanian and Eunice E. Santos, Suresh Subramanian and Long Pan, Suresh Subramanian and John Thomas Wilkinson, David A. Bader and Eunice E. Santos, Hui Zhao and Keke Gai, Hui Zhao and Long Pan, Long Pan and Eunice E. Santos, Long Pan and Keke Gai, Long Pan and John Thomas Wilkinson, John Thomas Wilkinson and Eunice E. Santos, John Thomas Wilkinson and Fei Yu, John Thomas Wilkinson and Deqing Li, Hien Nguyen and Eunice E. Santos, Hien Nguyen and Fei Yu, Deqing Li and Eunice E. Santos, Eunice E. Santos and Fei Yu.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Shanyu Huang, Yuxin Miao, Martin L. Gnyp, Victoria I. S. Lenz-Wiedemann, Gunter Menz, Xinping Chen, Darren Turner, Yinkun Yao, Georg Bareth, Arko Lucieer, Wolfgang Koppe, Christoph Hütt, Helge Aasen, Fei Yuan\n- Research collaborations between these authors: Shanyu Huang and Yuxin Miao, Yuxin Miao and Fei Yuan, Yuxin Miao and Georg Bareth, Yuxin Miao and Martin L. Gnyp, Yuxin Miao and Victoria I. S. Lenz-Wiedemann, Martin L. Gnyp and Georg Bareth, Victoria I. S. Lenz-Wiedemann and Georg Bareth, Gunter Menz and Georg Bareth, Xinping Chen and Georg Bareth, Darren Turner and Georg Bareth, Darren Turner and Arko Lucieer, Yinkun Yao and Georg Bareth, Georg Bareth and Fei Yuan, Georg Bareth and Arko Lucieer, Georg Bareth and Wolfgang Koppe, Georg Bareth and Christoph Hütt, Georg Bareth and Helge Aasen.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Shanyu Huang\", \"id\": 448455}, {\"name\": \"Yuxin Miao\", \"id\": 448456}, {\"name\": \"Martin L. Gnyp\", \"id\": 448460}, {\"name\": \"Victoria I. S. Lenz-Wiedemann\", \"id\": 448461}, {\"name\": \"Xinping Chen\", \"id\": 660782}, {\"name\": \"Yinkun Yao\", \"id\": 660781}, {\"name\": \"Darren Turner\", \"id\": 520624}, {\"name\": \"Wolfgang Koppe\", \"id\": 626958}, {\"name\": \"Georg Bareth\", \"id\": 70514}, {\"name\": \"Arko Lucieer\", \"id\": 359666}, {\"name\": \"Christoph H\\u00fctt\", \"id\": 660780}, {\"name\": \"Fei Yuan\", \"id\": 35678}, {\"name\": \"Helge Aasen\", \"id\": 456760}, {\"name\": \"Gunter Menz\", \"id\": 343806}], \"links\": [{\"source\": 448455, \"target\": 448456}, {\"source\": 448456, \"target\": 35678}, {\"source\": 448456, \"target\": 70514}, {\"source\": 448456, \"target\": 448460}, {\"source\": 448456, \"target\": 448461}, {\"source\": 448460, \"target\": 70514}, {\"source\": 448461, \"target\": 70514}, {\"source\": 660782, \"target\": 70514}, {\"source\": 660781, \"target\": 70514}, {\"source\": 520624, \"target\": 70514}, {\"source\": 520624, \"target\": 359666}, {\"source\": 626958, \"target\": 70514}, {\"source\": 70514, \"target\": 35678}, {\"source\": 70514, \"target\": 343806}, {\"source\": 70514, \"target\": 359666}, {\"source\": 70514, \"target\": 660780}, {\"source\": 70514, \"target\": 456760}]}",
"id": 1526,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Shanyu Huang, Yuxin Miao, Martin L. Gnyp, Victoria I. S. Lenz-Wiedemann, Gunter Menz, Xinping Chen, Darren Turner, Yinkun Yao, Georg Bareth, Arko Lucieer, Wolfgang Koppe, Christoph Hütt, Helge Aasen, Fei Yuan\n- Research collaborations between these authors: Shanyu Huang and Yuxin Miao, Yuxin Miao and Fei Yuan, Yuxin Miao and Georg Bareth, Yuxin Miao and Martin L. Gnyp, Yuxin Miao and Victoria I. S. Lenz-Wiedemann, Martin L. Gnyp and Georg Bareth, Victoria I. S. Lenz-Wiedemann and Georg Bareth, Gunter Menz and Georg Bareth, Xinping Chen and Georg Bareth, Darren Turner and Georg Bareth, Darren Turner and Arko Lucieer, Yinkun Yao and Georg Bareth, Georg Bareth and Fei Yuan, Georg Bareth and Arko Lucieer, Georg Bareth and Wolfgang Koppe, Georg Bareth and Christoph Hütt, Georg Bareth and Helge Aasen.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Sheng Zhong, Roland Siegwart, Mark W. Maimone, James W. Alexander, Andres Huertas, Ashitey Trebi-Ollennu, Andrew Edie Johnson, Larry H. Matthies, Lee E. Clement, Robert G. Bonitz, Feng Zhou, Anastasios I. Mourikis, Stergios I. Roumeliotis, Yang Cheng\n- Research collaborations between these authors: Sheng Zhong and Andrew Edie Johnson, Sheng Zhong and Larry H. Matthies, Roland Siegwart and Anastasios I. Mourikis, Roland Siegwart and Stergios I. Roumeliotis, Roland Siegwart and Andrew Edie Johnson, Roland Siegwart and Larry H. Matthies, Roland Siegwart and Yang Cheng, Roland Siegwart and Mark W. Maimone, Roland Siegwart and Lee E. Clement, Mark W. Maimone and Stergios I. Roumeliotis, Mark W. Maimone and Andrew Edie Johnson, Mark W. Maimone and Larry H. Matthies, Mark W. Maimone and Feng Zhou, Mark W. Maimone and Yang Cheng, Mark W. Maimone and James W. Alexander, Mark W. Maimone and Robert G. Bonitz, Mark W. Maimone and Ashitey Trebi-Ollennu, Mark W. Maimone and Lee E. Clement, Mark W. Maimone and Andres Huertas, James W. Alexander and Andrew Edie Johnson, James W. Alexander and Larry H. Matthies, Andres Huertas and Andrew Edie Johnson, Andres Huertas and Larry H. Matthies, Andres Huertas and Yang Cheng, Ashitey Trebi-Ollennu and Stergios I. Roumeliotis, Ashitey Trebi-Ollennu and Larry H. Matthies, Ashitey Trebi-Ollennu and Robert G. Bonitz, Ashitey Trebi-Ollennu and Yang Cheng, Andrew Edie Johnson and Anastasios I. Mourikis, Andrew Edie Johnson and Stergios I. Roumeliotis, Andrew Edie Johnson and Larry H. Matthies, Andrew Edie Johnson and Yang Cheng, Larry H. Matthies and Anastasios I. Mourikis, Larry H. Matthies and Stergios I. Roumeliotis, Larry H. Matthies and Yang Cheng, Larry H. Matthies and Robert G. Bonitz, Larry H. Matthies and Lee E. Clement, Lee E. Clement and Anastasios I. Mourikis, Lee E. Clement and Stergios I. Roumeliotis, Lee E. Clement and Yang Cheng, Robert G. Bonitz and Yang Cheng, Anastasios I. Mourikis and Stergios I. Roumeliotis, Anastasios I. Mourikis and Yang Cheng, Stergios I. Roumeliotis and Yang Cheng.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Sheng Zhong\", \"id\": 60481}, {\"name\": \"Roland Siegwart\", \"id\": 18306}, {\"name\": \"Mark W. Maimone\", \"id\": 269189}, {\"name\": \"James W. Alexander\", \"id\": 269191}, {\"name\": \"Andres Huertas\", \"id\": 647465}, {\"name\": \"Ashitey Trebi-Ollennu\", \"id\": 334762}, {\"name\": \"Andrew Edie Johnson\", \"id\": 54507}, {\"name\": \"Larry H. Matthies\", \"id\": 54508}, {\"name\": \"Lee E. Clement\", \"id\": 368653}, {\"name\": \"Robert G. Bonitz\", \"id\": 327696}, {\"name\": \"Feng Zhou\", \"id\": 68054}, {\"name\": \"Anastasios I. Mourikis\", \"id\": 36636}, {\"name\": \"Stergios I. Roumeliotis\", \"id\": 36637}, {\"name\": \"Yang Cheng\", \"id\": 176958}], \"links\": [{\"source\": 60481, \"target\": 54507}, {\"source\": 60481, \"target\": 54508}, {\"source\": 18306, \"target\": 36636}, {\"source\": 18306, \"target\": 36637}, {\"source\": 18306, \"target\": 54507}, {\"source\": 18306, \"target\": 54508}, {\"source\": 18306, \"target\": 176958}, {\"source\": 18306, \"target\": 269189}, {\"source\": 18306, \"target\": 368653}, {\"source\": 269189, \"target\": 36637}, {\"source\": 269189, \"target\": 54507}, {\"source\": 269189, \"target\": 54508}, {\"source\": 269189, \"target\": 68054}, {\"source\": 269189, \"target\": 176958}, {\"source\": 269189, \"target\": 269191}, {\"source\": 269189, \"target\": 327696}, {\"source\": 269189, \"target\": 334762}, {\"source\": 269189, \"target\": 368653}, {\"source\": 269189, \"target\": 647465}, {\"source\": 269191, \"target\": 54507}, {\"source\": 269191, \"target\": 54508}, {\"source\": 647465, \"target\": 54507}, {\"source\": 647465, \"target\": 54508}, {\"source\": 647465, \"target\": 176958}, {\"source\": 334762, \"target\": 36637}, {\"source\": 334762, \"target\": 54508}, {\"source\": 334762, \"target\": 327696}, {\"source\": 334762, \"target\": 176958}, {\"source\": 54507, \"target\": 36636}, {\"source\": 54507, \"target\": 36637}, {\"source\": 54507, \"target\": 54508}, {\"source\": 54507, \"target\": 176958}, {\"source\": 54508, \"target\": 36636}, {\"source\": 54508, \"target\": 36637}, {\"source\": 54508, \"target\": 176958}, {\"source\": 54508, \"target\": 327696}, {\"source\": 54508, \"target\": 368653}, {\"source\": 368653, \"target\": 36636}, {\"source\": 368653, \"target\": 36637}, {\"source\": 368653, \"target\": 176958}, {\"source\": 327696, \"target\": 176958}, {\"source\": 36636, \"target\": 36637}, {\"source\": 36636, \"target\": 176958}, {\"source\": 36637, \"target\": 176958}]}",
"id": 1017,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Sheng Zhong, Roland Siegwart, Mark W. Maimone, James W. Alexander, Andres Huertas, Ashitey Trebi-Ollennu, Andrew Edie Johnson, Larry H. Matthies, Lee E. Clement, Robert G. Bonitz, Feng Zhou, Anastasios I. Mourikis, Stergios I. Roumeliotis, Yang Cheng\n- Research collaborations between these authors: Sheng Zhong and Andrew Edie Johnson, Sheng Zhong and Larry H. Matthies, Roland Siegwart and Anastasios I. Mourikis, Roland Siegwart and Stergios I. Roumeliotis, Roland Siegwart and Andrew Edie Johnson, Roland Siegwart and Larry H. Matthies, Roland Siegwart and Yang Cheng, Roland Siegwart and Mark W. Maimone, Roland Siegwart and Lee E. Clement, Mark W. Maimone and Stergios I. Roumeliotis, Mark W. Maimone and Andrew Edie Johnson, Mark W. Maimone and Larry H. Matthies, Mark W. Maimone and Feng Zhou, Mark W. Maimone and Yang Cheng, Mark W. Maimone and James W. Alexander, Mark W. Maimone and Robert G. Bonitz, Mark W. Maimone and Ashitey Trebi-Ollennu, Mark W. Maimone and Lee E. Clement, Mark W. Maimone and Andres Huertas, James W. Alexander and Andrew Edie Johnson, James W. Alexander and Larry H. Matthies, Andres Huertas and Andrew Edie Johnson, Andres Huertas and Larry H. Matthies, Andres Huertas and Yang Cheng, Ashitey Trebi-Ollennu and Stergios I. Roumeliotis, Ashitey Trebi-Ollennu and Larry H. Matthies, Ashitey Trebi-Ollennu and Robert G. Bonitz, Ashitey Trebi-Ollennu and Yang Cheng, Andrew Edie Johnson and Anastasios I. Mourikis, Andrew Edie Johnson and Stergios I. Roumeliotis, Andrew Edie Johnson and Larry H. Matthies, Andrew Edie Johnson and Yang Cheng, Larry H. Matthies and Anastasios I. Mourikis, Larry H. Matthies and Stergios I. Roumeliotis, Larry H. Matthies and Yang Cheng, Larry H. Matthies and Robert G. Bonitz, Larry H. Matthies and Lee E. Clement, Lee E. Clement and Anastasios I. Mourikis, Lee E. Clement and Stergios I. Roumeliotis, Lee E. Clement and Yang Cheng, Robert G. Bonitz and Yang Cheng, Anastasios I. Mourikis and Stergios I. Roumeliotis, Anastasios I. Mourikis and Yang Cheng, Stergios I. Roumeliotis and Yang Cheng.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Daniel Schall, Alex Cozzi, Athman Bouguettaya, Ladan Tahvildari, Schahram Dustdar, Richard E. Potter, Craig Gentry, Dmitry Pavlov, Raghu Ramakrishnan, Seng Wai Loke, Alexander S. Szalay, Eric Horvitz, Marlon Dumas, AnHai Doan\n- Research collaborations between these authors: Daniel Schall and Schahram Dustdar, Daniel Schall and Eric Horvitz, Daniel Schall and Alexander S. Szalay, Daniel Schall and Seng Wai Loke, Daniel Schall and Athman Bouguettaya, Daniel Schall and Marlon Dumas, Daniel Schall and Craig Gentry, Daniel Schall and Ladan Tahvildari, Daniel Schall and AnHai Doan, Daniel Schall and Dmitry Pavlov, Daniel Schall and Raghu Ramakrishnan, Daniel Schall and Alex Cozzi, Daniel Schall and Richard E. Potter, Alex Cozzi and Schahram Dustdar, Athman Bouguettaya and Schahram Dustdar, Athman Bouguettaya and Marlon Dumas, Ladan Tahvildari and Schahram Dustdar, Schahram Dustdar and Eric Horvitz, Schahram Dustdar and Alexander S. Szalay, Schahram Dustdar and Seng Wai Loke, Schahram Dustdar and Marlon Dumas, Schahram Dustdar and AnHai Doan, Schahram Dustdar and Raghu Ramakrishnan, Raghu Ramakrishnan and Eric Horvitz, Raghu Ramakrishnan and AnHai Doan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Daniel Schall\", \"id\": 86657}, {\"name\": \"Athman Bouguettaya\", \"id\": 45830}, {\"name\": \"Ladan Tahvildari\", \"id\": 68840}, {\"name\": \"Schahram Dustdar\", \"id\": 12494}, {\"name\": \"Richard E. Potter\", \"id\": 546510}, {\"name\": \"Craig Gentry\", \"id\": 63856}, {\"name\": \"Eric Horvitz\", \"id\": 3705}, {\"name\": \"Dmitry Pavlov\", \"id\": 118803}, {\"name\": \"Raghu Ramakrishnan\", \"id\": 123542}, {\"name\": \"Seng Wai Loke\", \"id\": 29974}, {\"name\": \"Alexander S. Szalay\", \"id\": 27702}, {\"name\": \"Alex Cozzi\", \"id\": 376633}, {\"name\": \"Marlon Dumas\", \"id\": 59034}, {\"name\": \"AnHai Doan\", \"id\": 110236}], \"links\": [{\"source\": 86657, \"target\": 12494}, {\"source\": 86657, \"target\": 3705}, {\"source\": 86657, \"target\": 27702}, {\"source\": 86657, \"target\": 29974}, {\"source\": 86657, \"target\": 45830}, {\"source\": 86657, \"target\": 59034}, {\"source\": 86657, \"target\": 63856}, {\"source\": 86657, \"target\": 68840}, {\"source\": 86657, \"target\": 110236}, {\"source\": 86657, \"target\": 118803}, {\"source\": 86657, \"target\": 123542}, {\"source\": 86657, \"target\": 376633}, {\"source\": 86657, \"target\": 546510}, {\"source\": 45830, \"target\": 12494}, {\"source\": 45830, \"target\": 59034}, {\"source\": 68840, \"target\": 12494}, {\"source\": 12494, \"target\": 3705}, {\"source\": 12494, \"target\": 27702}, {\"source\": 12494, \"target\": 29974}, {\"source\": 12494, \"target\": 59034}, {\"source\": 12494, \"target\": 110236}, {\"source\": 12494, \"target\": 123542}, {\"source\": 12494, \"target\": 376633}, {\"source\": 3705, \"target\": 123542}, {\"source\": 123542, \"target\": 110236}]}",
"id": 1705,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Daniel Schall, Alex Cozzi, Athman Bouguettaya, Ladan Tahvildari, Schahram Dustdar, Richard E. Potter, Craig Gentry, Dmitry Pavlov, Raghu Ramakrishnan, Seng Wai Loke, Alexander S. Szalay, Eric Horvitz, Marlon Dumas, AnHai Doan\n- Research collaborations between these authors: Daniel Schall and Schahram Dustdar, Daniel Schall and Eric Horvitz, Daniel Schall and Alexander S. Szalay, Daniel Schall and Seng Wai Loke, Daniel Schall and Athman Bouguettaya, Daniel Schall and Marlon Dumas, Daniel Schall and Craig Gentry, Daniel Schall and Ladan Tahvildari, Daniel Schall and AnHai Doan, Daniel Schall and Dmitry Pavlov, Daniel Schall and Raghu Ramakrishnan, Daniel Schall and Alex Cozzi, Daniel Schall and Richard E. Potter, Alex Cozzi and Schahram Dustdar, Athman Bouguettaya and Schahram Dustdar, Athman Bouguettaya and Marlon Dumas, Ladan Tahvildari and Schahram Dustdar, Schahram Dustdar and Eric Horvitz, Schahram Dustdar and Alexander S. Szalay, Schahram Dustdar and Seng Wai Loke, Schahram Dustdar and Marlon Dumas, Schahram Dustdar and AnHai Doan, Schahram Dustdar and Raghu Ramakrishnan, Raghu Ramakrishnan and Eric Horvitz, Raghu Ramakrishnan and AnHai Doan.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Xiapu Luo, Zhenzhou Tian, Yoon-Chan Jhi, Wu Zhou, Peng Liu, Sencun Zhu, Qinghua Zheng, Christian S. Collberg, Seokwoo Choi, Saumya K. Debray, Zijiang Yang, Eryue Zhuang, Ginger Myles, Yajin Zhou\n- Research collaborations between these authors: Xiapu Luo and Peng Liu, Xiapu Luo and Yajin Zhou, Xiapu Luo and Wu Zhou, Xiapu Luo and Zhenzhou Tian, Zhenzhou Tian and Zijiang Yang, Zhenzhou Tian and Qinghua Zheng, Zhenzhou Tian and Peng Liu, Zhenzhou Tian and Sencun Zhu, Zhenzhou Tian and Yajin Zhou, Zhenzhou Tian and Christian S. Collberg, Zhenzhou Tian and Wu Zhou, Zhenzhou Tian and Ginger Myles, Zhenzhou Tian and Saumya K. Debray, Zhenzhou Tian and Yoon-Chan Jhi, Zhenzhou Tian and Seokwoo Choi, Zhenzhou Tian and Eryue Zhuang, Yoon-Chan Jhi and Zijiang Yang, Yoon-Chan Jhi and Peng Liu, Yoon-Chan Jhi and Sencun Zhu, Yoon-Chan Jhi and Qinghua Zheng, Yoon-Chan Jhi and Christian S. Collberg, Yoon-Chan Jhi and Ginger Myles, Yoon-Chan Jhi and Saumya K. Debray, Wu Zhou and Peng Liu, Wu Zhou and Sencun Zhu, Wu Zhou and Yajin Zhou, Peng Liu and Zijiang Yang, Peng Liu and Sencun Zhu, Peng Liu and Yajin Zhou, Peng Liu and Christian S. Collberg, Peng Liu and Ginger Myles, Peng Liu and Saumya K. Debray, Peng Liu and Qinghua Zheng, Peng Liu and Eryue Zhuang, Sencun Zhu and Zijiang Yang, Sencun Zhu and Yajin Zhou, Sencun Zhu and Christian S. Collberg, Sencun Zhu and Ginger Myles, Sencun Zhu and Saumya K. Debray, Sencun Zhu and Qinghua Zheng, Sencun Zhu and Eryue Zhuang, Qinghua Zheng and Zijiang Yang, Qinghua Zheng and Christian S. Collberg, Qinghua Zheng and Ginger Myles, Qinghua Zheng and Saumya K. Debray, Qinghua Zheng and Seokwoo Choi, Qinghua Zheng and Eryue Zhuang, Christian S. Collberg and Zijiang Yang, Christian S. Collberg and Ginger Myles, Christian S. Collberg and Saumya K. Debray, Christian S. Collberg and Seokwoo Choi, Christian S. Collberg and Eryue Zhuang, Seokwoo Choi and Zijiang Yang, Seokwoo Choi and Ginger Myles, Saumya K. Debray and Ginger Myles, Zijiang Yang and Ginger Myles.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Xiapu Luo\", \"id\": 177537}, {\"name\": \"Zhenzhou Tian\", \"id\": 516867}, {\"name\": \"Wu Zhou\", \"id\": 217285}, {\"name\": \"Yoon-Chan Jhi\", \"id\": 320261}, {\"name\": \"Peng Liu\", \"id\": 6599}, {\"name\": \"Sencun Zhu\", \"id\": 9514}, {\"name\": \"Qinghua Zheng\", \"id\": 45904}, {\"name\": \"Christian S. Collberg\", \"id\": 67793}, {\"name\": \"Seokwoo Choi\", \"id\": 516370}, {\"name\": \"Saumya K. Debray\", \"id\": 240405}, {\"name\": \"Zijiang Yang\", \"id\": 1947}, {\"name\": \"Eryue Zhuang\", \"id\": 1179068}, {\"name\": \"Ginger Myles\", \"id\": 229085}, {\"name\": \"Yajin Zhou\", \"id\": 32446}], \"links\": [{\"source\": 177537, \"target\": 6599}, {\"source\": 177537, \"target\": 32446}, {\"source\": 177537, \"target\": 217285}, {\"source\": 177537, \"target\": 516867}, {\"source\": 516867, \"target\": 1947}, {\"source\": 516867, \"target\": 45904}, {\"source\": 516867, \"target\": 6599}, {\"source\": 516867, \"target\": 9514}, {\"source\": 516867, \"target\": 32446}, {\"source\": 516867, \"target\": 67793}, {\"source\": 516867, \"target\": 217285}, {\"source\": 516867, \"target\": 229085}, {\"source\": 516867, \"target\": 240405}, {\"source\": 516867, \"target\": 320261}, {\"source\": 516867, \"target\": 516370}, {\"source\": 516867, \"target\": 1179068}, {\"source\": 217285, \"target\": 6599}, {\"source\": 217285, \"target\": 9514}, {\"source\": 217285, \"target\": 32446}, {\"source\": 320261, \"target\": 1947}, {\"source\": 320261, \"target\": 6599}, {\"source\": 320261, \"target\": 9514}, {\"source\": 320261, \"target\": 45904}, {\"source\": 320261, \"target\": 67793}, {\"source\": 320261, \"target\": 229085}, {\"source\": 320261, \"target\": 240405}, {\"source\": 6599, \"target\": 1947}, {\"source\": 6599, \"target\": 9514}, {\"source\": 6599, \"target\": 32446}, {\"source\": 6599, \"target\": 67793}, {\"source\": 6599, \"target\": 229085}, {\"source\": 6599, \"target\": 240405}, {\"source\": 6599, \"target\": 45904}, {\"source\": 6599, \"target\": 1179068}, {\"source\": 9514, \"target\": 1947}, {\"source\": 9514, \"target\": 32446}, {\"source\": 9514, \"target\": 67793}, {\"source\": 9514, \"target\": 229085}, {\"source\": 9514, \"target\": 240405}, {\"source\": 9514, \"target\": 45904}, {\"source\": 9514, \"target\": 1179068}, {\"source\": 45904, \"target\": 1947}, {\"source\": 45904, \"target\": 67793}, {\"source\": 45904, \"target\": 229085}, {\"source\": 45904, \"target\": 240405}, {\"source\": 45904, \"target\": 516370}, {\"source\": 45904, \"target\": 1179068}, {\"source\": 67793, \"target\": 1947}, {\"source\": 67793, \"target\": 229085}, {\"source\": 67793, \"target\": 240405}, {\"source\": 67793, \"target\": 516370}, {\"source\": 67793, \"target\": 1179068}, {\"source\": 516370, \"target\": 1947}, {\"source\": 516370, \"target\": 229085}, {\"source\": 240405, \"target\": 229085}, {\"source\": 1947, \"target\": 229085}]}",
"id": 586,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Xiapu Luo, Zhenzhou Tian, Yoon-Chan Jhi, Wu Zhou, Peng Liu, Sencun Zhu, Qinghua Zheng, Christian S. Collberg, Seokwoo Choi, Saumya K. Debray, Zijiang Yang, Eryue Zhuang, Ginger Myles, Yajin Zhou\n- Research collaborations between these authors: Xiapu Luo and Peng Liu, Xiapu Luo and Yajin Zhou, Xiapu Luo and Wu Zhou, Xiapu Luo and Zhenzhou Tian, Zhenzhou Tian and Zijiang Yang, Zhenzhou Tian and Qinghua Zheng, Zhenzhou Tian and Peng Liu, Zhenzhou Tian and Sencun Zhu, Zhenzhou Tian and Yajin Zhou, Zhenzhou Tian and Christian S. Collberg, Zhenzhou Tian and Wu Zhou, Zhenzhou Tian and Ginger Myles, Zhenzhou Tian and Saumya K. Debray, Zhenzhou Tian and Yoon-Chan Jhi, Zhenzhou Tian and Seokwoo Choi, Zhenzhou Tian and Eryue Zhuang, Yoon-Chan Jhi and Zijiang Yang, Yoon-Chan Jhi and Peng Liu, Yoon-Chan Jhi and Sencun Zhu, Yoon-Chan Jhi and Qinghua Zheng, Yoon-Chan Jhi and Christian S. Collberg, Yoon-Chan Jhi and Ginger Myles, Yoon-Chan Jhi and Saumya K. Debray, Wu Zhou and Peng Liu, Wu Zhou and Sencun Zhu, Wu Zhou and Yajin Zhou, Peng Liu and Zijiang Yang, Peng Liu and Sencun Zhu, Peng Liu and Yajin Zhou, Peng Liu and Christian S. Collberg, Peng Liu and Ginger Myles, Peng Liu and Saumya K. Debray, Peng Liu and Qinghua Zheng, Peng Liu and Eryue Zhuang, Sencun Zhu and Zijiang Yang, Sencun Zhu and Yajin Zhou, Sencun Zhu and Christian S. Collberg, Sencun Zhu and Ginger Myles, Sencun Zhu and Saumya K. Debray, Sencun Zhu and Qinghua Zheng, Sencun Zhu and Eryue Zhuang, Qinghua Zheng and Zijiang Yang, Qinghua Zheng and Christian S. Collberg, Qinghua Zheng and Ginger Myles, Qinghua Zheng and Saumya K. Debray, Qinghua Zheng and Seokwoo Choi, Qinghua Zheng and Eryue Zhuang, Christian S. Collberg and Zijiang Yang, Christian S. Collberg and Ginger Myles, Christian S. Collberg and Saumya K. Debray, Christian S. Collberg and Seokwoo Choi, Christian S. Collberg and Eryue Zhuang, Seokwoo Choi and Zijiang Yang, Seokwoo Choi and Ginger Myles, Saumya K. Debray and Ginger Myles, Zijiang Yang and Ginger Myles.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hugo Silva, Foteini Agrafioti, Ikenna Odinaka, Adrian D. C. Chan, Alan D. Kaplan, Erik J. Sirevaag, John W. Rohrbaugh, Siddarth Hari, Dimitrios Hatzinakos, José Guerreiro, André Lourenço, Rui Ferreira, Anil K. Jain, Ana L. N. Fred\n- Research collaborations between these authors: Hugo Silva and André Lourenço, Hugo Silva and Ana L. N. Fred, Hugo Silva and Anil K. Jain, Hugo Silva and Dimitrios Hatzinakos, Hugo Silva and Adrian D. C. Chan, Hugo Silva and Foteini Agrafioti, Hugo Silva and Alan D. Kaplan, Hugo Silva and Erik J. Sirevaag, Hugo Silva and John W. Rohrbaugh, Hugo Silva and Ikenna Odinaka, Hugo Silva and José Guerreiro, Hugo Silva and Rui Ferreira, Hugo Silva and Siddarth Hari, Foteini Agrafioti and André Lourenço, Foteini Agrafioti and Ana L. N. Fred, Foteini Agrafioti and Dimitrios Hatzinakos, Foteini Agrafioti and Alan D. Kaplan, Foteini Agrafioti and Erik J. Sirevaag, Foteini Agrafioti and John W. Rohrbaugh, Foteini Agrafioti and Ikenna Odinaka, Foteini Agrafioti and Siddarth Hari, Ikenna Odinaka and André Lourenço, Ikenna Odinaka and Ana L. N. Fred, Ikenna Odinaka and Dimitrios Hatzinakos, Ikenna Odinaka and Alan D. Kaplan, Ikenna Odinaka and Erik J. Sirevaag, Ikenna Odinaka and John W. Rohrbaugh, Ikenna Odinaka and Siddarth Hari, Adrian D. C. Chan and André Lourenço, Adrian D. C. Chan and Ana L. N. Fred, Adrian D. C. Chan and Dimitrios Hatzinakos, Alan D. Kaplan and André Lourenço, Alan D. Kaplan and Ana L. N. Fred, Alan D. Kaplan and Dimitrios Hatzinakos, Alan D. Kaplan and Erik J. Sirevaag, Alan D. Kaplan and John W. Rohrbaugh, Alan D. Kaplan and Siddarth Hari, Erik J. Sirevaag and André Lourenço, Erik J. Sirevaag and Ana L. N. Fred, Erik J. Sirevaag and Dimitrios Hatzinakos, Erik J. Sirevaag and John W. Rohrbaugh, Erik J. Sirevaag and Siddarth Hari, John W. Rohrbaugh and André Lourenço, John W. Rohrbaugh and Ana L. N. Fred, John W. Rohrbaugh and Dimitrios Hatzinakos, John W. Rohrbaugh and Siddarth Hari, Siddarth Hari and Dimitrios Hatzinakos, Siddarth Hari and Ana L. N. Fred, Dimitrios Hatzinakos and André Lourenço, Dimitrios Hatzinakos and Ana L. N. Fred, Dimitrios Hatzinakos and Anil K. Jain, José Guerreiro and André Lourenço, José Guerreiro and Ana L. N. Fred, André Lourenço and Ana L. N. Fred, André Lourenço and Anil K. Jain, André Lourenço and Rui Ferreira, Rui Ferreira and Ana L. N. Fred, Anil K. Jain and Ana L. N. Fred.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 9,
"style": "rule"
}
|
{
"exact_answer": 9,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Hugo Silva\", \"id\": 23872}, {\"name\": \"Foteini Agrafioti\", \"id\": 667297}, {\"name\": \"Ikenna Odinaka\", \"id\": 685796}, {\"name\": \"Adrian D. C. Chan\", \"id\": 413063}, {\"name\": \"Alan D. Kaplan\", \"id\": 677961}, {\"name\": \"Erik J. Sirevaag\", \"id\": 677963}, {\"name\": \"John W. Rohrbaugh\", \"id\": 677964}, {\"name\": \"Siddarth Hari\", \"id\": 746573}, {\"name\": \"Dimitrios Hatzinakos\", \"id\": 235630}, {\"name\": \"Jos\\u00e9 Guerreiro\", \"id\": 44333}, {\"name\": \"Andr\\u00e9 Louren\\u00e7o\", \"id\": 5811}, {\"name\": \"Rui Ferreira\", \"id\": 670228}, {\"name\": \"Anil K. Jain\", \"id\": 28181}, {\"name\": \"Ana L. N. Fred\", \"id\": 12759}], \"links\": [{\"source\": 23872, \"target\": 5811}, {\"source\": 23872, \"target\": 12759}, {\"source\": 23872, \"target\": 28181}, {\"source\": 23872, \"target\": 235630}, {\"source\": 23872, \"target\": 413063}, {\"source\": 23872, \"target\": 667297}, {\"source\": 23872, \"target\": 677961}, {\"source\": 23872, \"target\": 677963}, {\"source\": 23872, \"target\": 677964}, {\"source\": 23872, \"target\": 685796}, {\"source\": 23872, \"target\": 44333}, {\"source\": 23872, \"target\": 670228}, {\"source\": 23872, \"target\": 746573}, {\"source\": 667297, \"target\": 5811}, {\"source\": 667297, \"target\": 12759}, {\"source\": 667297, \"target\": 235630}, {\"source\": 667297, \"target\": 677961}, {\"source\": 667297, \"target\": 677963}, {\"source\": 667297, \"target\": 677964}, {\"source\": 667297, \"target\": 685796}, {\"source\": 667297, \"target\": 746573}, {\"source\": 685796, \"target\": 5811}, {\"source\": 685796, \"target\": 12759}, {\"source\": 685796, \"target\": 235630}, {\"source\": 685796, \"target\": 677961}, {\"source\": 685796, \"target\": 677963}, {\"source\": 685796, \"target\": 677964}, {\"source\": 685796, \"target\": 746573}, {\"source\": 413063, \"target\": 5811}, {\"source\": 413063, \"target\": 12759}, {\"source\": 413063, \"target\": 235630}, {\"source\": 677961, \"target\": 5811}, {\"source\": 677961, \"target\": 12759}, {\"source\": 677961, \"target\": 235630}, {\"source\": 677961, \"target\": 677963}, {\"source\": 677961, \"target\": 677964}, {\"source\": 677961, \"target\": 746573}, {\"source\": 677963, \"target\": 5811}, {\"source\": 677963, \"target\": 12759}, {\"source\": 677963, \"target\": 235630}, {\"source\": 677963, \"target\": 677964}, {\"source\": 677963, \"target\": 746573}, {\"source\": 677964, \"target\": 5811}, {\"source\": 677964, \"target\": 12759}, {\"source\": 677964, \"target\": 235630}, {\"source\": 677964, \"target\": 746573}, {\"source\": 746573, \"target\": 235630}, {\"source\": 746573, \"target\": 12759}, {\"source\": 235630, \"target\": 5811}, {\"source\": 235630, \"target\": 12759}, {\"source\": 235630, \"target\": 28181}, {\"source\": 44333, \"target\": 5811}, {\"source\": 44333, \"target\": 12759}, {\"source\": 5811, \"target\": 12759}, {\"source\": 5811, \"target\": 28181}, {\"source\": 5811, \"target\": 670228}, {\"source\": 670228, \"target\": 12759}, {\"source\": 28181, \"target\": 12759}]}",
"id": 1986,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hugo Silva, Foteini Agrafioti, Ikenna Odinaka, Adrian D. C. Chan, Alan D. Kaplan, Erik J. Sirevaag, John W. Rohrbaugh, Siddarth Hari, Dimitrios Hatzinakos, José Guerreiro, André Lourenço, Rui Ferreira, Anil K. Jain, Ana L. N. Fred\n- Research collaborations between these authors: Hugo Silva and André Lourenço, Hugo Silva and Ana L. N. Fred, Hugo Silva and Anil K. Jain, Hugo Silva and Dimitrios Hatzinakos, Hugo Silva and Adrian D. C. Chan, Hugo Silva and Foteini Agrafioti, Hugo Silva and Alan D. Kaplan, Hugo Silva and Erik J. Sirevaag, Hugo Silva and John W. Rohrbaugh, Hugo Silva and Ikenna Odinaka, Hugo Silva and José Guerreiro, Hugo Silva and Rui Ferreira, Hugo Silva and Siddarth Hari, Foteini Agrafioti and André Lourenço, Foteini Agrafioti and Ana L. N. Fred, Foteini Agrafioti and Dimitrios Hatzinakos, Foteini Agrafioti and Alan D. Kaplan, Foteini Agrafioti and Erik J. Sirevaag, Foteini Agrafioti and John W. Rohrbaugh, Foteini Agrafioti and Ikenna Odinaka, Foteini Agrafioti and Siddarth Hari, Ikenna Odinaka and André Lourenço, Ikenna Odinaka and Ana L. N. Fred, Ikenna Odinaka and Dimitrios Hatzinakos, Ikenna Odinaka and Alan D. Kaplan, Ikenna Odinaka and Erik J. Sirevaag, Ikenna Odinaka and John W. Rohrbaugh, Ikenna Odinaka and Siddarth Hari, Adrian D. C. Chan and André Lourenço, Adrian D. C. Chan and Ana L. N. Fred, Adrian D. C. Chan and Dimitrios Hatzinakos, Alan D. Kaplan and André Lourenço, Alan D. Kaplan and Ana L. N. Fred, Alan D. Kaplan and Dimitrios Hatzinakos, Alan D. Kaplan and Erik J. Sirevaag, Alan D. Kaplan and John W. Rohrbaugh, Alan D. Kaplan and Siddarth Hari, Erik J. Sirevaag and André Lourenço, Erik J. Sirevaag and Ana L. N. Fred, Erik J. Sirevaag and Dimitrios Hatzinakos, Erik J. Sirevaag and John W. Rohrbaugh, Erik J. Sirevaag and Siddarth Hari, John W. Rohrbaugh and André Lourenço, John W. Rohrbaugh and Ana L. N. Fred, John W. Rohrbaugh and Dimitrios Hatzinakos, John W. Rohrbaugh and Siddarth Hari, Siddarth Hari and Dimitrios Hatzinakos, Siddarth Hari and Ana L. N. Fred, Dimitrios Hatzinakos and André Lourenço, Dimitrios Hatzinakos and Ana L. N. Fred, Dimitrios Hatzinakos and Anil K. Jain, José Guerreiro and André Lourenço, José Guerreiro and Ana L. N. Fred, André Lourenço and Ana L. N. Fred, André Lourenço and Anil K. Jain, André Lourenço and Rui Ferreira, Rui Ferreira and Ana L. N. Fred, Anil K. Jain and Ana L. N. Fred.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: David Noftz, Stuart Marshall, Mali Senapathi, Kieran Conboy, Gerard Hartnett, Brian Fitzgerald, Minna Pikkarainen, Outi Salo, Rashina Hoda, James Noble, Didar Zowghi, Torgeir Dingsøyr, Abu Bakar Md Sultan, Pekka Abrahamsson\n- Research collaborations between these authors: David Noftz and Kieran Conboy, David Noftz and Minna Pikkarainen, Stuart Marshall and James Noble, Stuart Marshall and Abu Bakar Md Sultan, Stuart Marshall and Rashina Hoda, Stuart Marshall and Pekka Abrahamsson, Stuart Marshall and Torgeir Dingsøyr, Stuart Marshall and Minna Pikkarainen, Stuart Marshall and Outi Salo, Mali Senapathi and Pekka Abrahamsson, Mali Senapathi and Kieran Conboy, Mali Senapathi and Torgeir Dingsøyr, Mali Senapathi and Minna Pikkarainen, Kieran Conboy and James Noble, Kieran Conboy and Abu Bakar Md Sultan, Kieran Conboy and Pekka Abrahamsson, Kieran Conboy and Brian Fitzgerald, Kieran Conboy and Torgeir Dingsøyr, Kieran Conboy and Minna Pikkarainen, Kieran Conboy and Gerard Hartnett, Kieran Conboy and Rashina Hoda, Gerard Hartnett and James Noble, Gerard Hartnett and Brian Fitzgerald, Gerard Hartnett and Minna Pikkarainen, Brian Fitzgerald and James Noble, Brian Fitzgerald and Pekka Abrahamsson, Brian Fitzgerald and Rashina Hoda, Brian Fitzgerald and Torgeir Dingsøyr, Brian Fitzgerald and Minna Pikkarainen, Minna Pikkarainen and James Noble, Minna Pikkarainen and Abu Bakar Md Sultan, Minna Pikkarainen and Rashina Hoda, Minna Pikkarainen and Pekka Abrahamsson, Minna Pikkarainen and Didar Zowghi, Minna Pikkarainen and Torgeir Dingsøyr, Minna Pikkarainen and Outi Salo, Outi Salo and James Noble, Outi Salo and Abu Bakar Md Sultan, Outi Salo and Pekka Abrahamsson, Outi Salo and Rashina Hoda, Outi Salo and Torgeir Dingsøyr, Rashina Hoda and James Noble, Rashina Hoda and Abu Bakar Md Sultan, Rashina Hoda and Pekka Abrahamsson, Rashina Hoda and Torgeir Dingsøyr, James Noble and Pekka Abrahamsson, James Noble and Torgeir Dingsøyr, James Noble and Abu Bakar Md Sultan, Torgeir Dingsøyr and Pekka Abrahamsson, Abu Bakar Md Sultan and Pekka Abrahamsson.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"David Noftz\", \"id\": 852705}, {\"name\": \"Stuart Marshall\", \"id\": 152930}, {\"name\": \"Mali Senapathi\", \"id\": 110822}, {\"name\": \"Kieran Conboy\", \"id\": 39463}, {\"name\": \"Brian Fitzgerald\", \"id\": 25933}, {\"name\": \"Abu Bakar Md Sultan\", \"id\": 3132}, {\"name\": \"Minna Pikkarainen\", \"id\": 238864}, {\"name\": \"Outi Salo\", \"id\": 238865}, {\"name\": \"Rashina Hoda\", \"id\": 123728}, {\"name\": \"James Noble\", \"id\": 1907}, {\"name\": \"Didar Zowghi\", \"id\": 66960}, {\"name\": \"Torgeir Dings\\u00f8yr\", \"id\": 129783}, {\"name\": \"Gerard Hartnett\", \"id\": 438236}, {\"name\": \"Pekka Abrahamsson\", \"id\": 17759}], \"links\": [{\"source\": 852705, \"target\": 39463}, {\"source\": 852705, \"target\": 238864}, {\"source\": 152930, \"target\": 1907}, {\"source\": 152930, \"target\": 3132}, {\"source\": 152930, \"target\": 123728}, {\"source\": 152930, \"target\": 17759}, {\"source\": 152930, \"target\": 129783}, {\"source\": 152930, \"target\": 238864}, {\"source\": 152930, \"target\": 238865}, {\"source\": 110822, \"target\": 17759}, {\"source\": 110822, \"target\": 39463}, {\"source\": 110822, \"target\": 129783}, {\"source\": 110822, \"target\": 238864}, {\"source\": 39463, \"target\": 1907}, {\"source\": 39463, \"target\": 3132}, {\"source\": 39463, \"target\": 17759}, {\"source\": 39463, \"target\": 25933}, {\"source\": 39463, \"target\": 129783}, {\"source\": 39463, \"target\": 238864}, {\"source\": 39463, \"target\": 438236}, {\"source\": 39463, \"target\": 123728}, {\"source\": 25933, \"target\": 1907}, {\"source\": 25933, \"target\": 17759}, {\"source\": 25933, \"target\": 438236}, {\"source\": 25933, \"target\": 123728}, {\"source\": 25933, \"target\": 129783}, {\"source\": 25933, \"target\": 238864}, {\"source\": 3132, \"target\": 1907}, {\"source\": 3132, \"target\": 17759}, {\"source\": 3132, \"target\": 123728}, {\"source\": 3132, \"target\": 238864}, {\"source\": 3132, \"target\": 238865}, {\"source\": 238864, \"target\": 1907}, {\"source\": 238864, \"target\": 123728}, {\"source\": 238864, \"target\": 17759}, {\"source\": 238864, \"target\": 66960}, {\"source\": 238864, \"target\": 129783}, {\"source\": 238864, \"target\": 238865}, {\"source\": 238864, \"target\": 438236}, {\"source\": 238865, \"target\": 1907}, {\"source\": 238865, \"target\": 17759}, {\"source\": 238865, \"target\": 123728}, {\"source\": 238865, \"target\": 129783}, {\"source\": 123728, \"target\": 1907}, {\"source\": 123728, \"target\": 17759}, {\"source\": 123728, \"target\": 129783}, {\"source\": 1907, \"target\": 17759}, {\"source\": 1907, \"target\": 129783}, {\"source\": 1907, \"target\": 438236}, {\"source\": 129783, \"target\": 17759}]}",
"id": 2858,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: David Noftz, Stuart Marshall, Mali Senapathi, Kieran Conboy, Gerard Hartnett, Brian Fitzgerald, Minna Pikkarainen, Outi Salo, Rashina Hoda, James Noble, Didar Zowghi, Torgeir Dingsøyr, Abu Bakar Md Sultan, Pekka Abrahamsson\n- Research collaborations between these authors: David Noftz and Kieran Conboy, David Noftz and Minna Pikkarainen, Stuart Marshall and James Noble, Stuart Marshall and Abu Bakar Md Sultan, Stuart Marshall and Rashina Hoda, Stuart Marshall and Pekka Abrahamsson, Stuart Marshall and Torgeir Dingsøyr, Stuart Marshall and Minna Pikkarainen, Stuart Marshall and Outi Salo, Mali Senapathi and Pekka Abrahamsson, Mali Senapathi and Kieran Conboy, Mali Senapathi and Torgeir Dingsøyr, Mali Senapathi and Minna Pikkarainen, Kieran Conboy and James Noble, Kieran Conboy and Abu Bakar Md Sultan, Kieran Conboy and Pekka Abrahamsson, Kieran Conboy and Brian Fitzgerald, Kieran Conboy and Torgeir Dingsøyr, Kieran Conboy and Minna Pikkarainen, Kieran Conboy and Gerard Hartnett, Kieran Conboy and Rashina Hoda, Gerard Hartnett and James Noble, Gerard Hartnett and Brian Fitzgerald, Gerard Hartnett and Minna Pikkarainen, Brian Fitzgerald and James Noble, Brian Fitzgerald and Pekka Abrahamsson, Brian Fitzgerald and Rashina Hoda, Brian Fitzgerald and Torgeir Dingsøyr, Brian Fitzgerald and Minna Pikkarainen, Minna Pikkarainen and James Noble, Minna Pikkarainen and Abu Bakar Md Sultan, Minna Pikkarainen and Rashina Hoda, Minna Pikkarainen and Pekka Abrahamsson, Minna Pikkarainen and Didar Zowghi, Minna Pikkarainen and Torgeir Dingsøyr, Minna Pikkarainen and Outi Salo, Outi Salo and James Noble, Outi Salo and Abu Bakar Md Sultan, Outi Salo and Pekka Abrahamsson, Outi Salo and Rashina Hoda, Outi Salo and Torgeir Dingsøyr, Rashina Hoda and James Noble, Rashina Hoda and Abu Bakar Md Sultan, Rashina Hoda and Pekka Abrahamsson, Rashina Hoda and Torgeir Dingsøyr, James Noble and Pekka Abrahamsson, James Noble and Torgeir Dingsøyr, James Noble and Abu Bakar Md Sultan, Torgeir Dingsøyr and Pekka Abrahamsson, Abu Bakar Md Sultan and Pekka Abrahamsson.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Grzegorz Rozenberg, Nataša Jonoska, David M. Prescott, Stefan Hoops, Hendrik Jan Hoogeboom, Tero Harju, Sergiu Ivanov, Cristian Gratie, Gheorghe Păun, Ion Petre, Carlos Martín-Vide, Yurii Rogozhin, Robert Brijder, Miika Langille\n- Research collaborations between these authors: Grzegorz Rozenberg and Ion Petre, Grzegorz Rozenberg and Hendrik Jan Hoogeboom, Grzegorz Rozenberg and Robert Brijder, Grzegorz Rozenberg and Miika Langille, Grzegorz Rozenberg and Gheorghe Păun, Grzegorz Rozenberg and Tero Harju, Grzegorz Rozenberg and David M. Prescott, Grzegorz Rozenberg and Sergiu Ivanov, Grzegorz Rozenberg and Carlos Martín-Vide, Grzegorz Rozenberg and Nataša Jonoska, Nataša Jonoska and Ion Petre, Nataša Jonoska and Tero Harju, Nataša Jonoska and Hendrik Jan Hoogeboom, Nataša Jonoska and Robert Brijder, David M. Prescott and Ion Petre, David M. Prescott and Hendrik Jan Hoogeboom, David M. Prescott and Robert Brijder, David M. Prescott and Miika Langille, David M. Prescott and Tero Harju, Stefan Hoops and Ion Petre, Hendrik Jan Hoogeboom and Ion Petre, Hendrik Jan Hoogeboom and Yurii Rogozhin, Hendrik Jan Hoogeboom and Carlos Martín-Vide, Hendrik Jan Hoogeboom and Robert Brijder, Hendrik Jan Hoogeboom and Miika Langille, Hendrik Jan Hoogeboom and Gheorghe Păun, Hendrik Jan Hoogeboom and Tero Harju, Tero Harju and Ion Petre, Tero Harju and Robert Brijder, Tero Harju and Miika Langille, Sergiu Ivanov and Ion Petre, Sergiu Ivanov and Carlos Martín-Vide, Sergiu Ivanov and Yurii Rogozhin, Cristian Gratie and Ion Petre, Gheorghe Păun and Ion Petre, Gheorghe Păun and Carlos Martín-Vide, Gheorghe Păun and Yurii Rogozhin, Ion Petre and Carlos Martín-Vide, Ion Petre and Yurii Rogozhin, Ion Petre and Robert Brijder, Ion Petre and Miika Langille, Carlos Martín-Vide and Yurii Rogozhin, Robert Brijder and Miika Langille.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Grzegorz Rozenberg\", \"id\": 6048}, {\"name\": \"David M. Prescott\", \"id\": 300230}, {\"name\": \"Nata\\u0161a Jonoska\", \"id\": 41670}, {\"name\": \"Stefan Hoops\", \"id\": 572552}, {\"name\": \"Hendrik Jan Hoogeboom\", \"id\": 48811}, {\"name\": \"Tero Harju\", \"id\": 120139}, {\"name\": \"Sergiu Ivanov\", \"id\": 36077}, {\"name\": \"Gheorghe P\\u0103un\", \"id\": 87595}, {\"name\": \"Ion Petre\", \"id\": 6704}, {\"name\": \"Carlos Mart\\u00edn-Vide\", \"id\": 36913}, {\"name\": \"Yurii Rogozhin\", \"id\": 36914}, {\"name\": \"Robert Brijder\", \"id\": 58009}, {\"name\": \"Cristian Gratie\", \"id\": 47609}, {\"name\": \"Miika Langille\", \"id\": 58010}], \"links\": [{\"source\": 6048, \"target\": 6704}, {\"source\": 6048, \"target\": 48811}, {\"source\": 6048, \"target\": 58009}, {\"source\": 6048, \"target\": 58010}, {\"source\": 6048, \"target\": 87595}, {\"source\": 6048, \"target\": 120139}, {\"source\": 6048, \"target\": 300230}, {\"source\": 6048, \"target\": 36077}, {\"source\": 6048, \"target\": 36913}, {\"source\": 6048, \"target\": 41670}, {\"source\": 300230, \"target\": 6704}, {\"source\": 300230, \"target\": 48811}, {\"source\": 300230, \"target\": 58009}, {\"source\": 300230, \"target\": 58010}, {\"source\": 300230, \"target\": 120139}, {\"source\": 41670, \"target\": 6704}, {\"source\": 41670, \"target\": 120139}, {\"source\": 41670, \"target\": 48811}, {\"source\": 41670, \"target\": 58009}, {\"source\": 572552, \"target\": 6704}, {\"source\": 48811, \"target\": 6704}, {\"source\": 48811, \"target\": 36914}, {\"source\": 48811, \"target\": 36913}, {\"source\": 48811, \"target\": 58009}, {\"source\": 48811, \"target\": 58010}, {\"source\": 48811, \"target\": 87595}, {\"source\": 48811, \"target\": 120139}, {\"source\": 120139, \"target\": 6704}, {\"source\": 120139, \"target\": 58009}, {\"source\": 120139, \"target\": 58010}, {\"source\": 36077, \"target\": 6704}, {\"source\": 36077, \"target\": 36913}, {\"source\": 36077, \"target\": 36914}, {\"source\": 87595, \"target\": 6704}, {\"source\": 87595, \"target\": 36913}, {\"source\": 87595, \"target\": 36914}, {\"source\": 6704, \"target\": 36913}, {\"source\": 6704, \"target\": 36914}, {\"source\": 6704, \"target\": 58009}, {\"source\": 6704, \"target\": 58010}, {\"source\": 6704, \"target\": 47609}, {\"source\": 36913, \"target\": 36914}, {\"source\": 58009, \"target\": 58010}]}",
"id": 471,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Grzegorz Rozenberg, Nataša Jonoska, David M. Prescott, Stefan Hoops, Hendrik Jan Hoogeboom, Tero Harju, Sergiu Ivanov, Cristian Gratie, Gheorghe Păun, Ion Petre, Carlos Martín-Vide, Yurii Rogozhin, Robert Brijder, Miika Langille\n- Research collaborations between these authors: Grzegorz Rozenberg and Ion Petre, Grzegorz Rozenberg and Hendrik Jan Hoogeboom, Grzegorz Rozenberg and Robert Brijder, Grzegorz Rozenberg and Miika Langille, Grzegorz Rozenberg and Gheorghe Păun, Grzegorz Rozenberg and Tero Harju, Grzegorz Rozenberg and David M. Prescott, Grzegorz Rozenberg and Sergiu Ivanov, Grzegorz Rozenberg and Carlos Martín-Vide, Grzegorz Rozenberg and Nataša Jonoska, Nataša Jonoska and Ion Petre, Nataša Jonoska and Tero Harju, Nataša Jonoska and Hendrik Jan Hoogeboom, Nataša Jonoska and Robert Brijder, David M. Prescott and Ion Petre, David M. Prescott and Hendrik Jan Hoogeboom, David M. Prescott and Robert Brijder, David M. Prescott and Miika Langille, David M. Prescott and Tero Harju, Stefan Hoops and Ion Petre, Hendrik Jan Hoogeboom and Ion Petre, Hendrik Jan Hoogeboom and Yurii Rogozhin, Hendrik Jan Hoogeboom and Carlos Martín-Vide, Hendrik Jan Hoogeboom and Robert Brijder, Hendrik Jan Hoogeboom and Miika Langille, Hendrik Jan Hoogeboom and Gheorghe Păun, Hendrik Jan Hoogeboom and Tero Harju, Tero Harju and Ion Petre, Tero Harju and Robert Brijder, Tero Harju and Miika Langille, Sergiu Ivanov and Ion Petre, Sergiu Ivanov and Carlos Martín-Vide, Sergiu Ivanov and Yurii Rogozhin, Cristian Gratie and Ion Petre, Gheorghe Păun and Ion Petre, Gheorghe Păun and Carlos Martín-Vide, Gheorghe Păun and Yurii Rogozhin, Ion Petre and Carlos Martín-Vide, Ion Petre and Yurii Rogozhin, Ion Petre and Robert Brijder, Ion Petre and Miika Langille, Carlos Martín-Vide and Yurii Rogozhin, Robert Brijder and Miika Langille.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Chandra R. Murthy, Pablo Piantanida, Abdellatif Zaidi, H.V. Poor, Ghosheh Abed Hodtani, Mohammad Osmani-Bojd, Gerhard Kramer, Giuseppe Caire, Syed Ali Jafar, Lalitha Sankar, Narayan B. Mandayam, Shlomo Shamai, Luc Vandendorpe, David Gesbert\n- Research collaborations between these authors: Chandra R. Murthy and Shlomo Shamai, Chandra R. Murthy and Syed Ali Jafar, Chandra R. Murthy and Giuseppe Caire, Chandra R. Murthy and H.V. Poor, Chandra R. Murthy and Abdellatif Zaidi, Chandra R. Murthy and Gerhard Kramer, Chandra R. Murthy and Luc Vandendorpe, Chandra R. Murthy and David Gesbert, Pablo Piantanida and Shlomo Shamai, Pablo Piantanida and Syed Ali Jafar, Pablo Piantanida and Giuseppe Caire, Pablo Piantanida and H.V. Poor, Pablo Piantanida and Abdellatif Zaidi, Pablo Piantanida and Gerhard Kramer, Pablo Piantanida and Luc Vandendorpe, Pablo Piantanida and David Gesbert, Abdellatif Zaidi and Shlomo Shamai, Abdellatif Zaidi and Syed Ali Jafar, Abdellatif Zaidi and Giuseppe Caire, Abdellatif Zaidi and H.V. Poor, Abdellatif Zaidi and Lalitha Sankar, Abdellatif Zaidi and Gerhard Kramer, Abdellatif Zaidi and Luc Vandendorpe, Abdellatif Zaidi and Ghosheh Abed Hodtani, Abdellatif Zaidi and Mohammad Osmani-Bojd, H.V. Poor and Shlomo Shamai, H.V. Poor and Syed Ali Jafar, H.V. Poor and Giuseppe Caire, H.V. Poor and Narayan B. Mandayam, H.V. Poor and Lalitha Sankar, H.V. Poor and Gerhard Kramer, H.V. Poor and David Gesbert, H.V. Poor and Ghosheh Abed Hodtani, H.V. Poor and Luc Vandendorpe, Ghosheh Abed Hodtani and Shlomo Shamai, Ghosheh Abed Hodtani and Narayan B. Mandayam, Ghosheh Abed Hodtani and Lalitha Sankar, Ghosheh Abed Hodtani and Gerhard Kramer, Ghosheh Abed Hodtani and Luc Vandendorpe, Ghosheh Abed Hodtani and Mohammad Osmani-Bojd, Mohammad Osmani-Bojd and Shlomo Shamai, Mohammad Osmani-Bojd and Narayan B. Mandayam, Mohammad Osmani-Bojd and Lalitha Sankar, Mohammad Osmani-Bojd and Gerhard Kramer, Gerhard Kramer and Shlomo Shamai, Gerhard Kramer and Syed Ali Jafar, Gerhard Kramer and Giuseppe Caire, Gerhard Kramer and Narayan B. Mandayam, Gerhard Kramer and Lalitha Sankar, Gerhard Kramer and Luc Vandendorpe, Gerhard Kramer and David Gesbert, Giuseppe Caire and Shlomo Shamai, Giuseppe Caire and Syed Ali Jafar, Giuseppe Caire and Narayan B. Mandayam, Giuseppe Caire and Luc Vandendorpe, Giuseppe Caire and David Gesbert, Syed Ali Jafar and Shlomo Shamai, Syed Ali Jafar and Lalitha Sankar, Syed Ali Jafar and David Gesbert, Syed Ali Jafar and Luc Vandendorpe, Lalitha Sankar and Shlomo Shamai, Lalitha Sankar and Narayan B. Mandayam, Lalitha Sankar and Luc Vandendorpe, Narayan B. Mandayam and Shlomo Shamai, Narayan B. Mandayam and David Gesbert, Shlomo Shamai and Luc Vandendorpe, Shlomo Shamai and David Gesbert, Luc Vandendorpe and David Gesbert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 8,
"style": "rule"
}
|
{
"exact_answer": 8,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Chandra R. Murthy\", \"id\": 144640}, {\"name\": \"Pablo Piantanida\", \"id\": 168608}, {\"name\": \"Abdellatif Zaidi\", \"id\": 240322}, {\"name\": \"Shlomo Shamai\", \"id\": 111546}, {\"name\": \"H.V. Poor\", \"id\": 215676}, {\"name\": \"Ghosheh Abed Hodtani\", \"id\": 254566}, {\"name\": \"Mohammad Osmani-Bojd\", \"id\": 288455}, {\"name\": \"Gerhard Kramer\", \"id\": 262311}, {\"name\": \"Giuseppe Caire\", \"id\": 180553}, {\"name\": \"Syed Ali Jafar\", \"id\": 141778}, {\"name\": \"Lalitha Sankar\", \"id\": 241236}, {\"name\": \"Narayan B. Mandayam\", \"id\": 217754}, {\"name\": \"Luc Vandendorpe\", \"id\": 264732}, {\"name\": \"David Gesbert\", \"id\": 265469}], \"links\": [{\"source\": 144640, \"target\": 111546}, {\"source\": 144640, \"target\": 141778}, {\"source\": 144640, \"target\": 180553}, {\"source\": 144640, \"target\": 215676}, {\"source\": 144640, \"target\": 240322}, {\"source\": 144640, \"target\": 262311}, {\"source\": 144640, \"target\": 264732}, {\"source\": 144640, \"target\": 265469}, {\"source\": 168608, \"target\": 111546}, {\"source\": 168608, \"target\": 141778}, {\"source\": 168608, \"target\": 180553}, {\"source\": 168608, \"target\": 215676}, {\"source\": 168608, \"target\": 240322}, {\"source\": 168608, \"target\": 262311}, {\"source\": 168608, \"target\": 264732}, {\"source\": 168608, \"target\": 265469}, {\"source\": 240322, \"target\": 111546}, {\"source\": 240322, \"target\": 141778}, {\"source\": 240322, \"target\": 180553}, {\"source\": 240322, \"target\": 215676}, {\"source\": 240322, \"target\": 241236}, {\"source\": 240322, \"target\": 262311}, {\"source\": 240322, \"target\": 264732}, {\"source\": 240322, \"target\": 254566}, {\"source\": 240322, \"target\": 288455}, {\"source\": 111546, \"target\": 141778}, {\"source\": 111546, \"target\": 180553}, {\"source\": 111546, \"target\": 215676}, {\"source\": 111546, \"target\": 241236}, {\"source\": 111546, \"target\": 262311}, {\"source\": 111546, \"target\": 264732}, {\"source\": 111546, \"target\": 265469}, {\"source\": 111546, \"target\": 217754}, {\"source\": 111546, \"target\": 254566}, {\"source\": 111546, \"target\": 288455}, {\"source\": 215676, \"target\": 141778}, {\"source\": 215676, \"target\": 180553}, {\"source\": 215676, \"target\": 217754}, {\"source\": 215676, \"target\": 241236}, {\"source\": 215676, \"target\": 262311}, {\"source\": 215676, \"target\": 265469}, {\"source\": 215676, \"target\": 254566}, {\"source\": 215676, \"target\": 264732}, {\"source\": 254566, \"target\": 217754}, {\"source\": 254566, \"target\": 241236}, {\"source\": 254566, \"target\": 262311}, {\"source\": 254566, \"target\": 264732}, {\"source\": 254566, \"target\": 288455}, {\"source\": 288455, \"target\": 217754}, {\"source\": 288455, \"target\": 241236}, {\"source\": 288455, \"target\": 262311}, {\"source\": 262311, \"target\": 141778}, {\"source\": 262311, \"target\": 180553}, {\"source\": 262311, \"target\": 217754}, {\"source\": 262311, \"target\": 241236}, {\"source\": 262311, \"target\": 264732}, {\"source\": 262311, \"target\": 265469}, {\"source\": 180553, \"target\": 141778}, {\"source\": 180553, \"target\": 217754}, {\"source\": 180553, \"target\": 264732}, {\"source\": 180553, \"target\": 265469}, {\"source\": 141778, \"target\": 241236}, {\"source\": 141778, \"target\": 265469}, {\"source\": 141778, \"target\": 264732}, {\"source\": 241236, \"target\": 217754}, {\"source\": 241236, \"target\": 264732}, {\"source\": 217754, \"target\": 265469}, {\"source\": 264732, \"target\": 265469}]}",
"id": 1243,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Chandra R. Murthy, Pablo Piantanida, Abdellatif Zaidi, H.V. Poor, Ghosheh Abed Hodtani, Mohammad Osmani-Bojd, Gerhard Kramer, Giuseppe Caire, Syed Ali Jafar, Lalitha Sankar, Narayan B. Mandayam, Shlomo Shamai, Luc Vandendorpe, David Gesbert\n- Research collaborations between these authors: Chandra R. Murthy and Shlomo Shamai, Chandra R. Murthy and Syed Ali Jafar, Chandra R. Murthy and Giuseppe Caire, Chandra R. Murthy and H.V. Poor, Chandra R. Murthy and Abdellatif Zaidi, Chandra R. Murthy and Gerhard Kramer, Chandra R. Murthy and Luc Vandendorpe, Chandra R. Murthy and David Gesbert, Pablo Piantanida and Shlomo Shamai, Pablo Piantanida and Syed Ali Jafar, Pablo Piantanida and Giuseppe Caire, Pablo Piantanida and H.V. Poor, Pablo Piantanida and Abdellatif Zaidi, Pablo Piantanida and Gerhard Kramer, Pablo Piantanida and Luc Vandendorpe, Pablo Piantanida and David Gesbert, Abdellatif Zaidi and Shlomo Shamai, Abdellatif Zaidi and Syed Ali Jafar, Abdellatif Zaidi and Giuseppe Caire, Abdellatif Zaidi and H.V. Poor, Abdellatif Zaidi and Lalitha Sankar, Abdellatif Zaidi and Gerhard Kramer, Abdellatif Zaidi and Luc Vandendorpe, Abdellatif Zaidi and Ghosheh Abed Hodtani, Abdellatif Zaidi and Mohammad Osmani-Bojd, H.V. Poor and Shlomo Shamai, H.V. Poor and Syed Ali Jafar, H.V. Poor and Giuseppe Caire, H.V. Poor and Narayan B. Mandayam, H.V. Poor and Lalitha Sankar, H.V. Poor and Gerhard Kramer, H.V. Poor and David Gesbert, H.V. Poor and Ghosheh Abed Hodtani, H.V. Poor and Luc Vandendorpe, Ghosheh Abed Hodtani and Shlomo Shamai, Ghosheh Abed Hodtani and Narayan B. Mandayam, Ghosheh Abed Hodtani and Lalitha Sankar, Ghosheh Abed Hodtani and Gerhard Kramer, Ghosheh Abed Hodtani and Luc Vandendorpe, Ghosheh Abed Hodtani and Mohammad Osmani-Bojd, Mohammad Osmani-Bojd and Shlomo Shamai, Mohammad Osmani-Bojd and Narayan B. Mandayam, Mohammad Osmani-Bojd and Lalitha Sankar, Mohammad Osmani-Bojd and Gerhard Kramer, Gerhard Kramer and Shlomo Shamai, Gerhard Kramer and Syed Ali Jafar, Gerhard Kramer and Giuseppe Caire, Gerhard Kramer and Narayan B. Mandayam, Gerhard Kramer and Lalitha Sankar, Gerhard Kramer and Luc Vandendorpe, Gerhard Kramer and David Gesbert, Giuseppe Caire and Shlomo Shamai, Giuseppe Caire and Syed Ali Jafar, Giuseppe Caire and Narayan B. Mandayam, Giuseppe Caire and Luc Vandendorpe, Giuseppe Caire and David Gesbert, Syed Ali Jafar and Shlomo Shamai, Syed Ali Jafar and Lalitha Sankar, Syed Ali Jafar and David Gesbert, Syed Ali Jafar and Luc Vandendorpe, Lalitha Sankar and Shlomo Shamai, Lalitha Sankar and Narayan B. Mandayam, Lalitha Sankar and Luc Vandendorpe, Narayan B. Mandayam and Shlomo Shamai, Narayan B. Mandayam and David Gesbert, Shlomo Shamai and Luc Vandendorpe, Shlomo Shamai and David Gesbert, Luc Vandendorpe and David Gesbert.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hanqing Lu, Matthias Dantone, Xiaogang Wang, Tinne Tuytelaars, Luc J. Van Gool, Bryan James Prosser, Horst Bunke, Etienne E. Kerre, Pedro J. Burillo, Thomas S. Huang, Mark Marsden, Cheng Li, Chen Change Loy, Li Fei-Fei\n- Research collaborations between these authors: Hanqing Lu and Luc J. Van Gool, Hanqing Lu and Tinne Tuytelaars, Hanqing Lu and Li Fei-Fei, Hanqing Lu and Xiaogang Wang, Hanqing Lu and Chen Change Loy, Hanqing Lu and Thomas S. Huang, Matthias Dantone and Luc J. Van Gool, Matthias Dantone and Xiaogang Wang, Matthias Dantone and Chen Change Loy, Xiaogang Wang and Luc J. Van Gool, Xiaogang Wang and Cheng Li, Xiaogang Wang and Li Fei-Fei, Xiaogang Wang and Tinne Tuytelaars, Xiaogang Wang and Chen Change Loy, Xiaogang Wang and Thomas S. Huang, Xiaogang Wang and Bryan James Prosser, Xiaogang Wang and Mark Marsden, Tinne Tuytelaars and Luc J. Van Gool, Tinne Tuytelaars and Li Fei-Fei, Tinne Tuytelaars and Thomas S. Huang, Tinne Tuytelaars and Cheng Li, Luc J. Van Gool and Li Fei-Fei, Luc J. Van Gool and Chen Change Loy, Luc J. Van Gool and Thomas S. Huang, Luc J. Van Gool and Cheng Li, Bryan James Prosser and Chen Change Loy, Etienne E. Kerre and Cheng Li, Etienne E. Kerre and Pedro J. Burillo, Thomas S. Huang and Cheng Li, Thomas S. Huang and Li Fei-Fei, Thomas S. Huang and Chen Change Loy, Mark Marsden and Chen Change Loy, Cheng Li and Chen Change Loy, Chen Change Loy and Li Fei-Fei.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Hanqing Lu\", \"id\": 7746}, {\"name\": \"Matthias Dantone\", \"id\": 115843}, {\"name\": \"Xiaogang Wang\", \"id\": 20679}, {\"name\": \"Tinne Tuytelaars\", \"id\": 14857}, {\"name\": \"Luc J. Van Gool\", \"id\": 7179}, {\"name\": \"Horst Bunke\", \"id\": 11151}, {\"name\": \"Li Fei-Fei\", \"id\": 20604}, {\"name\": \"Etienne E. Kerre\", \"id\": 28497}, {\"name\": \"Pedro J. Burillo\", \"id\": 597909}, {\"name\": \"Thomas S. Huang\", \"id\": 56630}, {\"name\": \"Mark Marsden\", \"id\": 1256215}, {\"name\": \"Cheng Li\", \"id\": 17466}, {\"name\": \"Chen Change Loy\", \"id\": 23451}, {\"name\": \"Bryan James Prosser\", \"id\": 752124}], \"links\": [{\"source\": 7746, \"target\": 7179}, {\"source\": 7746, \"target\": 14857}, {\"source\": 7746, \"target\": 20604}, {\"source\": 7746, \"target\": 20679}, {\"source\": 7746, \"target\": 23451}, {\"source\": 7746, \"target\": 56630}, {\"source\": 115843, \"target\": 7179}, {\"source\": 115843, \"target\": 20679}, {\"source\": 115843, \"target\": 23451}, {\"source\": 20679, \"target\": 7179}, {\"source\": 20679, \"target\": 17466}, {\"source\": 20679, \"target\": 20604}, {\"source\": 20679, \"target\": 14857}, {\"source\": 20679, \"target\": 23451}, {\"source\": 20679, \"target\": 56630}, {\"source\": 20679, \"target\": 752124}, {\"source\": 20679, \"target\": 1256215}, {\"source\": 14857, \"target\": 7179}, {\"source\": 14857, \"target\": 20604}, {\"source\": 14857, \"target\": 56630}, {\"source\": 14857, \"target\": 17466}, {\"source\": 7179, \"target\": 20604}, {\"source\": 7179, \"target\": 23451}, {\"source\": 7179, \"target\": 56630}, {\"source\": 7179, \"target\": 17466}, {\"source\": 20604, \"target\": 23451}, {\"source\": 20604, \"target\": 56630}, {\"source\": 28497, \"target\": 17466}, {\"source\": 28497, \"target\": 597909}, {\"source\": 56630, \"target\": 17466}, {\"source\": 56630, \"target\": 23451}, {\"source\": 1256215, \"target\": 23451}, {\"source\": 17466, \"target\": 23451}, {\"source\": 23451, \"target\": 752124}]}",
"id": 2704,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Hanqing Lu, Matthias Dantone, Xiaogang Wang, Tinne Tuytelaars, Luc J. Van Gool, Bryan James Prosser, Horst Bunke, Etienne E. Kerre, Pedro J. Burillo, Thomas S. Huang, Mark Marsden, Cheng Li, Chen Change Loy, Li Fei-Fei\n- Research collaborations between these authors: Hanqing Lu and Luc J. Van Gool, Hanqing Lu and Tinne Tuytelaars, Hanqing Lu and Li Fei-Fei, Hanqing Lu and Xiaogang Wang, Hanqing Lu and Chen Change Loy, Hanqing Lu and Thomas S. Huang, Matthias Dantone and Luc J. Van Gool, Matthias Dantone and Xiaogang Wang, Matthias Dantone and Chen Change Loy, Xiaogang Wang and Luc J. Van Gool, Xiaogang Wang and Cheng Li, Xiaogang Wang and Li Fei-Fei, Xiaogang Wang and Tinne Tuytelaars, Xiaogang Wang and Chen Change Loy, Xiaogang Wang and Thomas S. Huang, Xiaogang Wang and Bryan James Prosser, Xiaogang Wang and Mark Marsden, Tinne Tuytelaars and Luc J. Van Gool, Tinne Tuytelaars and Li Fei-Fei, Tinne Tuytelaars and Thomas S. Huang, Tinne Tuytelaars and Cheng Li, Luc J. Van Gool and Li Fei-Fei, Luc J. Van Gool and Chen Change Loy, Luc J. Van Gool and Thomas S. Huang, Luc J. Van Gool and Cheng Li, Bryan James Prosser and Chen Change Loy, Etienne E. Kerre and Cheng Li, Etienne E. Kerre and Pedro J. Burillo, Thomas S. Huang and Cheng Li, Thomas S. Huang and Li Fei-Fei, Thomas S. Huang and Chen Change Loy, Mark Marsden and Chen Change Loy, Cheng Li and Chen Change Loy, Chen Change Loy and Li Fei-Fei.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Cordelia Schmid, Yann LeCun, Shalini Gupta, Xiaoou Tang, Danhang Tang, Toby Sharp, Richard Moore, Graham W. Taylor, Natalia Neverova, Florian Nebout, Camille Couprie, Alex Aben-Athar Kipman, Andrew Blake, Clement Farabet\n- Research collaborations between these authors: Cordelia Schmid and Andrew Blake, Cordelia Schmid and Yann LeCun, Cordelia Schmid and Xiaoou Tang, Cordelia Schmid and Graham W. Taylor, Cordelia Schmid and Natalia Neverova, Cordelia Schmid and Florian Nebout, Yann LeCun and Andrew Blake, Yann LeCun and Graham W. Taylor, Yann LeCun and Clement Farabet, Yann LeCun and Camille Couprie, Yann LeCun and Richard Moore, Yann LeCun and Toby Sharp, Yann LeCun and Alex Aben-Athar Kipman, Yann LeCun and Xiaoou Tang, Yann LeCun and Natalia Neverova, Yann LeCun and Florian Nebout, Shalini Gupta and Graham W. Taylor, Shalini Gupta and Natalia Neverova, Shalini Gupta and Florian Nebout, Xiaoou Tang and Andrew Blake, Xiaoou Tang and Graham W. Taylor, Xiaoou Tang and Clement Farabet, Xiaoou Tang and Camille Couprie, Xiaoou Tang and Richard Moore, Xiaoou Tang and Toby Sharp, Xiaoou Tang and Alex Aben-Athar Kipman, Xiaoou Tang and Natalia Neverova, Xiaoou Tang and Florian Nebout, Xiaoou Tang and Danhang Tang, Danhang Tang and Graham W. Taylor, Danhang Tang and Natalia Neverova, Danhang Tang and Florian Nebout, Danhang Tang and Andrew Blake, Danhang Tang and Richard Moore, Danhang Tang and Toby Sharp, Danhang Tang and Alex Aben-Athar Kipman, Toby Sharp and Andrew Blake, Toby Sharp and Graham W. Taylor, Toby Sharp and Natalia Neverova, Toby Sharp and Florian Nebout, Toby Sharp and Richard Moore, Toby Sharp and Alex Aben-Athar Kipman, Richard Moore and Graham W. Taylor, Richard Moore and Natalia Neverova, Richard Moore and Florian Nebout, Graham W. Taylor and Andrew Blake, Graham W. Taylor and Clement Farabet, Graham W. Taylor and Camille Couprie, Graham W. Taylor and Alex Aben-Athar Kipman, Graham W. Taylor and Natalia Neverova, Graham W. Taylor and Florian Nebout, Natalia Neverova and Andrew Blake, Natalia Neverova and Clement Farabet, Natalia Neverova and Camille Couprie, Natalia Neverova and Florian Nebout, Natalia Neverova and Alex Aben-Athar Kipman, Florian Nebout and Andrew Blake, Florian Nebout and Clement Farabet, Florian Nebout and Camille Couprie, Florian Nebout and Alex Aben-Athar Kipman, Camille Couprie and Clement Farabet, Camille Couprie and Andrew Blake.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Cordelia Schmid\", \"id\": 46147}, {\"name\": \"Shalini Gupta\", \"id\": 77797}, {\"name\": \"Yann LeCun\", \"id\": 14117}, {\"name\": \"Xiaoou Tang\", \"id\": 22379}, {\"name\": \"Danhang Tang\", \"id\": 204720}, {\"name\": \"Toby Sharp\", \"id\": 420754}, {\"name\": \"Graham W. Taylor\", \"id\": 96660}, {\"name\": \"Natalia Neverova\", \"id\": 193685}, {\"name\": \"Florian Nebout\", \"id\": 193686}, {\"name\": \"Camille Couprie\", \"id\": 118197}, {\"name\": \"Richard Moore\", \"id\": 298331}, {\"name\": \"Andrew Blake\", \"id\": 3517}, {\"name\": \"Alex Aben-Athar Kipman\", \"id\": 789211}, {\"name\": \"Clement Farabet\", \"id\": 101535}], \"links\": [{\"source\": 46147, \"target\": 3517}, {\"source\": 46147, \"target\": 14117}, {\"source\": 46147, \"target\": 22379}, {\"source\": 46147, \"target\": 96660}, {\"source\": 46147, \"target\": 193685}, {\"source\": 46147, \"target\": 193686}, {\"source\": 77797, \"target\": 96660}, {\"source\": 77797, \"target\": 193685}, {\"source\": 77797, \"target\": 193686}, {\"source\": 14117, \"target\": 3517}, {\"source\": 14117, \"target\": 96660}, {\"source\": 14117, \"target\": 101535}, {\"source\": 14117, \"target\": 118197}, {\"source\": 14117, \"target\": 298331}, {\"source\": 14117, \"target\": 420754}, {\"source\": 14117, \"target\": 789211}, {\"source\": 14117, \"target\": 22379}, {\"source\": 14117, \"target\": 193685}, {\"source\": 14117, \"target\": 193686}, {\"source\": 22379, \"target\": 3517}, {\"source\": 22379, \"target\": 96660}, {\"source\": 22379, \"target\": 101535}, {\"source\": 22379, \"target\": 118197}, {\"source\": 22379, \"target\": 298331}, {\"source\": 22379, \"target\": 420754}, {\"source\": 22379, \"target\": 789211}, {\"source\": 22379, \"target\": 193685}, {\"source\": 22379, \"target\": 193686}, {\"source\": 22379, \"target\": 204720}, {\"source\": 204720, \"target\": 96660}, {\"source\": 204720, \"target\": 193685}, {\"source\": 204720, \"target\": 193686}, {\"source\": 204720, \"target\": 3517}, {\"source\": 204720, \"target\": 298331}, {\"source\": 204720, \"target\": 420754}, {\"source\": 204720, \"target\": 789211}, {\"source\": 420754, \"target\": 3517}, {\"source\": 420754, \"target\": 96660}, {\"source\": 420754, \"target\": 193685}, {\"source\": 420754, \"target\": 193686}, {\"source\": 420754, \"target\": 298331}, {\"source\": 420754, \"target\": 789211}, {\"source\": 96660, \"target\": 3517}, {\"source\": 96660, \"target\": 101535}, {\"source\": 96660, \"target\": 118197}, {\"source\": 96660, \"target\": 298331}, {\"source\": 96660, \"target\": 789211}, {\"source\": 96660, \"target\": 193685}, {\"source\": 96660, \"target\": 193686}, {\"source\": 193685, \"target\": 3517}, {\"source\": 193685, \"target\": 101535}, {\"source\": 193685, \"target\": 118197}, {\"source\": 193685, \"target\": 193686}, {\"source\": 193685, \"target\": 298331}, {\"source\": 193685, \"target\": 789211}, {\"source\": 193686, \"target\": 3517}, {\"source\": 193686, \"target\": 101535}, {\"source\": 193686, \"target\": 118197}, {\"source\": 193686, \"target\": 298331}, {\"source\": 193686, \"target\": 789211}, {\"source\": 118197, \"target\": 101535}, {\"source\": 118197, \"target\": 3517}]}",
"id": 2280,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Cordelia Schmid, Yann LeCun, Shalini Gupta, Xiaoou Tang, Danhang Tang, Toby Sharp, Richard Moore, Graham W. Taylor, Natalia Neverova, Florian Nebout, Camille Couprie, Alex Aben-Athar Kipman, Andrew Blake, Clement Farabet\n- Research collaborations between these authors: Cordelia Schmid and Andrew Blake, Cordelia Schmid and Yann LeCun, Cordelia Schmid and Xiaoou Tang, Cordelia Schmid and Graham W. Taylor, Cordelia Schmid and Natalia Neverova, Cordelia Schmid and Florian Nebout, Yann LeCun and Andrew Blake, Yann LeCun and Graham W. Taylor, Yann LeCun and Clement Farabet, Yann LeCun and Camille Couprie, Yann LeCun and Richard Moore, Yann LeCun and Toby Sharp, Yann LeCun and Alex Aben-Athar Kipman, Yann LeCun and Xiaoou Tang, Yann LeCun and Natalia Neverova, Yann LeCun and Florian Nebout, Shalini Gupta and Graham W. Taylor, Shalini Gupta and Natalia Neverova, Shalini Gupta and Florian Nebout, Xiaoou Tang and Andrew Blake, Xiaoou Tang and Graham W. Taylor, Xiaoou Tang and Clement Farabet, Xiaoou Tang and Camille Couprie, Xiaoou Tang and Richard Moore, Xiaoou Tang and Toby Sharp, Xiaoou Tang and Alex Aben-Athar Kipman, Xiaoou Tang and Natalia Neverova, Xiaoou Tang and Florian Nebout, Xiaoou Tang and Danhang Tang, Danhang Tang and Graham W. Taylor, Danhang Tang and Natalia Neverova, Danhang Tang and Florian Nebout, Danhang Tang and Andrew Blake, Danhang Tang and Richard Moore, Danhang Tang and Toby Sharp, Danhang Tang and Alex Aben-Athar Kipman, Toby Sharp and Andrew Blake, Toby Sharp and Graham W. Taylor, Toby Sharp and Natalia Neverova, Toby Sharp and Florian Nebout, Toby Sharp and Richard Moore, Toby Sharp and Alex Aben-Athar Kipman, Richard Moore and Graham W. Taylor, Richard Moore and Natalia Neverova, Richard Moore and Florian Nebout, Graham W. Taylor and Andrew Blake, Graham W. Taylor and Clement Farabet, Graham W. Taylor and Camille Couprie, Graham W. Taylor and Alex Aben-Athar Kipman, Graham W. Taylor and Natalia Neverova, Graham W. Taylor and Florian Nebout, Natalia Neverova and Andrew Blake, Natalia Neverova and Clement Farabet, Natalia Neverova and Camille Couprie, Natalia Neverova and Florian Nebout, Natalia Neverova and Alex Aben-Athar Kipman, Florian Nebout and Andrew Blake, Florian Nebout and Clement Farabet, Florian Nebout and Camille Couprie, Florian Nebout and Alex Aben-Athar Kipman, Camille Couprie and Clement Farabet, Camille Couprie and Andrew Blake.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ludo Waltman, Pardeep Sud, Kayvan Kousha, David Wilkinson, Lutz Bornmann, Mike Thelwall, Judit Bar-Ilan, Emilio Delgado López-Cózar, Liwen Vaughan, José Luis Ortega, Isidro F. Aguillo, Gareth Harries, Enrique Orduña-Malea, Vincent Larivière\n- Research collaborations between these authors: Ludo Waltman and Mike Thelwall, Ludo Waltman and Lutz Bornmann, Ludo Waltman and Judit Bar-Ilan, Ludo Waltman and Vincent Larivière, Ludo Waltman and Kayvan Kousha, Pardeep Sud and Mike Thelwall, Pardeep Sud and Lutz Bornmann, Pardeep Sud and Isidro F. Aguillo, Pardeep Sud and Enrique Orduña-Malea, Pardeep Sud and Kayvan Kousha, Pardeep Sud and Emilio Delgado López-Cózar, Pardeep Sud and Liwen Vaughan, Pardeep Sud and Judit Bar-Ilan, Pardeep Sud and José Luis Ortega, Pardeep Sud and Vincent Larivière, Pardeep Sud and David Wilkinson, Pardeep Sud and Gareth Harries, Kayvan Kousha and Mike Thelwall, Kayvan Kousha and Lutz Bornmann, Kayvan Kousha and Judit Bar-Ilan, Kayvan Kousha and José Luis Ortega, Kayvan Kousha and Isidro F. Aguillo, Kayvan Kousha and Enrique Orduña-Malea, Kayvan Kousha and Vincent Larivière, Kayvan Kousha and Emilio Delgado López-Cózar, Kayvan Kousha and Liwen Vaughan, Kayvan Kousha and David Wilkinson, Kayvan Kousha and Gareth Harries, David Wilkinson and Mike Thelwall, David Wilkinson and Judit Bar-Ilan, David Wilkinson and José Luis Ortega, David Wilkinson and Isidro F. Aguillo, David Wilkinson and Enrique Orduña-Malea, David Wilkinson and Liwen Vaughan, David Wilkinson and Gareth Harries, Lutz Bornmann and Mike Thelwall, Lutz Bornmann and Judit Bar-Ilan, Lutz Bornmann and Vincent Larivière, Lutz Bornmann and Emilio Delgado López-Cózar, Lutz Bornmann and Enrique Orduña-Malea, Mike Thelwall and Judit Bar-Ilan, Mike Thelwall and José Luis Ortega, Mike Thelwall and Isidro F. Aguillo, Mike Thelwall and Enrique Orduña-Malea, Mike Thelwall and Vincent Larivière, Mike Thelwall and Emilio Delgado López-Cózar, Mike Thelwall and Liwen Vaughan, Mike Thelwall and Gareth Harries, Judit Bar-Ilan and José Luis Ortega, Judit Bar-Ilan and Isidro F. Aguillo, Judit Bar-Ilan and Emilio Delgado López-Cózar, Judit Bar-Ilan and Liwen Vaughan, Judit Bar-Ilan and Gareth Harries, Judit Bar-Ilan and Enrique Orduña-Malea, Judit Bar-Ilan and Vincent Larivière, Emilio Delgado López-Cózar and Enrique Orduña-Malea, Emilio Delgado López-Cózar and José Luis Ortega, Emilio Delgado López-Cózar and Isidro F. Aguillo, Emilio Delgado López-Cózar and Vincent Larivière, Emilio Delgado López-Cózar and Liwen Vaughan, Liwen Vaughan and José Luis Ortega, Liwen Vaughan and Isidro F. Aguillo, Liwen Vaughan and Enrique Orduña-Malea, Liwen Vaughan and Gareth Harries, José Luis Ortega and Isidro F. Aguillo, José Luis Ortega and Gareth Harries, José Luis Ortega and Enrique Orduña-Malea, Isidro F. Aguillo and Gareth Harries, Isidro F. Aguillo and Enrique Orduña-Malea, Gareth Harries and Enrique Orduña-Malea.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 10,
"style": "rule"
}
|
{
"exact_answer": 10,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Ludo Waltman\", \"id\": 192096}, {\"name\": \"Pardeep Sud\", \"id\": 408834}, {\"name\": \"Kayvan Kousha\", \"id\": 235144}, {\"name\": \"David Wilkinson\", \"id\": 401451}, {\"name\": \"Lutz Bornmann\", \"id\": 135372}, {\"name\": \"Mike Thelwall\", \"id\": 57357}, {\"name\": \"Judit Bar-Ilan\", \"id\": 162189}, {\"name\": \"Emilio Delgado L\\u00f3pez-C\\u00f3zar\", \"id\": 247372}, {\"name\": \"Liwen Vaughan\", \"id\": 277136}, {\"name\": \"Jos\\u00e9 Luis Ortega\", \"id\": 170128}, {\"name\": \"Isidro F. Aguillo\", \"id\": 170129}, {\"name\": \"Gareth Harries\", \"id\": 618772}, {\"name\": \"Enrique Ordu\\u00f1a-Malea\", \"id\": 188859}, {\"name\": \"Vincent Larivi\\u00e8re\", \"id\": 197662}], \"links\": [{\"source\": 192096, \"target\": 57357}, {\"source\": 192096, \"target\": 135372}, {\"source\": 192096, \"target\": 162189}, {\"source\": 192096, \"target\": 197662}, {\"source\": 192096, \"target\": 235144}, {\"source\": 408834, \"target\": 57357}, {\"source\": 408834, \"target\": 135372}, {\"source\": 408834, \"target\": 170129}, {\"source\": 408834, \"target\": 188859}, {\"source\": 408834, \"target\": 235144}, {\"source\": 408834, \"target\": 247372}, {\"source\": 408834, \"target\": 277136}, {\"source\": 408834, \"target\": 162189}, {\"source\": 408834, \"target\": 170128}, {\"source\": 408834, \"target\": 197662}, {\"source\": 408834, \"target\": 401451}, {\"source\": 408834, \"target\": 618772}, {\"source\": 235144, \"target\": 57357}, {\"source\": 235144, \"target\": 135372}, {\"source\": 235144, \"target\": 162189}, {\"source\": 235144, \"target\": 170128}, {\"source\": 235144, \"target\": 170129}, {\"source\": 235144, \"target\": 188859}, {\"source\": 235144, \"target\": 197662}, {\"source\": 235144, \"target\": 247372}, {\"source\": 235144, \"target\": 277136}, {\"source\": 235144, \"target\": 401451}, {\"source\": 235144, \"target\": 618772}, {\"source\": 401451, \"target\": 57357}, {\"source\": 401451, \"target\": 162189}, {\"source\": 401451, \"target\": 170128}, {\"source\": 401451, \"target\": 170129}, {\"source\": 401451, \"target\": 188859}, {\"source\": 401451, \"target\": 277136}, {\"source\": 401451, \"target\": 618772}, {\"source\": 135372, \"target\": 57357}, {\"source\": 135372, \"target\": 162189}, {\"source\": 135372, \"target\": 197662}, {\"source\": 135372, \"target\": 247372}, {\"source\": 135372, \"target\": 188859}, {\"source\": 57357, \"target\": 162189}, {\"source\": 57357, \"target\": 170128}, {\"source\": 57357, \"target\": 170129}, {\"source\": 57357, \"target\": 188859}, {\"source\": 57357, \"target\": 197662}, {\"source\": 57357, \"target\": 247372}, {\"source\": 57357, \"target\": 277136}, {\"source\": 57357, \"target\": 618772}, {\"source\": 162189, \"target\": 170128}, {\"source\": 162189, \"target\": 170129}, {\"source\": 162189, \"target\": 247372}, {\"source\": 162189, \"target\": 277136}, {\"source\": 162189, \"target\": 618772}, {\"source\": 162189, \"target\": 188859}, {\"source\": 162189, \"target\": 197662}, {\"source\": 247372, \"target\": 188859}, {\"source\": 247372, \"target\": 170128}, {\"source\": 247372, \"target\": 170129}, {\"source\": 247372, \"target\": 197662}, {\"source\": 247372, \"target\": 277136}, {\"source\": 277136, \"target\": 170128}, {\"source\": 277136, \"target\": 170129}, {\"source\": 277136, \"target\": 188859}, {\"source\": 277136, \"target\": 618772}, {\"source\": 170128, \"target\": 170129}, {\"source\": 170128, \"target\": 618772}, {\"source\": 170128, \"target\": 188859}, {\"source\": 170129, \"target\": 618772}, {\"source\": 170129, \"target\": 188859}, {\"source\": 618772, \"target\": 188859}]}",
"id": 448,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Ludo Waltman, Pardeep Sud, Kayvan Kousha, David Wilkinson, Lutz Bornmann, Mike Thelwall, Judit Bar-Ilan, Emilio Delgado López-Cózar, Liwen Vaughan, José Luis Ortega, Isidro F. Aguillo, Gareth Harries, Enrique Orduña-Malea, Vincent Larivière\n- Research collaborations between these authors: Ludo Waltman and Mike Thelwall, Ludo Waltman and Lutz Bornmann, Ludo Waltman and Judit Bar-Ilan, Ludo Waltman and Vincent Larivière, Ludo Waltman and Kayvan Kousha, Pardeep Sud and Mike Thelwall, Pardeep Sud and Lutz Bornmann, Pardeep Sud and Isidro F. Aguillo, Pardeep Sud and Enrique Orduña-Malea, Pardeep Sud and Kayvan Kousha, Pardeep Sud and Emilio Delgado López-Cózar, Pardeep Sud and Liwen Vaughan, Pardeep Sud and Judit Bar-Ilan, Pardeep Sud and José Luis Ortega, Pardeep Sud and Vincent Larivière, Pardeep Sud and David Wilkinson, Pardeep Sud and Gareth Harries, Kayvan Kousha and Mike Thelwall, Kayvan Kousha and Lutz Bornmann, Kayvan Kousha and Judit Bar-Ilan, Kayvan Kousha and José Luis Ortega, Kayvan Kousha and Isidro F. Aguillo, Kayvan Kousha and Enrique Orduña-Malea, Kayvan Kousha and Vincent Larivière, Kayvan Kousha and Emilio Delgado López-Cózar, Kayvan Kousha and Liwen Vaughan, Kayvan Kousha and David Wilkinson, Kayvan Kousha and Gareth Harries, David Wilkinson and Mike Thelwall, David Wilkinson and Judit Bar-Ilan, David Wilkinson and José Luis Ortega, David Wilkinson and Isidro F. Aguillo, David Wilkinson and Enrique Orduña-Malea, David Wilkinson and Liwen Vaughan, David Wilkinson and Gareth Harries, Lutz Bornmann and Mike Thelwall, Lutz Bornmann and Judit Bar-Ilan, Lutz Bornmann and Vincent Larivière, Lutz Bornmann and Emilio Delgado López-Cózar, Lutz Bornmann and Enrique Orduña-Malea, Mike Thelwall and Judit Bar-Ilan, Mike Thelwall and José Luis Ortega, Mike Thelwall and Isidro F. Aguillo, Mike Thelwall and Enrique Orduña-Malea, Mike Thelwall and Vincent Larivière, Mike Thelwall and Emilio Delgado López-Cózar, Mike Thelwall and Liwen Vaughan, Mike Thelwall and Gareth Harries, Judit Bar-Ilan and José Luis Ortega, Judit Bar-Ilan and Isidro F. Aguillo, Judit Bar-Ilan and Emilio Delgado López-Cózar, Judit Bar-Ilan and Liwen Vaughan, Judit Bar-Ilan and Gareth Harries, Judit Bar-Ilan and Enrique Orduña-Malea, Judit Bar-Ilan and Vincent Larivière, Emilio Delgado López-Cózar and Enrique Orduña-Malea, Emilio Delgado López-Cózar and José Luis Ortega, Emilio Delgado López-Cózar and Isidro F. Aguillo, Emilio Delgado López-Cózar and Vincent Larivière, Emilio Delgado López-Cózar and Liwen Vaughan, Liwen Vaughan and José Luis Ortega, Liwen Vaughan and Isidro F. Aguillo, Liwen Vaughan and Enrique Orduña-Malea, Liwen Vaughan and Gareth Harries, José Luis Ortega and Isidro F. Aguillo, José Luis Ortega and Gareth Harries, José Luis Ortega and Enrique Orduña-Malea, Isidro F. Aguillo and Gareth Harries, Isidro F. Aguillo and Enrique Orduña-Malea, Gareth Harries and Enrique Orduña-Malea.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Christopher Kruegel, Efstathios Stamatatos, Nathan E. Rosenblum, Arvind Narayanan, Sebastian Thrun, Rinus Plasmeijer, Jean-Pierre Hubaux, James B. D. Joshi, Dan Cosley, Prateek Mittal, Benjamin C. Pierce, Jessica Su, Steven Englehardt, Stefano Traverso\n- Research collaborations between these authors: Christopher Kruegel and Arvind Narayanan, Christopher Kruegel and Steven Englehardt, Efstathios Stamatatos and Arvind Narayanan, Nathan E. Rosenblum and Arvind Narayanan, Arvind Narayanan and Jean-Pierre Hubaux, Arvind Narayanan and Benjamin C. Pierce, Arvind Narayanan and James B. D. Joshi, Arvind Narayanan and Dan Cosley, Arvind Narayanan and Steven Englehardt, Arvind Narayanan and Prateek Mittal, Arvind Narayanan and Stefano Traverso, Arvind Narayanan and Jessica Su, Rinus Plasmeijer and Benjamin C. Pierce, Steven Englehardt and Stefano Traverso.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Christopher Kruegel\", \"id\": 13921}, {\"name\": \"Efstathios Stamatatos\", \"id\": 59842}, {\"name\": \"Nathan E. Rosenblum\", \"id\": 63363}, {\"name\": \"Arvind Narayanan\", \"id\": 164868}, {\"name\": \"Sebastian Thrun\", \"id\": 54500}, {\"name\": \"Rinus Plasmeijer\", \"id\": 170819}, {\"name\": \"Jean-Pierre Hubaux\", \"id\": 10695}, {\"name\": \"James B. D. Joshi\", \"id\": 99433}, {\"name\": \"Dan Cosley\", \"id\": 77516}, {\"name\": \"Prateek Mittal\", \"id\": 215346}, {\"name\": \"Benjamin C. Pierce\", \"id\": 20886}, {\"name\": \"Jessica Su\", \"id\": 1232792}, {\"name\": \"Steven Englehardt\", \"id\": 528666}, {\"name\": \"Stefano Traverso\", \"id\": 237720}], \"links\": [{\"source\": 13921, \"target\": 164868}, {\"source\": 13921, \"target\": 528666}, {\"source\": 59842, \"target\": 164868}, {\"source\": 63363, \"target\": 164868}, {\"source\": 164868, \"target\": 10695}, {\"source\": 164868, \"target\": 20886}, {\"source\": 164868, \"target\": 99433}, {\"source\": 164868, \"target\": 77516}, {\"source\": 164868, \"target\": 528666}, {\"source\": 164868, \"target\": 215346}, {\"source\": 164868, \"target\": 237720}, {\"source\": 164868, \"target\": 1232792}, {\"source\": 170819, \"target\": 20886}, {\"source\": 528666, \"target\": 237720}]}",
"id": 1303,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Christopher Kruegel, Efstathios Stamatatos, Nathan E. Rosenblum, Arvind Narayanan, Sebastian Thrun, Rinus Plasmeijer, Jean-Pierre Hubaux, James B. D. Joshi, Dan Cosley, Prateek Mittal, Benjamin C. Pierce, Jessica Su, Steven Englehardt, Stefano Traverso\n- Research collaborations between these authors: Christopher Kruegel and Arvind Narayanan, Christopher Kruegel and Steven Englehardt, Efstathios Stamatatos and Arvind Narayanan, Nathan E. Rosenblum and Arvind Narayanan, Arvind Narayanan and Jean-Pierre Hubaux, Arvind Narayanan and Benjamin C. Pierce, Arvind Narayanan and James B. D. Joshi, Arvind Narayanan and Dan Cosley, Arvind Narayanan and Steven Englehardt, Arvind Narayanan and Prateek Mittal, Arvind Narayanan and Stefano Traverso, Arvind Narayanan and Jessica Su, Rinus Plasmeijer and Benjamin C. Pierce, Steven Englehardt and Stefano Traverso.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wolfgang Kellerer, Ross B. Girshick, Yang Peng, Xin Xin, Marielle Christiansen, Eckehard G. Steinbach, Wen Gao, Christian Lottermann, Damien Schroeder, Zhan Ma, Thomas Wiegand, Ali C. Begen, Yao Wang, Yi Shi\n- Research collaborations between these authors: Wolfgang Kellerer and Eckehard G. Steinbach, Wolfgang Kellerer and Thomas Wiegand, Wolfgang Kellerer and Damien Schroeder, Ross B. Girshick and Wen Gao, Ross B. Girshick and Eckehard G. Steinbach, Yang Peng and Eckehard G. Steinbach, Yang Peng and Yi Shi, Yang Peng and Christian Lottermann, Yang Peng and Damien Schroeder, Xin Xin and Wen Gao, Xin Xin and Zhan Ma, Eckehard G. Steinbach and Wen Gao, Eckehard G. Steinbach and Yao Wang, Eckehard G. Steinbach and Zhan Ma, Eckehard G. Steinbach and Thomas Wiegand, Eckehard G. Steinbach and Christian Lottermann, Eckehard G. Steinbach and Damien Schroeder, Eckehard G. Steinbach and Ali C. Begen, Wen Gao and Yao Wang, Wen Gao and Zhan Ma, Wen Gao and Thomas Wiegand, Christian Lottermann and Yao Wang, Christian Lottermann and Zhan Ma, Christian Lottermann and Damien Schroeder, Damien Schroeder and Yao Wang, Damien Schroeder and Zhan Ma, Damien Schroeder and Thomas Wiegand, Damien Schroeder and Ali C. Begen, Zhan Ma and Yao Wang, Zhan Ma and Thomas Wiegand, Thomas Wiegand and Yao Wang, Ali C. Begen and Yao Wang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Wolfgang Kellerer\", \"id\": 25570}, {\"name\": \"Ross B. Girshick\", \"id\": 63749}, {\"name\": \"Xin Xin\", \"id\": 65574}, {\"name\": \"Yang Peng\", \"id\": 118054}, {\"name\": \"Marielle Christiansen\", \"id\": 612517}, {\"name\": \"Eckehard G. Steinbach\", \"id\": 72493}, {\"name\": \"Wen Gao\", \"id\": 13902}, {\"name\": \"Christian Lottermann\", \"id\": 263279}, {\"name\": \"Damien Schroeder\", \"id\": 263281}, {\"name\": \"Zhan Ma\", \"id\": 122898}, {\"name\": \"Thomas Wiegand\", \"id\": 233458}, {\"name\": \"Ali C. Begen\", \"id\": 376788}, {\"name\": \"Yao Wang\", \"id\": 47421}, {\"name\": \"Yi Shi\", \"id\": 28767}], \"links\": [{\"source\": 25570, \"target\": 72493}, {\"source\": 25570, \"target\": 233458}, {\"source\": 25570, \"target\": 263281}, {\"source\": 63749, \"target\": 13902}, {\"source\": 63749, \"target\": 72493}, {\"source\": 65574, \"target\": 13902}, {\"source\": 65574, \"target\": 122898}, {\"source\": 118054, \"target\": 72493}, {\"source\": 118054, \"target\": 28767}, {\"source\": 118054, \"target\": 263279}, {\"source\": 118054, \"target\": 263281}, {\"source\": 72493, \"target\": 13902}, {\"source\": 72493, \"target\": 47421}, {\"source\": 72493, \"target\": 122898}, {\"source\": 72493, \"target\": 233458}, {\"source\": 72493, \"target\": 263279}, {\"source\": 72493, \"target\": 263281}, {\"source\": 72493, \"target\": 376788}, {\"source\": 13902, \"target\": 47421}, {\"source\": 13902, \"target\": 122898}, {\"source\": 13902, \"target\": 233458}, {\"source\": 263279, \"target\": 47421}, {\"source\": 263279, \"target\": 122898}, {\"source\": 263279, \"target\": 263281}, {\"source\": 263281, \"target\": 47421}, {\"source\": 263281, \"target\": 122898}, {\"source\": 263281, \"target\": 233458}, {\"source\": 263281, \"target\": 376788}, {\"source\": 122898, \"target\": 47421}, {\"source\": 122898, \"target\": 233458}, {\"source\": 233458, \"target\": 47421}, {\"source\": 376788, \"target\": 47421}]}",
"id": 389,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Wolfgang Kellerer, Ross B. Girshick, Yang Peng, Xin Xin, Marielle Christiansen, Eckehard G. Steinbach, Wen Gao, Christian Lottermann, Damien Schroeder, Zhan Ma, Thomas Wiegand, Ali C. Begen, Yao Wang, Yi Shi\n- Research collaborations between these authors: Wolfgang Kellerer and Eckehard G. Steinbach, Wolfgang Kellerer and Thomas Wiegand, Wolfgang Kellerer and Damien Schroeder, Ross B. Girshick and Wen Gao, Ross B. Girshick and Eckehard G. Steinbach, Yang Peng and Eckehard G. Steinbach, Yang Peng and Yi Shi, Yang Peng and Christian Lottermann, Yang Peng and Damien Schroeder, Xin Xin and Wen Gao, Xin Xin and Zhan Ma, Eckehard G. Steinbach and Wen Gao, Eckehard G. Steinbach and Yao Wang, Eckehard G. Steinbach and Zhan Ma, Eckehard G. Steinbach and Thomas Wiegand, Eckehard G. Steinbach and Christian Lottermann, Eckehard G. Steinbach and Damien Schroeder, Eckehard G. Steinbach and Ali C. Begen, Wen Gao and Yao Wang, Wen Gao and Zhan Ma, Wen Gao and Thomas Wiegand, Christian Lottermann and Yao Wang, Christian Lottermann and Zhan Ma, Christian Lottermann and Damien Schroeder, Damien Schroeder and Yao Wang, Damien Schroeder and Zhan Ma, Damien Schroeder and Thomas Wiegand, Damien Schroeder and Ali C. Begen, Zhan Ma and Yao Wang, Zhan Ma and Thomas Wiegand, Thomas Wiegand and Yao Wang, Ali C. Begen and Yao Wang.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Andreas Stefik, Jaime Urquiza-Fuentes, Christopher D. Hundhausen, Jonathan Lee Brown, Stefan Hanenberg, Guido Rößling, Luis Felipe Herrera-Quintero, Ed Gellenbeck, Sarah A. Douglas, J. Ángel Velázquez-Iturbide, Martin C. Carlisle, Wanda Dann, Mordechai Ben-Ari, Brad A. Myers\n- Research collaborations between these authors: Andreas Stefik and Stefan Hanenberg, Andreas Stefik and Brad A. Myers, Andreas Stefik and Christopher D. Hundhausen, Andreas Stefik and Jonathan Lee Brown, Andreas Stefik and Ed Gellenbeck, Jaime Urquiza-Fuentes and Guido Rößling, Jaime Urquiza-Fuentes and J. Ángel Velázquez-Iturbide, Jaime Urquiza-Fuentes and Mordechai Ben-Ari, Jaime Urquiza-Fuentes and Christopher D. Hundhausen, Jaime Urquiza-Fuentes and Jonathan Lee Brown, Jaime Urquiza-Fuentes and Sarah A. Douglas, Jaime Urquiza-Fuentes and Wanda Dann, Christopher D. Hundhausen and Guido Rößling, Christopher D. Hundhausen and Mordechai Ben-Ari, Christopher D. Hundhausen and J. Ángel Velázquez-Iturbide, Christopher D. Hundhausen and Martin C. Carlisle, Christopher D. Hundhausen and Brad A. Myers, Christopher D. Hundhausen and Jonathan Lee Brown, Christopher D. Hundhausen and Sarah A. Douglas, Christopher D. Hundhausen and Wanda Dann, Jonathan Lee Brown and J. Ángel Velázquez-Iturbide, Jonathan Lee Brown and Guido Rößling, Jonathan Lee Brown and Mordechai Ben-Ari, Jonathan Lee Brown and Martin C. Carlisle, Jonathan Lee Brown and Brad A. Myers, Jonathan Lee Brown and Sarah A. Douglas, Jonathan Lee Brown and Wanda Dann, Jonathan Lee Brown and Ed Gellenbeck, Stefan Hanenberg and Brad A. Myers, Guido Rößling and Mordechai Ben-Ari, Guido Rößling and J. Ángel Velázquez-Iturbide, Guido Rößling and Sarah A. Douglas, Guido Rößling and Wanda Dann, Sarah A. Douglas and Mordechai Ben-Ari, Sarah A. Douglas and J. Ángel Velázquez-Iturbide, J. Ángel Velázquez-Iturbide and Mordechai Ben-Ari, J. Ángel Velázquez-Iturbide and Wanda Dann, Wanda Dann and Mordechai Ben-Ari.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Andreas Stefik\", \"id\": 162240}, {\"name\": \"Jaime Urquiza-Fuentes\", \"id\": 125093}, {\"name\": \"Christopher D. Hundhausen\", \"id\": 304359}, {\"name\": \"Jonathan Lee Brown\", \"id\": 304360}, {\"name\": \"Stefan Hanenberg\", \"id\": 105133}, {\"name\": \"Guido R\\u00f6\\u00dfling\", \"id\": 34800}, {\"name\": \"Luis Felipe Herrera-Quintero\", \"id\": 619793}, {\"name\": \"Ed Gellenbeck\", \"id\": 690002}, {\"name\": \"Sarah A. Douglas\", \"id\": 394484}, {\"name\": \"J. \\u00c1ngel Vel\\u00e1zquez-Iturbide\", \"id\": 86037}, {\"name\": \"Martin C. Carlisle\", \"id\": 82390}, {\"name\": \"Wanda Dann\", \"id\": 491608}, {\"name\": \"Mordechai Ben-Ari\", \"id\": 79195}, {\"name\": \"Brad A. Myers\", \"id\": 153085}], \"links\": [{\"source\": 162240, \"target\": 105133}, {\"source\": 162240, \"target\": 153085}, {\"source\": 162240, \"target\": 304359}, {\"source\": 162240, \"target\": 304360}, {\"source\": 162240, \"target\": 690002}, {\"source\": 125093, \"target\": 34800}, {\"source\": 125093, \"target\": 86037}, {\"source\": 125093, \"target\": 79195}, {\"source\": 125093, \"target\": 304359}, {\"source\": 125093, \"target\": 304360}, {\"source\": 125093, \"target\": 394484}, {\"source\": 125093, \"target\": 491608}, {\"source\": 304359, \"target\": 34800}, {\"source\": 304359, \"target\": 79195}, {\"source\": 304359, \"target\": 86037}, {\"source\": 304359, \"target\": 82390}, {\"source\": 304359, \"target\": 153085}, {\"source\": 304359, \"target\": 304360}, {\"source\": 304359, \"target\": 394484}, {\"source\": 304359, \"target\": 491608}, {\"source\": 304360, \"target\": 86037}, {\"source\": 304360, \"target\": 34800}, {\"source\": 304360, \"target\": 79195}, {\"source\": 304360, \"target\": 82390}, {\"source\": 304360, \"target\": 153085}, {\"source\": 304360, \"target\": 394484}, {\"source\": 304360, \"target\": 491608}, {\"source\": 304360, \"target\": 690002}, {\"source\": 105133, \"target\": 153085}, {\"source\": 34800, \"target\": 79195}, {\"source\": 34800, \"target\": 86037}, {\"source\": 34800, \"target\": 394484}, {\"source\": 34800, \"target\": 491608}, {\"source\": 394484, \"target\": 79195}, {\"source\": 394484, \"target\": 86037}, {\"source\": 86037, \"target\": 79195}, {\"source\": 86037, \"target\": 491608}, {\"source\": 491608, \"target\": 79195}]}",
"id": 2457,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Andreas Stefik, Jaime Urquiza-Fuentes, Christopher D. Hundhausen, Jonathan Lee Brown, Stefan Hanenberg, Guido Rößling, Luis Felipe Herrera-Quintero, Ed Gellenbeck, Sarah A. Douglas, J. Ángel Velázquez-Iturbide, Martin C. Carlisle, Wanda Dann, Mordechai Ben-Ari, Brad A. Myers\n- Research collaborations between these authors: Andreas Stefik and Stefan Hanenberg, Andreas Stefik and Brad A. Myers, Andreas Stefik and Christopher D. Hundhausen, Andreas Stefik and Jonathan Lee Brown, Andreas Stefik and Ed Gellenbeck, Jaime Urquiza-Fuentes and Guido Rößling, Jaime Urquiza-Fuentes and J. Ángel Velázquez-Iturbide, Jaime Urquiza-Fuentes and Mordechai Ben-Ari, Jaime Urquiza-Fuentes and Christopher D. Hundhausen, Jaime Urquiza-Fuentes and Jonathan Lee Brown, Jaime Urquiza-Fuentes and Sarah A. Douglas, Jaime Urquiza-Fuentes and Wanda Dann, Christopher D. Hundhausen and Guido Rößling, Christopher D. Hundhausen and Mordechai Ben-Ari, Christopher D. Hundhausen and J. Ángel Velázquez-Iturbide, Christopher D. Hundhausen and Martin C. Carlisle, Christopher D. Hundhausen and Brad A. Myers, Christopher D. Hundhausen and Jonathan Lee Brown, Christopher D. Hundhausen and Sarah A. Douglas, Christopher D. Hundhausen and Wanda Dann, Jonathan Lee Brown and J. Ángel Velázquez-Iturbide, Jonathan Lee Brown and Guido Rößling, Jonathan Lee Brown and Mordechai Ben-Ari, Jonathan Lee Brown and Martin C. Carlisle, Jonathan Lee Brown and Brad A. Myers, Jonathan Lee Brown and Sarah A. Douglas, Jonathan Lee Brown and Wanda Dann, Jonathan Lee Brown and Ed Gellenbeck, Stefan Hanenberg and Brad A. Myers, Guido Rößling and Mordechai Ben-Ari, Guido Rößling and J. Ángel Velázquez-Iturbide, Guido Rößling and Sarah A. Douglas, Guido Rößling and Wanda Dann, Sarah A. Douglas and Mordechai Ben-Ari, Sarah A. Douglas and J. Ángel Velázquez-Iturbide, J. Ángel Velázquez-Iturbide and Mordechai Ben-Ari, J. Ángel Velázquez-Iturbide and Wanda Dann, Wanda Dann and Mordechai Ben-Ari.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Zheng Wang, Prateek Jain, Sham M. Kakade, Rong Ge, Sushant Sachdeva, Elchanan Mossel, Animashree Anandkumar, Eric P. Xing, David Sontag, Vincent Y. F. Tan, Daniel J. Hsu, H.V. Poor, Koray Kavukcuoglu, Anna C. Gilbert\n- Research collaborations between these authors: Prateek Jain and Sham M. Kakade, Prateek Jain and Rong Ge, Prateek Jain and Eric P. Xing, Prateek Jain and Daniel J. Hsu, Prateek Jain and Anna C. Gilbert, Prateek Jain and Animashree Anandkumar, Sham M. Kakade and Eric P. Xing, Sham M. Kakade and Rong Ge, Sham M. Kakade and Elchanan Mossel, Sham M. Kakade and Daniel J. Hsu, Sham M. Kakade and Vincent Y. F. Tan, Sham M. Kakade and Animashree Anandkumar, Sham M. Kakade and Sushant Sachdeva, Sham M. Kakade and David Sontag, Rong Ge and Daniel J. Hsu, Rong Ge and David Sontag, Rong Ge and Animashree Anandkumar, Rong Ge and Sushant Sachdeva, Sushant Sachdeva and Daniel J. Hsu, Sushant Sachdeva and Animashree Anandkumar, Elchanan Mossel and Animashree Anandkumar, Elchanan Mossel and Daniel J. Hsu, Elchanan Mossel and David Sontag, Animashree Anandkumar and Eric P. Xing, Animashree Anandkumar and Daniel J. Hsu, Animashree Anandkumar and David Sontag, Animashree Anandkumar and Vincent Y. F. Tan, Animashree Anandkumar and Anna C. Gilbert, Animashree Anandkumar and H.V. Poor, Eric P. Xing and Koray Kavukcuoglu, Eric P. Xing and Daniel J. Hsu, Eric P. Xing and David Sontag, Eric P. Xing and H.V. Poor, David Sontag and Daniel J. Hsu, Vincent Y. F. Tan and Daniel J. Hsu, Vincent Y. F. Tan and H.V. Poor.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Zheng Wang\", \"id\": 74595}, {\"name\": \"Prateek Jain\", \"id\": 80645}, {\"name\": \"Sham M. Kakade\", \"id\": 7559}, {\"name\": \"Rong Ge\", \"id\": 78542}, {\"name\": \"Sushant Sachdeva\", \"id\": 224911}, {\"name\": \"Elchanan Mossel\", \"id\": 92144}, {\"name\": \"Animashree Anandkumar\", \"id\": 188721}, {\"name\": \"Eric P. Xing\", \"id\": 4111}, {\"name\": \"Vincent Y. F. Tan\", \"id\": 175636}, {\"name\": \"Daniel J. Hsu\", \"id\": 109974}, {\"name\": \"Anna C. Gilbert\", \"id\": 181151}, {\"name\": \"H.V. Poor\", \"id\": 215676}, {\"name\": \"Koray Kavukcuoglu\", \"id\": 101534}, {\"name\": \"David Sontag\", \"id\": 120479}], \"links\": [{\"source\": 80645, \"target\": 7559}, {\"source\": 80645, \"target\": 78542}, {\"source\": 80645, \"target\": 4111}, {\"source\": 80645, \"target\": 109974}, {\"source\": 80645, \"target\": 181151}, {\"source\": 80645, \"target\": 188721}, {\"source\": 7559, \"target\": 4111}, {\"source\": 7559, \"target\": 78542}, {\"source\": 7559, \"target\": 92144}, {\"source\": 7559, \"target\": 109974}, {\"source\": 7559, \"target\": 175636}, {\"source\": 7559, \"target\": 188721}, {\"source\": 7559, \"target\": 224911}, {\"source\": 7559, \"target\": 120479}, {\"source\": 78542, \"target\": 109974}, {\"source\": 78542, \"target\": 120479}, {\"source\": 78542, \"target\": 188721}, {\"source\": 78542, \"target\": 224911}, {\"source\": 224911, \"target\": 109974}, {\"source\": 224911, \"target\": 188721}, {\"source\": 92144, \"target\": 188721}, {\"source\": 92144, \"target\": 109974}, {\"source\": 92144, \"target\": 120479}, {\"source\": 188721, \"target\": 4111}, {\"source\": 188721, \"target\": 109974}, {\"source\": 188721, \"target\": 120479}, {\"source\": 188721, \"target\": 175636}, {\"source\": 188721, \"target\": 181151}, {\"source\": 188721, \"target\": 215676}, {\"source\": 4111, \"target\": 101534}, {\"source\": 4111, \"target\": 109974}, {\"source\": 4111, \"target\": 120479}, {\"source\": 4111, \"target\": 215676}, {\"source\": 175636, \"target\": 109974}, {\"source\": 175636, \"target\": 215676}, {\"source\": 109974, \"target\": 120479}]}",
"id": 513,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Zheng Wang, Prateek Jain, Sham M. Kakade, Rong Ge, Sushant Sachdeva, Elchanan Mossel, Animashree Anandkumar, Eric P. Xing, David Sontag, Vincent Y. F. Tan, Daniel J. Hsu, H.V. Poor, Koray Kavukcuoglu, Anna C. Gilbert\n- Research collaborations between these authors: Prateek Jain and Sham M. Kakade, Prateek Jain and Rong Ge, Prateek Jain and Eric P. Xing, Prateek Jain and Daniel J. Hsu, Prateek Jain and Anna C. Gilbert, Prateek Jain and Animashree Anandkumar, Sham M. Kakade and Eric P. Xing, Sham M. Kakade and Rong Ge, Sham M. Kakade and Elchanan Mossel, Sham M. Kakade and Daniel J. Hsu, Sham M. Kakade and Vincent Y. F. Tan, Sham M. Kakade and Animashree Anandkumar, Sham M. Kakade and Sushant Sachdeva, Sham M. Kakade and David Sontag, Rong Ge and Daniel J. Hsu, Rong Ge and David Sontag, Rong Ge and Animashree Anandkumar, Rong Ge and Sushant Sachdeva, Sushant Sachdeva and Daniel J. Hsu, Sushant Sachdeva and Animashree Anandkumar, Elchanan Mossel and Animashree Anandkumar, Elchanan Mossel and Daniel J. Hsu, Elchanan Mossel and David Sontag, Animashree Anandkumar and Eric P. Xing, Animashree Anandkumar and Daniel J. Hsu, Animashree Anandkumar and David Sontag, Animashree Anandkumar and Vincent Y. F. Tan, Animashree Anandkumar and Anna C. Gilbert, Animashree Anandkumar and H.V. Poor, Eric P. Xing and Koray Kavukcuoglu, Eric P. Xing and Daniel J. Hsu, Eric P. Xing and David Sontag, Eric P. Xing and H.V. Poor, David Sontag and Daniel J. Hsu, Vincent Y. F. Tan and Daniel J. Hsu, Vincent Y. F. Tan and H.V. Poor.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: S. Sitharama Iyengar, Elliot Anshelevich, Brian W. Rogers, Deborah Estrin, Tim Hellmann, Mathias Staudigl, Esteban Arcaute, Matthew O. Jackson, Mats Bengtsson, Christophe Bravard, Francis Bloch, Sudipta Sarangi, Haris Aziz, Hans Haller\n- Research collaborations between these authors: S. Sitharama Iyengar and Deborah Estrin, S. Sitharama Iyengar and Sudipta Sarangi, Elliot Anshelevich and Matthew O. Jackson, Elliot Anshelevich and Francis Bloch, Brian W. Rogers and Matthew O. Jackson, Deborah Estrin and Sudipta Sarangi, Tim Hellmann and Matthew O. Jackson, Tim Hellmann and Francis Bloch, Mathias Staudigl and Matthew O. Jackson, Esteban Arcaute and Matthew O. Jackson, Matthew O. Jackson and Haris Aziz, Matthew O. Jackson and Mats Bengtsson, Matthew O. Jackson and Sudipta Sarangi, Matthew O. Jackson and Francis Bloch, Christophe Bravard and Sudipta Sarangi, Francis Bloch and Sudipta Sarangi, Sudipta Sarangi and Hans Haller.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 3,
"style": "rule"
}
|
{
"exact_answer": 3,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"S. Sitharama Iyengar\", \"id\": 35360}, {\"name\": \"Elliot Anshelevich\", \"id\": 97793}, {\"name\": \"Brian W. Rogers\", \"id\": 210243}, {\"name\": \"Deborah Estrin\", \"id\": 52260}, {\"name\": \"Tim Hellmann\", \"id\": 756549}, {\"name\": \"Mathias Staudigl\", \"id\": 519628}, {\"name\": \"Esteban Arcaute\", \"id\": 336560}, {\"name\": \"Matthew O. Jackson\", \"id\": 421714}, {\"name\": \"Mats Bengtsson\", \"id\": 167826}, {\"name\": \"Christophe Bravard\", \"id\": 498228}, {\"name\": \"Francis Bloch\", \"id\": 606261}, {\"name\": \"Sudipta Sarangi\", \"id\": 498229}, {\"name\": \"Haris Aziz\", \"id\": 36151}, {\"name\": \"Hans Haller\", \"id\": 524411}], \"links\": [{\"source\": 35360, \"target\": 52260}, {\"source\": 35360, \"target\": 498229}, {\"source\": 97793, \"target\": 421714}, {\"source\": 97793, \"target\": 606261}, {\"source\": 210243, \"target\": 421714}, {\"source\": 52260, \"target\": 498229}, {\"source\": 756549, \"target\": 421714}, {\"source\": 756549, \"target\": 606261}, {\"source\": 519628, \"target\": 421714}, {\"source\": 336560, \"target\": 421714}, {\"source\": 421714, \"target\": 36151}, {\"source\": 421714, \"target\": 167826}, {\"source\": 421714, \"target\": 498229}, {\"source\": 421714, \"target\": 606261}, {\"source\": 498228, \"target\": 498229}, {\"source\": 606261, \"target\": 498229}, {\"source\": 498229, \"target\": 524411}]}",
"id": 1388,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: S. Sitharama Iyengar, Elliot Anshelevich, Brian W. Rogers, Deborah Estrin, Tim Hellmann, Mathias Staudigl, Esteban Arcaute, Matthew O. Jackson, Mats Bengtsson, Christophe Bravard, Francis Bloch, Sudipta Sarangi, Haris Aziz, Hans Haller\n- Research collaborations between these authors: S. Sitharama Iyengar and Deborah Estrin, S. Sitharama Iyengar and Sudipta Sarangi, Elliot Anshelevich and Matthew O. Jackson, Elliot Anshelevich and Francis Bloch, Brian W. Rogers and Matthew O. Jackson, Deborah Estrin and Sudipta Sarangi, Tim Hellmann and Matthew O. Jackson, Tim Hellmann and Francis Bloch, Mathias Staudigl and Matthew O. Jackson, Esteban Arcaute and Matthew O. Jackson, Matthew O. Jackson and Haris Aziz, Matthew O. Jackson and Mats Bengtsson, Matthew O. Jackson and Sudipta Sarangi, Matthew O. Jackson and Francis Bloch, Christophe Bravard and Sudipta Sarangi, Francis Bloch and Sudipta Sarangi, Sudipta Sarangi and Hans Haller.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
MCP
|
[
{
"content": "You are a helpful assistant. The assistant first thinks about the reasoning process in the mind and then provides the user with the answer. The reasoning process and answer must be formatted exactly as follows:\n<think>\n[your reasoning process here]\n</think>\n<answer>\n[your answer here]\n</answer>\nYou can choose to imitate the reasoning process of relevant algorithms or explore an appropriate solution on your own. DO NOT use code, and remember to focus on the logical flow.",
"role": "system"
},
{
"content": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Stéphane Cotin, M. Eduard Gröller, Simon K. Warfield, George Drettakis, Bernhard Preim, Long Zhang, Tian He, Pere-Pau Vázquez, Henry Völzke, Jana Hintze, Stefan Bruckner, Thomas Ertl, Jixiang Guo, Milan Sonka\n- Research collaborations between these authors: Stéphane Cotin and Bernhard Preim, Stéphane Cotin and Simon K. Warfield, M. Eduard Gröller and Bernhard Preim, M. Eduard Gröller and Stefan Bruckner, M. Eduard Gröller and Thomas Ertl, Simon K. Warfield and Bernhard Preim, Simon K. Warfield and Milan Sonka, Bernhard Preim and Long Zhang, Bernhard Preim and Thomas Ertl, Bernhard Preim and Henry Völzke, Bernhard Preim and Pere-Pau Vázquez, Bernhard Preim and Stefan Bruckner, Bernhard Preim and Jana Hintze, Bernhard Preim and Jixiang Guo, Pere-Pau Vázquez and Thomas Ertl, Pere-Pau Vázquez and Stefan Bruckner, Stefan Bruckner and Thomas Ertl.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"role": "user"
}
] |
{
"ground_truth": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"St\\u00e9phane Cotin\", \"id\": 20672}, {\"name\": \"M. Eduard Gr\\u00f6ller\", \"id\": 244770}, {\"name\": \"George Drettakis\", \"id\": 107684}, {\"name\": \"Simon K. Warfield\", \"id\": 32516}, {\"name\": \"Bernhard Preim\", \"id\": 2759}, {\"name\": \"Long Zhang\", \"id\": 1161}, {\"name\": \"Tian He\", \"id\": 299596}, {\"name\": \"Pere-Pau V\\u00e1zquez\", \"id\": 98129}, {\"name\": \"Henry V\\u00f6lzke\", \"id\": 24434}, {\"name\": \"Jana Hintze\", \"id\": 164311}, {\"name\": \"Stefan Bruckner\", \"id\": 127354}, {\"name\": \"Thomas Ertl\", \"id\": 6363}, {\"name\": \"Jixiang Guo\", \"id\": 731964}, {\"name\": \"Milan Sonka\", \"id\": 35998}], \"links\": [{\"source\": 20672, \"target\": 2759}, {\"source\": 20672, \"target\": 32516}, {\"source\": 244770, \"target\": 2759}, {\"source\": 244770, \"target\": 127354}, {\"source\": 244770, \"target\": 6363}, {\"source\": 32516, \"target\": 2759}, {\"source\": 32516, \"target\": 35998}, {\"source\": 2759, \"target\": 1161}, {\"source\": 2759, \"target\": 6363}, {\"source\": 2759, \"target\": 24434}, {\"source\": 2759, \"target\": 98129}, {\"source\": 2759, \"target\": 127354}, {\"source\": 2759, \"target\": 164311}, {\"source\": 2759, \"target\": 731964}, {\"source\": 98129, \"target\": 6363}, {\"source\": 98129, \"target\": 127354}, {\"source\": 127354, \"target\": 6363}]}",
"id": 1547,
"problem_text": "You are required to solve the Maximum Clique Problem for an undirected academic network. In this network, nodes represent authors and edges represent research collaborations. Your objective is to find the largest subset of nodes such that every pair of vertices in this subset is connected by an edge.\n\n**Problem to Solve**\n\n- Authors in the network: Stéphane Cotin, M. Eduard Gröller, Simon K. Warfield, George Drettakis, Bernhard Preim, Long Zhang, Tian He, Pere-Pau Vázquez, Henry Völzke, Jana Hintze, Stefan Bruckner, Thomas Ertl, Jixiang Guo, Milan Sonka\n- Research collaborations between these authors: Stéphane Cotin and Bernhard Preim, Stéphane Cotin and Simon K. Warfield, M. Eduard Gröller and Bernhard Preim, M. Eduard Gröller and Stefan Bruckner, M. Eduard Gröller and Thomas Ertl, Simon K. Warfield and Bernhard Preim, Simon K. Warfield and Milan Sonka, Bernhard Preim and Long Zhang, Bernhard Preim and Thomas Ertl, Bernhard Preim and Henry Völzke, Bernhard Preim and Pere-Pau Vázquez, Bernhard Preim and Stefan Bruckner, Bernhard Preim and Jana Hintze, Bernhard Preim and Jixiang Guo, Pere-Pau Vázquez and Thomas Ertl, Pere-Pau Vázquez and Stefan Bruckner, Stefan Bruckner and Thomas Ertl.\nIdentify the clique with the maximum number of authors in this network. Present your answer in the following format: [AuthorA, AuthorB, AuthorC, AuthorD, ...].",
"split": "train"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.