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: Yoichi Morales, Michita Imai, Batya Friedman, Norihiro Hagita, Dylan F. Glas, Henry Y. K. Lau, Andreas Bley, Dirk Wollherr, Masahiro Shiomi, Hiroshi Ishiguro, St. Mueller, Jisang Sun, Michael Lewis, Takayuki Kanda\n- Research collaborations between these authors: Yoichi Morales and Norihiro Hagita, Yoichi Morales and Takayuki Kanda, Yoichi Morales and Michita Imai, Yoichi Morales and Hiroshi Ishiguro, Yoichi Morales and Andreas Bley, Yoichi Morales and Masahiro Shiomi, Yoichi Morales and Dylan F. Glas, Yoichi Morales and St. Mueller, Michita Imai and Norihiro Hagita, Michita Imai and Hiroshi Ishiguro, Michita Imai and Takayuki Kanda, Michita Imai and Andreas Bley, Michita Imai and Masahiro Shiomi, Michita Imai and Dylan F. Glas, Michita Imai and St. Mueller, Michita Imai and Dirk Wollherr, Batya Friedman and Norihiro Hagita, Batya Friedman and Hiroshi Ishiguro, Batya Friedman and Takayuki Kanda, Batya Friedman and Masahiro Shiomi, Norihiro Hagita and Dirk Wollherr, Norihiro Hagita and Hiroshi Ishiguro, Norihiro Hagita and Takayuki Kanda, Norihiro Hagita and Michael Lewis, Norihiro Hagita and Andreas Bley, Norihiro Hagita and Masahiro Shiomi, Norihiro Hagita and Dylan F. Glas, Norihiro Hagita and St. Mueller, Norihiro Hagita and Jisang Sun, Dylan F. Glas and Dirk Wollherr, Dylan F. Glas and Hiroshi Ishiguro, Dylan F. Glas and Takayuki Kanda, Dylan F. Glas and Masahiro Shiomi, Dylan F. Glas and Michael Lewis, Dylan F. Glas and Andreas Bley, Dylan F. Glas and St. Mueller, Dylan F. Glas and Jisang Sun, Andreas Bley and Dirk Wollherr, Andreas Bley and Hiroshi Ishiguro, Andreas Bley and Takayuki Kanda, Andreas Bley and Masahiro Shiomi, Andreas Bley and St. Mueller, Dirk Wollherr and Hiroshi Ishiguro, Dirk Wollherr and Takayuki Kanda, Dirk Wollherr and Masahiro Shiomi, Dirk Wollherr and St. Mueller, Masahiro Shiomi and Hiroshi Ishiguro, Masahiro Shiomi and Takayuki Kanda, Masahiro Shiomi and St. Mueller, Hiroshi Ishiguro and Takayuki Kanda, Hiroshi Ishiguro and Michael Lewis, Hiroshi Ishiguro and St. Mueller, Hiroshi Ishiguro and Jisang Sun, St. Mueller and Takayuki Kanda, Jisang Sun and Takayuki Kanda, Michael Lewis and Takayuki Kanda.\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\": \"Yoichi Morales\", \"id\": 270276}, {\"name\": \"Michita Imai\", \"id\": 1224}, {\"name\": \"Batya Friedman\", \"id\": 25416}, {\"name\": \"Andreas Bley\", \"id\": 76876}, {\"name\": \"Dylan F. Glas\", \"id\": 182445}, {\"name\": \"Henry Y. K. Lau\", \"id\": 20508}, {\"name\": \"Dirk Wollherr\", \"id\": 12432}, {\"name\": \"Jisang Sun\", \"id\": 888316}, {\"name\": \"Masahiro Shiomi\", \"id\": 163091}, {\"name\": \"Hiroshi Ishiguro\", \"id\": 26521}, {\"name\": \"St. Mueller\", \"id\": 284955}, {\"name\": \"Norihiro Hagita\", \"id\": 13308}, {\"name\": \"Michael Lewis\", \"id\": 67006}, {\"name\": \"Takayuki Kanda\", \"id\": 30047}], \"links\": [{\"source\": 270276, \"target\": 13308}, {\"source\": 270276, \"target\": 30047}, {\"source\": 270276, \"target\": 1224}, {\"source\": 270276, \"target\": 26521}, {\"source\": 270276, \"target\": 76876}, {\"source\": 270276, \"target\": 163091}, {\"source\": 270276, \"target\": 182445}, {\"source\": 270276, \"target\": 284955}, {\"source\": 1224, \"target\": 13308}, {\"source\": 1224, \"target\": 26521}, {\"source\": 1224, \"target\": 30047}, {\"source\": 1224, \"target\": 76876}, {\"source\": 1224, \"target\": 163091}, {\"source\": 1224, \"target\": 182445}, {\"source\": 1224, \"target\": 284955}, {\"source\": 1224, \"target\": 12432}, {\"source\": 25416, \"target\": 13308}, {\"source\": 25416, \"target\": 26521}, {\"source\": 25416, \"target\": 30047}, {\"source\": 25416, \"target\": 163091}, {\"source\": 76876, \"target\": 12432}, {\"source\": 76876, \"target\": 13308}, {\"source\": 76876, \"target\": 26521}, {\"source\": 76876, \"target\": 30047}, {\"source\": 76876, \"target\": 163091}, {\"source\": 76876, \"target\": 284955}, {\"source\": 76876, \"target\": 182445}, {\"source\": 182445, \"target\": 12432}, {\"source\": 182445, \"target\": 13308}, {\"source\": 182445, \"target\": 26521}, {\"source\": 182445, \"target\": 30047}, {\"source\": 182445, \"target\": 163091}, {\"source\": 182445, \"target\": 67006}, {\"source\": 182445, \"target\": 284955}, {\"source\": 182445, \"target\": 888316}, {\"source\": 12432, \"target\": 13308}, {\"source\": 12432, \"target\": 26521}, {\"source\": 12432, \"target\": 30047}, {\"source\": 12432, \"target\": 163091}, {\"source\": 12432, \"target\": 284955}, {\"source\": 888316, \"target\": 13308}, {\"source\": 888316, \"target\": 26521}, {\"source\": 888316, \"target\": 30047}, {\"source\": 163091, \"target\": 13308}, {\"source\": 163091, \"target\": 26521}, {\"source\": 163091, \"target\": 30047}, {\"source\": 163091, \"target\": 284955}, {\"source\": 26521, \"target\": 13308}, {\"source\": 26521, \"target\": 30047}, {\"source\": 26521, \"target\": 67006}, {\"source\": 26521, \"target\": 284955}, {\"source\": 284955, \"target\": 13308}, {\"source\": 284955, \"target\": 30047}, {\"source\": 13308, \"target\": 30047}, {\"source\": 13308, \"target\": 67006}, {\"source\": 67006, \"target\": 30047}]}",
"id": 2810,
"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: Yoichi Morales, Michita Imai, Batya Friedman, Norihiro Hagita, Dylan F. Glas, Henry Y. K. Lau, Andreas Bley, Dirk Wollherr, Masahiro Shiomi, Hiroshi Ishiguro, St. Mueller, Jisang Sun, Michael Lewis, Takayuki Kanda\n- Research collaborations between these authors: Yoichi Morales and Norihiro Hagita, Yoichi Morales and Takayuki Kanda, Yoichi Morales and Michita Imai, Yoichi Morales and Hiroshi Ishiguro, Yoichi Morales and Andreas Bley, Yoichi Morales and Masahiro Shiomi, Yoichi Morales and Dylan F. Glas, Yoichi Morales and St. Mueller, Michita Imai and Norihiro Hagita, Michita Imai and Hiroshi Ishiguro, Michita Imai and Takayuki Kanda, Michita Imai and Andreas Bley, Michita Imai and Masahiro Shiomi, Michita Imai and Dylan F. Glas, Michita Imai and St. Mueller, Michita Imai and Dirk Wollherr, Batya Friedman and Norihiro Hagita, Batya Friedman and Hiroshi Ishiguro, Batya Friedman and Takayuki Kanda, Batya Friedman and Masahiro Shiomi, Norihiro Hagita and Dirk Wollherr, Norihiro Hagita and Hiroshi Ishiguro, Norihiro Hagita and Takayuki Kanda, Norihiro Hagita and Michael Lewis, Norihiro Hagita and Andreas Bley, Norihiro Hagita and Masahiro Shiomi, Norihiro Hagita and Dylan F. Glas, Norihiro Hagita and St. Mueller, Norihiro Hagita and Jisang Sun, Dylan F. Glas and Dirk Wollherr, Dylan F. Glas and Hiroshi Ishiguro, Dylan F. Glas and Takayuki Kanda, Dylan F. Glas and Masahiro Shiomi, Dylan F. Glas and Michael Lewis, Dylan F. Glas and Andreas Bley, Dylan F. Glas and St. Mueller, Dylan F. Glas and Jisang Sun, Andreas Bley and Dirk Wollherr, Andreas Bley and Hiroshi Ishiguro, Andreas Bley and Takayuki Kanda, Andreas Bley and Masahiro Shiomi, Andreas Bley and St. Mueller, Dirk Wollherr and Hiroshi Ishiguro, Dirk Wollherr and Takayuki Kanda, Dirk Wollherr and Masahiro Shiomi, Dirk Wollherr and St. Mueller, Masahiro Shiomi and Hiroshi Ishiguro, Masahiro Shiomi and Takayuki Kanda, Masahiro Shiomi and St. Mueller, Hiroshi Ishiguro and Takayuki Kanda, Hiroshi Ishiguro and Michael Lewis, Hiroshi Ishiguro and St. Mueller, Hiroshi Ishiguro and Jisang Sun, St. Mueller and Takayuki Kanda, Jisang Sun and Takayuki Kanda, Michael Lewis and Takayuki Kanda.\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 Wang, Gang Tao, Han-Xiong Li, Rafael Mota Grajales, Abdesselem Boulkroune, M. Tadjine, Mondher Farza, M. M'Saad, Seong-Hwan Kim, Olivier Gehan, Shuzhi Sam Ge, F. Boudjema, Wen-Shyong Yu, Yan-Jun Liu\n- Research collaborations between these authors: Wei Wang and Shuzhi Sam Ge, Wei Wang and Yan-Jun Liu, Wei Wang and Gang Tao, Wei Wang and Han-Xiong Li, Wei Wang and Abdesselem Boulkroune, Wei Wang and Wen-Shyong Yu, Wei Wang and M. Tadjine, Wei Wang and Mondher Farza, Wei Wang and M. M'Saad, Gang Tao and Shuzhi Sam Ge, Gang Tao and Yan-Jun Liu, Gang Tao and Han-Xiong Li, Han-Xiong Li and Shuzhi Sam Ge, Han-Xiong Li and Abdesselem Boulkroune, Han-Xiong Li and Yan-Jun Liu, Han-Xiong Li and Wen-Shyong Yu, Han-Xiong Li and M. Tadjine, Han-Xiong Li and Mondher Farza, Han-Xiong Li and M. M'Saad, Rafael Mota Grajales and Mondher Farza, Abdesselem Boulkroune and Shuzhi Sam Ge, Abdesselem Boulkroune and Yan-Jun Liu, Abdesselem Boulkroune and M. Tadjine, Abdesselem Boulkroune and Mondher Farza, Abdesselem Boulkroune and M. M'Saad, Abdesselem Boulkroune and Seong-Hwan Kim, Abdesselem Boulkroune and Wen-Shyong Yu, Abdesselem Boulkroune and F. Boudjema, M. Tadjine and Yan-Jun Liu, M. Tadjine and F. Boudjema, M. Tadjine and Shuzhi Sam Ge, M. Tadjine and Mondher Farza, M. Tadjine and M. M'Saad, M. Tadjine and Seong-Hwan Kim, Mondher Farza and Yan-Jun Liu, Mondher Farza and Wen-Shyong Yu, Mondher Farza and F. Boudjema, Mondher Farza and Shuzhi Sam Ge, Mondher Farza and M. M'Saad, Mondher Farza and Seong-Hwan Kim, Mondher Farza and Olivier Gehan, M. M'Saad and Yan-Jun Liu, M. M'Saad and Wen-Shyong Yu, M. M'Saad and F. Boudjema, M. M'Saad and Shuzhi Sam Ge, M. M'Saad and Seong-Hwan Kim, M. M'Saad and Olivier Gehan, Seong-Hwan Kim and Wen-Shyong Yu, Seong-Hwan Kim and Shuzhi Sam Ge, Shuzhi Sam Ge and Yan-Jun Liu, Wen-Shyong Yu and Yan-Jun Liu.\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\": \"Wei Wang\", \"id\": 4578}, {\"name\": \"Gang Tao\", \"id\": 225667}, {\"name\": \"Han-Xiong Li\", \"id\": 391146}, {\"name\": \"Rafael Mota Grajales\", \"id\": 908938}, {\"name\": \"Abdesselem Boulkroune\", \"id\": 137004}, {\"name\": \"M. Tadjine\", \"id\": 252175}, {\"name\": \"Mondher Farza\", \"id\": 493013}, {\"name\": \"M. M'Saad\", \"id\": 493014}, {\"name\": \"Seong-Hwan Kim\", \"id\": 624118}, {\"name\": \"Olivier Gehan\", \"id\": 626005}, {\"name\": \"Shuzhi Sam Ge\", \"id\": 16443}, {\"name\": \"F. Boudjema\", \"id\": 203388}, {\"name\": \"Wen-Shyong Yu\", \"id\": 190557}, {\"name\": \"Yan-Jun Liu\", \"id\": 187262}], \"links\": [{\"source\": 4578, \"target\": 16443}, {\"source\": 4578, \"target\": 187262}, {\"source\": 4578, \"target\": 225667}, {\"source\": 4578, \"target\": 391146}, {\"source\": 4578, \"target\": 137004}, {\"source\": 4578, \"target\": 190557}, {\"source\": 4578, \"target\": 252175}, {\"source\": 4578, \"target\": 493013}, {\"source\": 4578, \"target\": 493014}, {\"source\": 225667, \"target\": 16443}, {\"source\": 225667, \"target\": 187262}, {\"source\": 225667, \"target\": 391146}, {\"source\": 391146, \"target\": 16443}, {\"source\": 391146, \"target\": 137004}, {\"source\": 391146, \"target\": 187262}, {\"source\": 391146, \"target\": 190557}, {\"source\": 391146, \"target\": 252175}, {\"source\": 391146, \"target\": 493013}, {\"source\": 391146, \"target\": 493014}, {\"source\": 908938, \"target\": 493013}, {\"source\": 137004, \"target\": 16443}, {\"source\": 137004, \"target\": 187262}, {\"source\": 137004, \"target\": 252175}, {\"source\": 137004, \"target\": 493013}, {\"source\": 137004, \"target\": 493014}, {\"source\": 137004, \"target\": 624118}, {\"source\": 137004, \"target\": 190557}, {\"source\": 137004, \"target\": 203388}, {\"source\": 252175, \"target\": 187262}, {\"source\": 252175, \"target\": 203388}, {\"source\": 252175, \"target\": 16443}, {\"source\": 252175, \"target\": 493013}, {\"source\": 252175, \"target\": 493014}, {\"source\": 252175, \"target\": 624118}, {\"source\": 493013, \"target\": 187262}, {\"source\": 493013, \"target\": 190557}, {\"source\": 493013, \"target\": 203388}, {\"source\": 493013, \"target\": 16443}, {\"source\": 493013, \"target\": 493014}, {\"source\": 493013, \"target\": 624118}, {\"source\": 493013, \"target\": 626005}, {\"source\": 493014, \"target\": 187262}, {\"source\": 493014, \"target\": 190557}, {\"source\": 493014, \"target\": 203388}, {\"source\": 493014, \"target\": 16443}, {\"source\": 493014, \"target\": 624118}, {\"source\": 493014, \"target\": 626005}, {\"source\": 624118, \"target\": 190557}, {\"source\": 624118, \"target\": 16443}, {\"source\": 16443, \"target\": 187262}, {\"source\": 190557, \"target\": 187262}]}",
"id": 199,
"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 Wang, Gang Tao, Han-Xiong Li, Rafael Mota Grajales, Abdesselem Boulkroune, M. Tadjine, Mondher Farza, M. M'Saad, Seong-Hwan Kim, Olivier Gehan, Shuzhi Sam Ge, F. Boudjema, Wen-Shyong Yu, Yan-Jun Liu\n- Research collaborations between these authors: Wei Wang and Shuzhi Sam Ge, Wei Wang and Yan-Jun Liu, Wei Wang and Gang Tao, Wei Wang and Han-Xiong Li, Wei Wang and Abdesselem Boulkroune, Wei Wang and Wen-Shyong Yu, Wei Wang and M. Tadjine, Wei Wang and Mondher Farza, Wei Wang and M. M'Saad, Gang Tao and Shuzhi Sam Ge, Gang Tao and Yan-Jun Liu, Gang Tao and Han-Xiong Li, Han-Xiong Li and Shuzhi Sam Ge, Han-Xiong Li and Abdesselem Boulkroune, Han-Xiong Li and Yan-Jun Liu, Han-Xiong Li and Wen-Shyong Yu, Han-Xiong Li and M. Tadjine, Han-Xiong Li and Mondher Farza, Han-Xiong Li and M. M'Saad, Rafael Mota Grajales and Mondher Farza, Abdesselem Boulkroune and Shuzhi Sam Ge, Abdesselem Boulkroune and Yan-Jun Liu, Abdesselem Boulkroune and M. Tadjine, Abdesselem Boulkroune and Mondher Farza, Abdesselem Boulkroune and M. M'Saad, Abdesselem Boulkroune and Seong-Hwan Kim, Abdesselem Boulkroune and Wen-Shyong Yu, Abdesselem Boulkroune and F. Boudjema, M. Tadjine and Yan-Jun Liu, M. Tadjine and F. Boudjema, M. Tadjine and Shuzhi Sam Ge, M. Tadjine and Mondher Farza, M. Tadjine and M. M'Saad, M. Tadjine and Seong-Hwan Kim, Mondher Farza and Yan-Jun Liu, Mondher Farza and Wen-Shyong Yu, Mondher Farza and F. Boudjema, Mondher Farza and Shuzhi Sam Ge, Mondher Farza and M. M'Saad, Mondher Farza and Seong-Hwan Kim, Mondher Farza and Olivier Gehan, M. M'Saad and Yan-Jun Liu, M. M'Saad and Wen-Shyong Yu, M. M'Saad and F. Boudjema, M. M'Saad and Shuzhi Sam Ge, M. M'Saad and Seong-Hwan Kim, M. M'Saad and Olivier Gehan, Seong-Hwan Kim and Wen-Shyong Yu, Seong-Hwan Kim and Shuzhi Sam Ge, Shuzhi Sam Ge and Yan-Jun Liu, Wen-Shyong Yu and Yan-Jun Liu.\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: Gaolin Fang, Hongming Zhang, Christian Vogler, Stefanos D. Kollias, Thad Starner, Vassilis Pitsikalis, W. W. Kong, Houqiang Li, Debin Zhao, Wen Gao, Hanjie Wang, Yiqiang Chen, Wengang Zhou, Petros Maragos\n- Research collaborations between these authors: Gaolin Fang and Petros Maragos, Gaolin Fang and Stefanos D. Kollias, Gaolin Fang and Debin Zhao, Gaolin Fang and Wen Gao, Gaolin Fang and Thad Starner, Gaolin Fang and Vassilis Pitsikalis, Gaolin Fang and Yiqiang Chen, Gaolin Fang and Hongming Zhang, Gaolin Fang and Christian Vogler, Gaolin Fang and Houqiang Li, Gaolin Fang and Hanjie Wang, Gaolin Fang and Wengang Zhou, Gaolin Fang and W. W. Kong, Hongming Zhang and Debin Zhao, Hongming Zhang and Wen Gao, Christian Vogler and Petros Maragos, Christian Vogler and Debin Zhao, Christian Vogler and Wen Gao, Christian Vogler and Thad Starner, Christian Vogler and Vassilis Pitsikalis, Christian Vogler and Yiqiang Chen, Stefanos D. Kollias and Petros Maragos, Stefanos D. Kollias and Debin Zhao, Stefanos D. Kollias and Wen Gao, Thad Starner and Wen Gao, Thad Starner and Debin Zhao, Thad Starner and Hanjie Wang, Vassilis Pitsikalis and Petros Maragos, Vassilis Pitsikalis and Wen Gao, W. W. Kong and Wen Gao, Houqiang Li and Debin Zhao, Houqiang Li and Wen Gao, Houqiang Li and Hanjie Wang, Houqiang Li and Wengang Zhou, Debin Zhao and Wen Gao, Debin Zhao and Yiqiang Chen, Debin Zhao and Hanjie Wang, Debin Zhao and Wengang Zhou, Wen Gao and Petros Maragos, Wen Gao and Yiqiang Chen, Wen Gao and Wengang Zhou, Wen Gao and Hanjie Wang, Hanjie Wang and Wengang Zhou.\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\": \"Gaolin Fang\", \"id\": 59552}, {\"name\": \"Hongming Zhang\", \"id\": 176226}, {\"name\": \"Christian Vogler\", \"id\": 240899}, {\"name\": \"Stefanos D. Kollias\", \"id\": 4390}, {\"name\": \"Thad Starner\", \"id\": 27625}, {\"name\": \"Vassilis Pitsikalis\", \"id\": 58345}, {\"name\": \"W. W. Kong\", \"id\": 798987}, {\"name\": \"Houqiang Li\", \"id\": 102539}, {\"name\": \"Debin Zhao\", \"id\": 13901}, {\"name\": \"Wen Gao\", \"id\": 13902}, {\"name\": \"Hanjie Wang\", \"id\": 218255}, {\"name\": \"Yiqiang Chen\", \"id\": 153003}, {\"name\": \"Wengang Zhou\", \"id\": 230587}, {\"name\": \"Petros Maragos\", \"id\": 2206}], \"links\": [{\"source\": 59552, \"target\": 2206}, {\"source\": 59552, \"target\": 4390}, {\"source\": 59552, \"target\": 13901}, {\"source\": 59552, \"target\": 13902}, {\"source\": 59552, \"target\": 27625}, {\"source\": 59552, \"target\": 58345}, {\"source\": 59552, \"target\": 153003}, {\"source\": 59552, \"target\": 176226}, {\"source\": 59552, \"target\": 240899}, {\"source\": 59552, \"target\": 102539}, {\"source\": 59552, \"target\": 218255}, {\"source\": 59552, \"target\": 230587}, {\"source\": 59552, \"target\": 798987}, {\"source\": 176226, \"target\": 13901}, {\"source\": 176226, \"target\": 13902}, {\"source\": 240899, \"target\": 2206}, {\"source\": 240899, \"target\": 13901}, {\"source\": 240899, \"target\": 13902}, {\"source\": 240899, \"target\": 27625}, {\"source\": 240899, \"target\": 58345}, {\"source\": 240899, \"target\": 153003}, {\"source\": 4390, \"target\": 2206}, {\"source\": 4390, \"target\": 13901}, {\"source\": 4390, \"target\": 13902}, {\"source\": 27625, \"target\": 13902}, {\"source\": 27625, \"target\": 13901}, {\"source\": 27625, \"target\": 218255}, {\"source\": 58345, \"target\": 2206}, {\"source\": 58345, \"target\": 13902}, {\"source\": 798987, \"target\": 13902}, {\"source\": 102539, \"target\": 13901}, {\"source\": 102539, \"target\": 13902}, {\"source\": 102539, \"target\": 218255}, {\"source\": 102539, \"target\": 230587}, {\"source\": 13901, \"target\": 13902}, {\"source\": 13901, \"target\": 153003}, {\"source\": 13901, \"target\": 218255}, {\"source\": 13901, \"target\": 230587}, {\"source\": 13902, \"target\": 2206}, {\"source\": 13902, \"target\": 153003}, {\"source\": 13902, \"target\": 230587}, {\"source\": 13902, \"target\": 218255}, {\"source\": 218255, \"target\": 230587}]}",
"id": 1920,
"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: Gaolin Fang, Hongming Zhang, Christian Vogler, Stefanos D. Kollias, Thad Starner, Vassilis Pitsikalis, W. W. Kong, Houqiang Li, Debin Zhao, Wen Gao, Hanjie Wang, Yiqiang Chen, Wengang Zhou, Petros Maragos\n- Research collaborations between these authors: Gaolin Fang and Petros Maragos, Gaolin Fang and Stefanos D. Kollias, Gaolin Fang and Debin Zhao, Gaolin Fang and Wen Gao, Gaolin Fang and Thad Starner, Gaolin Fang and Vassilis Pitsikalis, Gaolin Fang and Yiqiang Chen, Gaolin Fang and Hongming Zhang, Gaolin Fang and Christian Vogler, Gaolin Fang and Houqiang Li, Gaolin Fang and Hanjie Wang, Gaolin Fang and Wengang Zhou, Gaolin Fang and W. W. Kong, Hongming Zhang and Debin Zhao, Hongming Zhang and Wen Gao, Christian Vogler and Petros Maragos, Christian Vogler and Debin Zhao, Christian Vogler and Wen Gao, Christian Vogler and Thad Starner, Christian Vogler and Vassilis Pitsikalis, Christian Vogler and Yiqiang Chen, Stefanos D. Kollias and Petros Maragos, Stefanos D. Kollias and Debin Zhao, Stefanos D. Kollias and Wen Gao, Thad Starner and Wen Gao, Thad Starner and Debin Zhao, Thad Starner and Hanjie Wang, Vassilis Pitsikalis and Petros Maragos, Vassilis Pitsikalis and Wen Gao, W. W. Kong and Wen Gao, Houqiang Li and Debin Zhao, Houqiang Li and Wen Gao, Houqiang Li and Hanjie Wang, Houqiang Li and Wengang Zhou, Debin Zhao and Wen Gao, Debin Zhao and Yiqiang Chen, Debin Zhao and Hanjie Wang, Debin Zhao and Wengang Zhou, Wen Gao and Petros Maragos, Wen Gao and Yiqiang Chen, Wen Gao and Wengang Zhou, Wen Gao and Hanjie Wang, Hanjie Wang and Wengang Zhou.\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 P. Vandervalk, Harold Boley, David L. Buckeridge, Christopher J. O. Baker, Artjom Klein, Arash Shaban-Nejad, Gregory W. Rose, Alexandre Riazanov, Riccardo Rosati, Alan J. Forster, Mohammad Sadnan Al Manir, Michel Dumontier, Leonid L. Chepelev, Mark D. Wilkinson\n- Research collaborations between these authors: Benjamin P. Vandervalk and Artjom Klein, Benjamin P. Vandervalk and Christopher J. O. Baker, Benjamin P. Vandervalk and Michel Dumontier, Benjamin P. Vandervalk and Arash Shaban-Nejad, Benjamin P. Vandervalk and Alexandre Riazanov, Benjamin P. Vandervalk and David L. Buckeridge, Benjamin P. Vandervalk and Mark D. Wilkinson, Benjamin P. Vandervalk and Gregory W. Rose, Benjamin P. Vandervalk and Alan J. Forster, Benjamin P. Vandervalk and Leonid L. Chepelev, Harold Boley and Artjom Klein, Harold Boley and Christopher J. O. Baker, Harold Boley and Riccardo Rosati, Harold Boley and Arash Shaban-Nejad, Harold Boley and Alexandre Riazanov, Harold Boley and David L. Buckeridge, Harold Boley and Mohammad Sadnan Al Manir, Harold Boley and Gregory W. Rose, Harold Boley and Alan J. Forster, David L. Buckeridge and Artjom Klein, David L. Buckeridge and Christopher J. O. Baker, David L. Buckeridge and Arash Shaban-Nejad, David L. Buckeridge and Alexandre Riazanov, David L. Buckeridge and Michel Dumontier, David L. Buckeridge and Mark D. Wilkinson, David L. Buckeridge and Gregory W. Rose, David L. Buckeridge and Alan J. Forster, David L. Buckeridge and Leonid L. Chepelev, David L. Buckeridge and Mohammad Sadnan Al Manir, Christopher J. O. Baker and Artjom Klein, Christopher J. O. Baker and Michel Dumontier, Christopher J. O. Baker and Riccardo Rosati, Christopher J. O. Baker and Arash Shaban-Nejad, Christopher J. O. Baker and Alexandre Riazanov, Christopher J. O. Baker and Mark D. Wilkinson, Christopher J. O. Baker and Gregory W. Rose, Christopher J. O. Baker and Alan J. Forster, Christopher J. O. Baker and Leonid L. Chepelev, Christopher J. O. Baker and Mohammad Sadnan Al Manir, Artjom Klein and Michel Dumontier, Artjom Klein and Riccardo Rosati, Artjom Klein and Arash Shaban-Nejad, Artjom Klein and Alexandre Riazanov, Artjom Klein and Mark D. Wilkinson, Artjom Klein and Gregory W. Rose, Artjom Klein and Alan J. Forster, Artjom Klein and Leonid L. Chepelev, Artjom Klein and Mohammad Sadnan Al Manir, Arash Shaban-Nejad and Michel Dumontier, Arash Shaban-Nejad and Alexandre Riazanov, Arash Shaban-Nejad and Mark D. Wilkinson, Arash Shaban-Nejad and Gregory W. Rose, Arash Shaban-Nejad and Alan J. Forster, Arash Shaban-Nejad and Leonid L. Chepelev, Arash Shaban-Nejad and Mohammad Sadnan Al Manir, Gregory W. Rose and Alexandre Riazanov, Gregory W. Rose and Mohammad Sadnan Al Manir, Gregory W. Rose and Mark D. Wilkinson, Gregory W. Rose and Alan J. Forster, Alexandre Riazanov and Michel Dumontier, Alexandre Riazanov and Riccardo Rosati, Alexandre Riazanov and Mark D. Wilkinson, Alexandre Riazanov and Alan J. Forster, Alexandre Riazanov and Leonid L. Chepelev, Alexandre Riazanov and Mohammad Sadnan Al Manir, Alan J. Forster and Mohammad Sadnan Al Manir, Alan J. Forster and Michel Dumontier, Alan J. Forster and Mark D. Wilkinson, Alan J. Forster and Leonid L. Chepelev, Michel Dumontier and Mark D. Wilkinson, Michel Dumontier and Leonid L. Chepelev, Leonid L. Chepelev and Mark D. Wilkinson.\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\": \"Benjamin P. Vandervalk\", \"id\": 85608}, {\"name\": \"Harold Boley\", \"id\": 2349}, {\"name\": \"Artjom Klein\", \"id\": 3055}, {\"name\": \"Christopher J. O. Baker\", \"id\": 3056}, {\"name\": \"David L. Buckeridge\", \"id\": 40463}, {\"name\": \"Arash Shaban-Nejad\", \"id\": 21042}, {\"name\": \"Gregory W. Rose\", \"id\": 108275}, {\"name\": \"Alexandre Riazanov\", \"id\": 29392}, {\"name\": \"Riccardo Rosati\", \"id\": 14677}, {\"name\": \"Alan J. Forster\", \"id\": 108278}, {\"name\": \"Mohammad Sadnan Al Manir\", \"id\": 81844}, {\"name\": \"Michel Dumontier\", \"id\": 11384}, {\"name\": \"Leonid L. Chepelev\", \"id\": 664978}, {\"name\": \"Mark D. Wilkinson\", \"id\": 51868}], \"links\": [{\"source\": 85608, \"target\": 3055}, {\"source\": 85608, \"target\": 3056}, {\"source\": 85608, \"target\": 11384}, {\"source\": 85608, \"target\": 21042}, {\"source\": 85608, \"target\": 29392}, {\"source\": 85608, \"target\": 40463}, {\"source\": 85608, \"target\": 51868}, {\"source\": 85608, \"target\": 108275}, {\"source\": 85608, \"target\": 108278}, {\"source\": 85608, \"target\": 664978}, {\"source\": 2349, \"target\": 3055}, {\"source\": 2349, \"target\": 3056}, {\"source\": 2349, \"target\": 14677}, {\"source\": 2349, \"target\": 21042}, {\"source\": 2349, \"target\": 29392}, {\"source\": 2349, \"target\": 40463}, {\"source\": 2349, \"target\": 81844}, {\"source\": 2349, \"target\": 108275}, {\"source\": 2349, \"target\": 108278}, {\"source\": 3055, \"target\": 3056}, {\"source\": 3055, \"target\": 11384}, {\"source\": 3055, \"target\": 14677}, {\"source\": 3055, \"target\": 21042}, {\"source\": 3055, \"target\": 29392}, {\"source\": 3055, \"target\": 40463}, {\"source\": 3055, \"target\": 51868}, {\"source\": 3055, \"target\": 108275}, {\"source\": 3055, \"target\": 108278}, {\"source\": 3055, \"target\": 664978}, {\"source\": 3055, \"target\": 81844}, {\"source\": 3056, \"target\": 11384}, {\"source\": 3056, \"target\": 14677}, {\"source\": 3056, \"target\": 21042}, {\"source\": 3056, \"target\": 29392}, {\"source\": 3056, \"target\": 40463}, {\"source\": 3056, \"target\": 51868}, {\"source\": 3056, \"target\": 108275}, {\"source\": 3056, \"target\": 108278}, {\"source\": 3056, \"target\": 664978}, {\"source\": 3056, \"target\": 81844}, {\"source\": 40463, \"target\": 21042}, {\"source\": 40463, \"target\": 29392}, {\"source\": 40463, \"target\": 11384}, {\"source\": 40463, \"target\": 51868}, {\"source\": 40463, \"target\": 108275}, {\"source\": 40463, \"target\": 108278}, {\"source\": 40463, \"target\": 664978}, {\"source\": 40463, \"target\": 81844}, {\"source\": 21042, \"target\": 11384}, {\"source\": 21042, \"target\": 29392}, {\"source\": 21042, \"target\": 51868}, {\"source\": 21042, \"target\": 108275}, {\"source\": 21042, \"target\": 108278}, {\"source\": 21042, \"target\": 664978}, {\"source\": 21042, \"target\": 81844}, {\"source\": 108275, \"target\": 29392}, {\"source\": 108275, \"target\": 81844}, {\"source\": 108275, \"target\": 51868}, {\"source\": 108275, \"target\": 108278}, {\"source\": 29392, \"target\": 11384}, {\"source\": 29392, \"target\": 14677}, {\"source\": 29392, \"target\": 51868}, {\"source\": 29392, \"target\": 108278}, {\"source\": 29392, \"target\": 664978}, {\"source\": 29392, \"target\": 81844}, {\"source\": 108278, \"target\": 81844}, {\"source\": 108278, \"target\": 11384}, {\"source\": 108278, \"target\": 51868}, {\"source\": 108278, \"target\": 664978}, {\"source\": 11384, \"target\": 51868}, {\"source\": 11384, \"target\": 664978}, {\"source\": 664978, \"target\": 51868}]}",
"id": 1100,
"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 P. Vandervalk, Harold Boley, David L. Buckeridge, Christopher J. O. Baker, Artjom Klein, Arash Shaban-Nejad, Gregory W. Rose, Alexandre Riazanov, Riccardo Rosati, Alan J. Forster, Mohammad Sadnan Al Manir, Michel Dumontier, Leonid L. Chepelev, Mark D. Wilkinson\n- Research collaborations between these authors: Benjamin P. Vandervalk and Artjom Klein, Benjamin P. Vandervalk and Christopher J. O. Baker, Benjamin P. Vandervalk and Michel Dumontier, Benjamin P. Vandervalk and Arash Shaban-Nejad, Benjamin P. Vandervalk and Alexandre Riazanov, Benjamin P. Vandervalk and David L. Buckeridge, Benjamin P. Vandervalk and Mark D. Wilkinson, Benjamin P. Vandervalk and Gregory W. Rose, Benjamin P. Vandervalk and Alan J. Forster, Benjamin P. Vandervalk and Leonid L. Chepelev, Harold Boley and Artjom Klein, Harold Boley and Christopher J. O. Baker, Harold Boley and Riccardo Rosati, Harold Boley and Arash Shaban-Nejad, Harold Boley and Alexandre Riazanov, Harold Boley and David L. Buckeridge, Harold Boley and Mohammad Sadnan Al Manir, Harold Boley and Gregory W. Rose, Harold Boley and Alan J. Forster, David L. Buckeridge and Artjom Klein, David L. Buckeridge and Christopher J. O. Baker, David L. Buckeridge and Arash Shaban-Nejad, David L. Buckeridge and Alexandre Riazanov, David L. Buckeridge and Michel Dumontier, David L. Buckeridge and Mark D. Wilkinson, David L. Buckeridge and Gregory W. Rose, David L. Buckeridge and Alan J. Forster, David L. Buckeridge and Leonid L. Chepelev, David L. Buckeridge and Mohammad Sadnan Al Manir, Christopher J. O. Baker and Artjom Klein, Christopher J. O. Baker and Michel Dumontier, Christopher J. O. Baker and Riccardo Rosati, Christopher J. O. Baker and Arash Shaban-Nejad, Christopher J. O. Baker and Alexandre Riazanov, Christopher J. O. Baker and Mark D. Wilkinson, Christopher J. O. Baker and Gregory W. Rose, Christopher J. O. Baker and Alan J. Forster, Christopher J. O. Baker and Leonid L. Chepelev, Christopher J. O. Baker and Mohammad Sadnan Al Manir, Artjom Klein and Michel Dumontier, Artjom Klein and Riccardo Rosati, Artjom Klein and Arash Shaban-Nejad, Artjom Klein and Alexandre Riazanov, Artjom Klein and Mark D. Wilkinson, Artjom Klein and Gregory W. Rose, Artjom Klein and Alan J. Forster, Artjom Klein and Leonid L. Chepelev, Artjom Klein and Mohammad Sadnan Al Manir, Arash Shaban-Nejad and Michel Dumontier, Arash Shaban-Nejad and Alexandre Riazanov, Arash Shaban-Nejad and Mark D. Wilkinson, Arash Shaban-Nejad and Gregory W. Rose, Arash Shaban-Nejad and Alan J. Forster, Arash Shaban-Nejad and Leonid L. Chepelev, Arash Shaban-Nejad and Mohammad Sadnan Al Manir, Gregory W. Rose and Alexandre Riazanov, Gregory W. Rose and Mohammad Sadnan Al Manir, Gregory W. Rose and Mark D. Wilkinson, Gregory W. Rose and Alan J. Forster, Alexandre Riazanov and Michel Dumontier, Alexandre Riazanov and Riccardo Rosati, Alexandre Riazanov and Mark D. Wilkinson, Alexandre Riazanov and Alan J. Forster, Alexandre Riazanov and Leonid L. Chepelev, Alexandre Riazanov and Mohammad Sadnan Al Manir, Alan J. Forster and Mohammad Sadnan Al Manir, Alan J. Forster and Michel Dumontier, Alan J. Forster and Mark D. Wilkinson, Alan J. Forster and Leonid L. Chepelev, Michel Dumontier and Mark D. Wilkinson, Michel Dumontier and Leonid L. Chepelev, Leonid L. Chepelev and Mark D. Wilkinson.\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: Loo-Nin Teow, Ah-Hwee Tan, Chaijie Duan, Zhengrong Liang, Dan Xiao, Hongbing Lu, Yew-Soon Ong, Janusz A. Starzyk, Budhitama Subagdja, Yuan-Sin Tan, Gyeong-Moon Park, Sean A. Munson, Ning Lu, Teck-Hou Teng\n- Research collaborations between these authors: Loo-Nin Teow and Ah-Hwee Tan, Loo-Nin Teow and Teck-Hou Teng, Ah-Hwee Tan and Janusz A. Starzyk, Ah-Hwee Tan and Yew-Soon Ong, Ah-Hwee Tan and Ning Lu, Ah-Hwee Tan and Budhitama Subagdja, Ah-Hwee Tan and Yuan-Sin Tan, Ah-Hwee Tan and Dan Xiao, Ah-Hwee Tan and Teck-Hou Teng, Ah-Hwee Tan and Gyeong-Moon Park, Chaijie Duan and Zhengrong Liang, Chaijie Duan and Hongbing Lu, Chaijie Duan and Dan Xiao, Zhengrong Liang and Hongbing Lu, Zhengrong Liang and Dan Xiao, Dan Xiao and Janusz A. Starzyk, Dan Xiao and Yew-Soon Ong, Dan Xiao and Yuan-Sin Tan, Dan Xiao and Sean A. Munson, Dan Xiao and Hongbing Lu, Dan Xiao and Teck-Hou Teng, Yew-Soon Ong and Ning Lu, Yew-Soon Ong and Budhitama Subagdja, Janusz A. Starzyk and Ning Lu, Janusz A. Starzyk and Teck-Hou Teng, Janusz A. Starzyk and Budhitama Subagdja, Budhitama Subagdja and Gyeong-Moon Park, Yuan-Sin Tan and Ning Lu, Yuan-Sin Tan and Teck-Hou Teng, Ning Lu and Teck-Hou Teng.\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\": \"Loo-Nin Teow\", \"id\": 89890}, {\"name\": \"Ah-Hwee Tan\", \"id\": 118180}, {\"name\": \"Chaijie Duan\", \"id\": 40870}, {\"name\": \"Zhengrong Liang\", \"id\": 40872}, {\"name\": \"Dan Xiao\", \"id\": 246537}, {\"name\": \"Hongbing Lu\", \"id\": 246538}, {\"name\": \"Yew-Soon Ong\", \"id\": 120044}, {\"name\": \"Janusz A. Starzyk\", \"id\": 52910}, {\"name\": \"Budhitama Subagdja\", \"id\": 196178}, {\"name\": \"Yuan-Sin Tan\", \"id\": 196180}, {\"name\": \"Gyeong-Moon Park\", \"id\": 205684}, {\"name\": \"Sean A. Munson\", \"id\": 73529}, {\"name\": \"Ning Lu\", \"id\": 130108}, {\"name\": \"Teck-Hou Teng\", \"id\": 412382}], \"links\": [{\"source\": 89890, \"target\": 118180}, {\"source\": 89890, \"target\": 412382}, {\"source\": 118180, \"target\": 52910}, {\"source\": 118180, \"target\": 120044}, {\"source\": 118180, \"target\": 130108}, {\"source\": 118180, \"target\": 196178}, {\"source\": 118180, \"target\": 196180}, {\"source\": 118180, \"target\": 246537}, {\"source\": 118180, \"target\": 412382}, {\"source\": 118180, \"target\": 205684}, {\"source\": 40870, \"target\": 40872}, {\"source\": 40870, \"target\": 246538}, {\"source\": 40870, \"target\": 246537}, {\"source\": 40872, \"target\": 246538}, {\"source\": 40872, \"target\": 246537}, {\"source\": 246537, \"target\": 52910}, {\"source\": 246537, \"target\": 120044}, {\"source\": 246537, \"target\": 196180}, {\"source\": 246537, \"target\": 73529}, {\"source\": 246537, \"target\": 246538}, {\"source\": 246537, \"target\": 412382}, {\"source\": 120044, \"target\": 130108}, {\"source\": 120044, \"target\": 196178}, {\"source\": 52910, \"target\": 130108}, {\"source\": 52910, \"target\": 412382}, {\"source\": 52910, \"target\": 196178}, {\"source\": 196178, \"target\": 205684}, {\"source\": 196180, \"target\": 130108}, {\"source\": 196180, \"target\": 412382}, {\"source\": 130108, \"target\": 412382}]}",
"id": 277,
"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: Loo-Nin Teow, Ah-Hwee Tan, Chaijie Duan, Zhengrong Liang, Dan Xiao, Hongbing Lu, Yew-Soon Ong, Janusz A. Starzyk, Budhitama Subagdja, Yuan-Sin Tan, Gyeong-Moon Park, Sean A. Munson, Ning Lu, Teck-Hou Teng\n- Research collaborations between these authors: Loo-Nin Teow and Ah-Hwee Tan, Loo-Nin Teow and Teck-Hou Teng, Ah-Hwee Tan and Janusz A. Starzyk, Ah-Hwee Tan and Yew-Soon Ong, Ah-Hwee Tan and Ning Lu, Ah-Hwee Tan and Budhitama Subagdja, Ah-Hwee Tan and Yuan-Sin Tan, Ah-Hwee Tan and Dan Xiao, Ah-Hwee Tan and Teck-Hou Teng, Ah-Hwee Tan and Gyeong-Moon Park, Chaijie Duan and Zhengrong Liang, Chaijie Duan and Hongbing Lu, Chaijie Duan and Dan Xiao, Zhengrong Liang and Hongbing Lu, Zhengrong Liang and Dan Xiao, Dan Xiao and Janusz A. Starzyk, Dan Xiao and Yew-Soon Ong, Dan Xiao and Yuan-Sin Tan, Dan Xiao and Sean A. Munson, Dan Xiao and Hongbing Lu, Dan Xiao and Teck-Hou Teng, Yew-Soon Ong and Ning Lu, Yew-Soon Ong and Budhitama Subagdja, Janusz A. Starzyk and Ning Lu, Janusz A. Starzyk and Teck-Hou Teng, Janusz A. Starzyk and Budhitama Subagdja, Budhitama Subagdja and Gyeong-Moon Park, Yuan-Sin Tan and Ning Lu, Yuan-Sin Tan and Teck-Hou Teng, Ning Lu and Teck-Hou Teng.\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: Piero Fraternali, Kay-Uwe Schmidt, Alessandro Bozzon, Sebastian Rudolph, Nenad Stojanovic, Sara Comai, Susan Thomas, Darko Anicic, Wolfgang May, Giovanni Toffetti Carughi, Paul Fodor, Roland Stühmer, Sinan Sen, Ljiljana Stojanovic\n- Research collaborations between these authors: Piero Fraternali and Alessandro Bozzon, Piero Fraternali and Sara Comai, Piero Fraternali and Giovanni Toffetti Carughi, Piero Fraternali and Nenad Stojanovic, Piero Fraternali and Roland Stühmer, Kay-Uwe Schmidt and Nenad Stojanovic, Kay-Uwe Schmidt and Ljiljana Stojanovic, Kay-Uwe Schmidt and Roland Stühmer, Kay-Uwe Schmidt and Susan Thomas, Kay-Uwe Schmidt and Darko Anicic, Kay-Uwe Schmidt and Sinan Sen, Alessandro Bozzon and Sara Comai, Alessandro Bozzon and Giovanni Toffetti Carughi, Alessandro Bozzon and Roland Stühmer, Sebastian Rudolph and Nenad Stojanovic, Sebastian Rudolph and Darko Anicic, Sebastian Rudolph and Paul Fodor, Sebastian Rudolph and Roland Stühmer, Sebastian Rudolph and Ljiljana Stojanovic, Nenad Stojanovic and Wolfgang May, Nenad Stojanovic and Ljiljana Stojanovic, Nenad Stojanovic and Darko Anicic, Nenad Stojanovic and Paul Fodor, Nenad Stojanovic and Roland Stühmer, Nenad Stojanovic and Sinan Sen, Sara Comai and Giovanni Toffetti Carughi, Sara Comai and Roland Stühmer, Susan Thomas and Ljiljana Stojanovic, Susan Thomas and Roland Stühmer, Darko Anicic and Ljiljana Stojanovic, Darko Anicic and Wolfgang May, Darko Anicic and Paul Fodor, Darko Anicic and Roland Stühmer, Wolfgang May and Roland Stühmer, Giovanni Toffetti Carughi and Roland Stühmer, Paul Fodor and Ljiljana Stojanovic, Paul Fodor and Roland Stühmer, Roland Stühmer and Ljiljana Stojanovic, Roland Stühmer and Sinan Sen, Sinan Sen and Ljiljana Stojanovic.\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\": \"Piero Fraternali\", \"id\": 10146}, {\"name\": \"Kay-Uwe Schmidt\", \"id\": 110723}, {\"name\": \"Alessandro Bozzon\", \"id\": 15204}, {\"name\": \"Sebastian Rudolph\", \"id\": 25829}, {\"name\": \"Nenad Stojanovic\", \"id\": 11400}, {\"name\": \"Sara Comai\", \"id\": 48777}, {\"name\": \"Susan Thomas\", \"id\": 252941}, {\"name\": \"Darko Anicic\", \"id\": 116848}, {\"name\": \"Wolfgang May\", \"id\": 13745}, {\"name\": \"Giovanni Toffetti Carughi\", \"id\": 219953}, {\"name\": \"Paul Fodor\", \"id\": 215351}, {\"name\": \"Roland St\\u00fchmer\", \"id\": 230968}, {\"name\": \"Sinan Sen\", \"id\": 230969}, {\"name\": \"Ljiljana Stojanovic\", \"id\": 59035}], \"links\": [{\"source\": 10146, \"target\": 15204}, {\"source\": 10146, \"target\": 48777}, {\"source\": 10146, \"target\": 219953}, {\"source\": 10146, \"target\": 11400}, {\"source\": 10146, \"target\": 230968}, {\"source\": 110723, \"target\": 11400}, {\"source\": 110723, \"target\": 59035}, {\"source\": 110723, \"target\": 230968}, {\"source\": 110723, \"target\": 252941}, {\"source\": 110723, \"target\": 116848}, {\"source\": 110723, \"target\": 230969}, {\"source\": 15204, \"target\": 48777}, {\"source\": 15204, \"target\": 219953}, {\"source\": 15204, \"target\": 230968}, {\"source\": 25829, \"target\": 11400}, {\"source\": 25829, \"target\": 116848}, {\"source\": 25829, \"target\": 215351}, {\"source\": 25829, \"target\": 230968}, {\"source\": 25829, \"target\": 59035}, {\"source\": 11400, \"target\": 13745}, {\"source\": 11400, \"target\": 59035}, {\"source\": 11400, \"target\": 116848}, {\"source\": 11400, \"target\": 215351}, {\"source\": 11400, \"target\": 230968}, {\"source\": 11400, \"target\": 230969}, {\"source\": 48777, \"target\": 219953}, {\"source\": 48777, \"target\": 230968}, {\"source\": 252941, \"target\": 59035}, {\"source\": 252941, \"target\": 230968}, {\"source\": 116848, \"target\": 59035}, {\"source\": 116848, \"target\": 13745}, {\"source\": 116848, \"target\": 215351}, {\"source\": 116848, \"target\": 230968}, {\"source\": 13745, \"target\": 230968}, {\"source\": 219953, \"target\": 230968}, {\"source\": 215351, \"target\": 59035}, {\"source\": 215351, \"target\": 230968}, {\"source\": 230968, \"target\": 59035}, {\"source\": 230968, \"target\": 230969}, {\"source\": 230969, \"target\": 59035}]}",
"id": 2332,
"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: Piero Fraternali, Kay-Uwe Schmidt, Alessandro Bozzon, Sebastian Rudolph, Nenad Stojanovic, Sara Comai, Susan Thomas, Darko Anicic, Wolfgang May, Giovanni Toffetti Carughi, Paul Fodor, Roland Stühmer, Sinan Sen, Ljiljana Stojanovic\n- Research collaborations between these authors: Piero Fraternali and Alessandro Bozzon, Piero Fraternali and Sara Comai, Piero Fraternali and Giovanni Toffetti Carughi, Piero Fraternali and Nenad Stojanovic, Piero Fraternali and Roland Stühmer, Kay-Uwe Schmidt and Nenad Stojanovic, Kay-Uwe Schmidt and Ljiljana Stojanovic, Kay-Uwe Schmidt and Roland Stühmer, Kay-Uwe Schmidt and Susan Thomas, Kay-Uwe Schmidt and Darko Anicic, Kay-Uwe Schmidt and Sinan Sen, Alessandro Bozzon and Sara Comai, Alessandro Bozzon and Giovanni Toffetti Carughi, Alessandro Bozzon and Roland Stühmer, Sebastian Rudolph and Nenad Stojanovic, Sebastian Rudolph and Darko Anicic, Sebastian Rudolph and Paul Fodor, Sebastian Rudolph and Roland Stühmer, Sebastian Rudolph and Ljiljana Stojanovic, Nenad Stojanovic and Wolfgang May, Nenad Stojanovic and Ljiljana Stojanovic, Nenad Stojanovic and Darko Anicic, Nenad Stojanovic and Paul Fodor, Nenad Stojanovic and Roland Stühmer, Nenad Stojanovic and Sinan Sen, Sara Comai and Giovanni Toffetti Carughi, Sara Comai and Roland Stühmer, Susan Thomas and Ljiljana Stojanovic, Susan Thomas and Roland Stühmer, Darko Anicic and Ljiljana Stojanovic, Darko Anicic and Wolfgang May, Darko Anicic and Paul Fodor, Darko Anicic and Roland Stühmer, Wolfgang May and Roland Stühmer, Giovanni Toffetti Carughi and Roland Stühmer, Paul Fodor and Ljiljana Stojanovic, Paul Fodor and Roland Stühmer, Roland Stühmer and Ljiljana Stojanovic, Roland Stühmer and Sinan Sen, Sinan Sen and Ljiljana Stojanovic.\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: Gregorio Convertino, Guy Shani, Jehad Al Dallal, Ed Huai-hsin Chi, Dan Frankowski, Cleila Anna Mannino, Loren G. Terveen, Cai-Nicolas Ziegler, Joseph A. Konstan, Lars Schmidt-Thieme, Dalibor Petković, Martin Wattenberg, Jun Wang, Ken Reily\n- Research collaborations between these authors: Gregorio Convertino and Loren G. Terveen, Gregorio Convertino and Ed Huai-hsin Chi, Guy Shani and Cai-Nicolas Ziegler, Guy Shani and Loren G. Terveen, Guy Shani and Joseph A. Konstan, Ed Huai-hsin Chi and Loren G. Terveen, Ed Huai-hsin Chi and Martin Wattenberg, Ed Huai-hsin Chi and Joseph A. Konstan, Dan Frankowski and Loren G. Terveen, Dan Frankowski and Joseph A. Konstan, Dan Frankowski and Ken Reily, Cleila Anna Mannino and Loren G. Terveen, Loren G. Terveen and Jun Wang, Loren G. Terveen and Lars Schmidt-Thieme, Loren G. Terveen and Cai-Nicolas Ziegler, Loren G. Terveen and Martin Wattenberg, Loren G. Terveen and Joseph A. Konstan, Loren G. Terveen and Ken Reily, Cai-Nicolas Ziegler and Jun Wang, Cai-Nicolas Ziegler and Lars Schmidt-Thieme, Cai-Nicolas Ziegler and Joseph A. Konstan, Joseph A. Konstan and Jun Wang, Joseph A. Konstan and Lars Schmidt-Thieme, Martin Wattenberg and Jun 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": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Gregorio Convertino\", \"id\": 128736}, {\"name\": \"Guy Shani\", \"id\": 44642}, {\"name\": \"Jehad Al Dallal\", \"id\": 381478}, {\"name\": \"Dan Frankowski\", \"id\": 227399}, {\"name\": \"Ed Huai-hsin Chi\", \"id\": 182887}, {\"name\": \"Cleila Anna Mannino\", \"id\": 1026160}, {\"name\": \"Loren G. Terveen\", \"id\": 102961}, {\"name\": \"Cai-Nicolas Ziegler\", \"id\": 21909}, {\"name\": \"Joseph A. Konstan\", \"id\": 113270}, {\"name\": \"Lars Schmidt-Thieme\", \"id\": 15322}, {\"name\": \"Dalibor Petkovi\\u0107\", \"id\": 173564}, {\"name\": \"Martin Wattenberg\", \"id\": 107549}, {\"name\": \"Jun Wang\", \"id\": 9182}, {\"name\": \"Ken Reily\", \"id\": 998719}], \"links\": [{\"source\": 128736, \"target\": 102961}, {\"source\": 128736, \"target\": 182887}, {\"source\": 44642, \"target\": 21909}, {\"source\": 44642, \"target\": 102961}, {\"source\": 44642, \"target\": 113270}, {\"source\": 227399, \"target\": 102961}, {\"source\": 227399, \"target\": 113270}, {\"source\": 227399, \"target\": 998719}, {\"source\": 182887, \"target\": 102961}, {\"source\": 182887, \"target\": 107549}, {\"source\": 182887, \"target\": 113270}, {\"source\": 1026160, \"target\": 102961}, {\"source\": 102961, \"target\": 9182}, {\"source\": 102961, \"target\": 15322}, {\"source\": 102961, \"target\": 21909}, {\"source\": 102961, \"target\": 107549}, {\"source\": 102961, \"target\": 113270}, {\"source\": 102961, \"target\": 998719}, {\"source\": 21909, \"target\": 9182}, {\"source\": 21909, \"target\": 15322}, {\"source\": 21909, \"target\": 113270}, {\"source\": 113270, \"target\": 9182}, {\"source\": 113270, \"target\": 15322}, {\"source\": 107549, \"target\": 9182}]}",
"id": 929,
"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: Gregorio Convertino, Guy Shani, Jehad Al Dallal, Ed Huai-hsin Chi, Dan Frankowski, Cleila Anna Mannino, Loren G. Terveen, Cai-Nicolas Ziegler, Joseph A. Konstan, Lars Schmidt-Thieme, Dalibor Petković, Martin Wattenberg, Jun Wang, Ken Reily\n- Research collaborations between these authors: Gregorio Convertino and Loren G. Terveen, Gregorio Convertino and Ed Huai-hsin Chi, Guy Shani and Cai-Nicolas Ziegler, Guy Shani and Loren G. Terveen, Guy Shani and Joseph A. Konstan, Ed Huai-hsin Chi and Loren G. Terveen, Ed Huai-hsin Chi and Martin Wattenberg, Ed Huai-hsin Chi and Joseph A. Konstan, Dan Frankowski and Loren G. Terveen, Dan Frankowski and Joseph A. Konstan, Dan Frankowski and Ken Reily, Cleila Anna Mannino and Loren G. Terveen, Loren G. Terveen and Jun Wang, Loren G. Terveen and Lars Schmidt-Thieme, Loren G. Terveen and Cai-Nicolas Ziegler, Loren G. Terveen and Martin Wattenberg, Loren G. Terveen and Joseph A. Konstan, Loren G. Terveen and Ken Reily, Cai-Nicolas Ziegler and Jun Wang, Cai-Nicolas Ziegler and Lars Schmidt-Thieme, Cai-Nicolas Ziegler and Joseph A. Konstan, Joseph A. Konstan and Jun Wang, Joseph A. Konstan and Lars Schmidt-Thieme, Martin Wattenberg and Jun 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: Bartek Kiepuszewski, Alistair P. Barros, Ryan K. L. Ko, Jan Mendling, Stephen Siang Guan Lee, Angela Eck Soong Goh, Arthur H. M. ter Hofstede, Dirk Fahland, Schahram Dustdar, Ian Horrocks, Mathias Weske, W. M. P. van der Aalst, Eng Wah Lee, Wil M. P. van der Aalst\n- Research collaborations between these authors: Bartek Kiepuszewski and Jan Mendling, Bartek Kiepuszewski and Wil M. P. van der Aalst, Bartek Kiepuszewski and Schahram Dustdar, Bartek Kiepuszewski and Mathias Weske, Bartek Kiepuszewski and Arthur H. M. ter Hofstede, Bartek Kiepuszewski and Ryan K. L. Ko, Bartek Kiepuszewski and Eng Wah Lee, Bartek Kiepuszewski and W. M. P. van der Aalst, Bartek Kiepuszewski and Stephen Siang Guan Lee, Alistair P. Barros and Jan Mendling, Alistair P. Barros and Wil M. P. van der Aalst, Alistair P. Barros and Schahram Dustdar, Alistair P. Barros and Mathias Weske, Alistair P. Barros and Arthur H. M. ter Hofstede, Alistair P. Barros and Ryan K. L. Ko, Alistair P. Barros and Dirk Fahland, Alistair P. Barros and Eng Wah Lee, Alistair P. Barros and W. M. P. van der Aalst, Alistair P. Barros and Stephen Siang Guan Lee, Ryan K. L. Ko and Wil M. P. van der Aalst, Ryan K. L. Ko and Arthur H. M. ter Hofstede, Ryan K. L. Ko and Eng Wah Lee, Ryan K. L. Ko and Stephen Siang Guan Lee, Jan Mendling and Wil M. P. van der Aalst, Jan Mendling and Schahram Dustdar, Jan Mendling and Mathias Weske, Jan Mendling and Arthur H. M. ter Hofstede, Jan Mendling and Dirk Fahland, Jan Mendling and W. M. P. van der Aalst, Stephen Siang Guan Lee and Eng Wah Lee, Stephen Siang Guan Lee and Angela Eck Soong Goh, Stephen Siang Guan Lee and Wil M. P. van der Aalst, Stephen Siang Guan Lee and Ian Horrocks, Stephen Siang Guan Lee and Arthur H. M. ter Hofstede, Angela Eck Soong Goh and Ian Horrocks, Arthur H. M. ter Hofstede and Wil M. P. van der Aalst, Arthur H. M. ter Hofstede and Schahram Dustdar, Arthur H. M. ter Hofstede and Mathias Weske, Arthur H. M. ter Hofstede and Dirk Fahland, Arthur H. M. ter Hofstede and W. M. P. van der Aalst, Arthur H. M. ter Hofstede and Eng Wah Lee, Dirk Fahland and Wil M. P. van der Aalst, Dirk Fahland and Mathias Weske, Dirk Fahland and W. M. P. van der Aalst, Schahram Dustdar and Wil M. P. van der Aalst, Schahram Dustdar and Mathias Weske, Schahram Dustdar and W. M. P. van der Aalst, Mathias Weske and Wil M. P. van der Aalst, Mathias Weske and W. M. P. van der Aalst, W. M. P. van der Aalst and Wil M. P. van der Aalst, Eng Wah Lee and Wil M. P. van der Aalst.\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\": \"Bartek Kiepuszewski\", \"id\": 428225}, {\"name\": \"W. M. P. van der Aalst\", \"id\": 300026}, {\"name\": \"Ryan K. L. Ko\", \"id\": 93828}, {\"name\": \"Alistair P. Barros\", \"id\": 27684}, {\"name\": \"Jan Mendling\", \"id\": 583}, {\"name\": \"Stephen Siang Guan Lee\", \"id\": 662538}, {\"name\": \"Angela Eck Soong Goh\", \"id\": 429003}, {\"name\": \"Arthur H. M. ter Hofstede\", \"id\": 22124}, {\"name\": \"Dirk Fahland\", \"id\": 97068}, {\"name\": \"Schahram Dustdar\", \"id\": 12494}, {\"name\": \"Ian Horrocks\", \"id\": 18063}, {\"name\": \"Mathias Weske\", \"id\": 20186}, {\"name\": \"Eng Wah Lee\", \"id\": 254429}, {\"name\": \"Wil M. P. van der Aalst\", \"id\": 2495}], \"links\": [{\"source\": 428225, \"target\": 583}, {\"source\": 428225, \"target\": 2495}, {\"source\": 428225, \"target\": 12494}, {\"source\": 428225, \"target\": 20186}, {\"source\": 428225, \"target\": 22124}, {\"source\": 428225, \"target\": 93828}, {\"source\": 428225, \"target\": 254429}, {\"source\": 428225, \"target\": 300026}, {\"source\": 428225, \"target\": 662538}, {\"source\": 300026, \"target\": 583}, {\"source\": 300026, \"target\": 2495}, {\"source\": 300026, \"target\": 12494}, {\"source\": 300026, \"target\": 20186}, {\"source\": 300026, \"target\": 22124}, {\"source\": 300026, \"target\": 97068}, {\"source\": 300026, \"target\": 27684}, {\"source\": 93828, \"target\": 2495}, {\"source\": 93828, \"target\": 22124}, {\"source\": 93828, \"target\": 27684}, {\"source\": 93828, \"target\": 254429}, {\"source\": 93828, \"target\": 662538}, {\"source\": 27684, \"target\": 583}, {\"source\": 27684, \"target\": 2495}, {\"source\": 27684, \"target\": 12494}, {\"source\": 27684, \"target\": 20186}, {\"source\": 27684, \"target\": 22124}, {\"source\": 27684, \"target\": 97068}, {\"source\": 27684, \"target\": 254429}, {\"source\": 27684, \"target\": 662538}, {\"source\": 583, \"target\": 2495}, {\"source\": 583, \"target\": 12494}, {\"source\": 583, \"target\": 20186}, {\"source\": 583, \"target\": 22124}, {\"source\": 583, \"target\": 97068}, {\"source\": 662538, \"target\": 254429}, {\"source\": 662538, \"target\": 429003}, {\"source\": 662538, \"target\": 2495}, {\"source\": 662538, \"target\": 18063}, {\"source\": 662538, \"target\": 22124}, {\"source\": 429003, \"target\": 18063}, {\"source\": 22124, \"target\": 2495}, {\"source\": 22124, \"target\": 12494}, {\"source\": 22124, \"target\": 20186}, {\"source\": 22124, \"target\": 97068}, {\"source\": 22124, \"target\": 254429}, {\"source\": 97068, \"target\": 2495}, {\"source\": 97068, \"target\": 20186}, {\"source\": 12494, \"target\": 2495}, {\"source\": 12494, \"target\": 20186}, {\"source\": 20186, \"target\": 2495}, {\"source\": 254429, \"target\": 2495}]}",
"id": 759,
"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: Bartek Kiepuszewski, Alistair P. Barros, Ryan K. L. Ko, Jan Mendling, Stephen Siang Guan Lee, Angela Eck Soong Goh, Arthur H. M. ter Hofstede, Dirk Fahland, Schahram Dustdar, Ian Horrocks, Mathias Weske, W. M. P. van der Aalst, Eng Wah Lee, Wil M. P. van der Aalst\n- Research collaborations between these authors: Bartek Kiepuszewski and Jan Mendling, Bartek Kiepuszewski and Wil M. P. van der Aalst, Bartek Kiepuszewski and Schahram Dustdar, Bartek Kiepuszewski and Mathias Weske, Bartek Kiepuszewski and Arthur H. M. ter Hofstede, Bartek Kiepuszewski and Ryan K. L. Ko, Bartek Kiepuszewski and Eng Wah Lee, Bartek Kiepuszewski and W. M. P. van der Aalst, Bartek Kiepuszewski and Stephen Siang Guan Lee, Alistair P. Barros and Jan Mendling, Alistair P. Barros and Wil M. P. van der Aalst, Alistair P. Barros and Schahram Dustdar, Alistair P. Barros and Mathias Weske, Alistair P. Barros and Arthur H. M. ter Hofstede, Alistair P. Barros and Ryan K. L. Ko, Alistair P. Barros and Dirk Fahland, Alistair P. Barros and Eng Wah Lee, Alistair P. Barros and W. M. P. van der Aalst, Alistair P. Barros and Stephen Siang Guan Lee, Ryan K. L. Ko and Wil M. P. van der Aalst, Ryan K. L. Ko and Arthur H. M. ter Hofstede, Ryan K. L. Ko and Eng Wah Lee, Ryan K. L. Ko and Stephen Siang Guan Lee, Jan Mendling and Wil M. P. van der Aalst, Jan Mendling and Schahram Dustdar, Jan Mendling and Mathias Weske, Jan Mendling and Arthur H. M. ter Hofstede, Jan Mendling and Dirk Fahland, Jan Mendling and W. M. P. van der Aalst, Stephen Siang Guan Lee and Eng Wah Lee, Stephen Siang Guan Lee and Angela Eck Soong Goh, Stephen Siang Guan Lee and Wil M. P. van der Aalst, Stephen Siang Guan Lee and Ian Horrocks, Stephen Siang Guan Lee and Arthur H. M. ter Hofstede, Angela Eck Soong Goh and Ian Horrocks, Arthur H. M. ter Hofstede and Wil M. P. van der Aalst, Arthur H. M. ter Hofstede and Schahram Dustdar, Arthur H. M. ter Hofstede and Mathias Weske, Arthur H. M. ter Hofstede and Dirk Fahland, Arthur H. M. ter Hofstede and W. M. P. van der Aalst, Arthur H. M. ter Hofstede and Eng Wah Lee, Dirk Fahland and Wil M. P. van der Aalst, Dirk Fahland and Mathias Weske, Dirk Fahland and W. M. P. van der Aalst, Schahram Dustdar and Wil M. P. van der Aalst, Schahram Dustdar and Mathias Weske, Schahram Dustdar and W. M. P. van der Aalst, Mathias Weske and Wil M. P. van der Aalst, Mathias Weske and W. M. P. van der Aalst, W. M. P. van der Aalst and Wil M. P. van der Aalst, Eng Wah Lee and Wil M. P. van der Aalst.\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: Joseph Connelly, Sudeep Kamath, Terence Tao, Steven Weber, Christopher F. Freiling, Kenneth Zeger, Massimo Franceschetti, Randall Dougherty, Issa Khalil, Frank H. P. Fitzek, Alex J. Grant, Shuo-Yen Robert Li, Muriel Medard, Qifu Sun\n- Research collaborations between these authors: Joseph Connelly and Shuo-Yen Robert Li, Joseph Connelly and Randall Dougherty, Joseph Connelly and Christopher F. Freiling, Joseph Connelly and Kenneth Zeger, Sudeep Kamath and Muriel Medard, Sudeep Kamath and Shuo-Yen Robert Li, Sudeep Kamath and Alex J. Grant, Sudeep Kamath and Randall Dougherty, Sudeep Kamath and Christopher F. Freiling, Sudeep Kamath and Kenneth Zeger, Terence Tao and Muriel Medard, Steven Weber and Muriel Medard, Steven Weber and Massimo Franceschetti, Steven Weber and Randall Dougherty, Steven Weber and Christopher F. Freiling, Steven Weber and Kenneth Zeger, Christopher F. Freiling and Muriel Medard, Christopher F. Freiling and Frank H. P. Fitzek, Christopher F. Freiling and Shuo-Yen Robert Li, Christopher F. Freiling and Qifu Sun, Christopher F. Freiling and Issa Khalil, Christopher F. Freiling and Alex J. Grant, Christopher F. Freiling and Massimo Franceschetti, Christopher F. Freiling and Randall Dougherty, Christopher F. Freiling and Kenneth Zeger, Kenneth Zeger and Muriel Medard, Kenneth Zeger and Frank H. P. Fitzek, Kenneth Zeger and Shuo-Yen Robert Li, Kenneth Zeger and Qifu Sun, Kenneth Zeger and Issa Khalil, Kenneth Zeger and Alex J. Grant, Kenneth Zeger and Massimo Franceschetti, Kenneth Zeger and Randall Dougherty, Massimo Franceschetti and Muriel Medard, Massimo Franceschetti and Shuo-Yen Robert Li, Massimo Franceschetti and Randall Dougherty, Randall Dougherty and Muriel Medard, Randall Dougherty and Frank H. P. Fitzek, Randall Dougherty and Shuo-Yen Robert Li, Randall Dougherty and Qifu Sun, Randall Dougherty and Issa Khalil, Randall Dougherty and Alex J. Grant, Issa Khalil and Muriel Medard, Frank H. P. Fitzek and Muriel Medard, Frank H. P. Fitzek and Shuo-Yen Robert Li, Alex J. Grant and Muriel Medard, Alex J. Grant and Shuo-Yen Robert Li, Shuo-Yen Robert Li and Muriel Medard, Shuo-Yen Robert Li and Qifu Sun.\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\": \"Joseph Connelly\", \"id\": 1219009}, {\"name\": \"Sudeep Kamath\", \"id\": 197317}, {\"name\": \"Terence Tao\", \"id\": 227366}, {\"name\": \"Steven Weber\", \"id\": 162119}, {\"name\": \"Christopher F. Freiling\", \"id\": 413168}, {\"name\": \"Kenneth Zeger\", \"id\": 413169}, {\"name\": \"Massimo Franceschetti\", \"id\": 312528}, {\"name\": \"Randall Dougherty\", \"id\": 374867}, {\"name\": \"Issa Khalil\", \"id\": 233136}, {\"name\": \"Frank H. P. Fitzek\", \"id\": 59832}, {\"name\": \"Alex J. Grant\", \"id\": 289177}, {\"name\": \"Shuo-Yen Robert Li\", \"id\": 75770}, {\"name\": \"Muriel Medard\", \"id\": 27582}, {\"name\": \"Qifu Sun\", \"id\": 226201}], \"links\": [{\"source\": 1219009, \"target\": 75770}, {\"source\": 1219009, \"target\": 374867}, {\"source\": 1219009, \"target\": 413168}, {\"source\": 1219009, \"target\": 413169}, {\"source\": 197317, \"target\": 27582}, {\"source\": 197317, \"target\": 75770}, {\"source\": 197317, \"target\": 289177}, {\"source\": 197317, \"target\": 374867}, {\"source\": 197317, \"target\": 413168}, {\"source\": 197317, \"target\": 413169}, {\"source\": 227366, \"target\": 27582}, {\"source\": 162119, \"target\": 27582}, {\"source\": 162119, \"target\": 312528}, {\"source\": 162119, \"target\": 374867}, {\"source\": 162119, \"target\": 413168}, {\"source\": 162119, \"target\": 413169}, {\"source\": 413168, \"target\": 27582}, {\"source\": 413168, \"target\": 59832}, {\"source\": 413168, \"target\": 75770}, {\"source\": 413168, \"target\": 226201}, {\"source\": 413168, \"target\": 233136}, {\"source\": 413168, \"target\": 289177}, {\"source\": 413168, \"target\": 312528}, {\"source\": 413168, \"target\": 374867}, {\"source\": 413168, \"target\": 413169}, {\"source\": 413169, \"target\": 27582}, {\"source\": 413169, \"target\": 59832}, {\"source\": 413169, \"target\": 75770}, {\"source\": 413169, \"target\": 226201}, {\"source\": 413169, \"target\": 233136}, {\"source\": 413169, \"target\": 289177}, {\"source\": 413169, \"target\": 312528}, {\"source\": 413169, \"target\": 374867}, {\"source\": 312528, \"target\": 27582}, {\"source\": 312528, \"target\": 75770}, {\"source\": 312528, \"target\": 374867}, {\"source\": 374867, \"target\": 27582}, {\"source\": 374867, \"target\": 59832}, {\"source\": 374867, \"target\": 75770}, {\"source\": 374867, \"target\": 226201}, {\"source\": 374867, \"target\": 233136}, {\"source\": 374867, \"target\": 289177}, {\"source\": 233136, \"target\": 27582}, {\"source\": 59832, \"target\": 27582}, {\"source\": 59832, \"target\": 75770}, {\"source\": 289177, \"target\": 27582}, {\"source\": 289177, \"target\": 75770}, {\"source\": 75770, \"target\": 27582}, {\"source\": 75770, \"target\": 226201}]}",
"id": 1373,
"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: Joseph Connelly, Sudeep Kamath, Terence Tao, Steven Weber, Christopher F. Freiling, Kenneth Zeger, Massimo Franceschetti, Randall Dougherty, Issa Khalil, Frank H. P. Fitzek, Alex J. Grant, Shuo-Yen Robert Li, Muriel Medard, Qifu Sun\n- Research collaborations between these authors: Joseph Connelly and Shuo-Yen Robert Li, Joseph Connelly and Randall Dougherty, Joseph Connelly and Christopher F. Freiling, Joseph Connelly and Kenneth Zeger, Sudeep Kamath and Muriel Medard, Sudeep Kamath and Shuo-Yen Robert Li, Sudeep Kamath and Alex J. Grant, Sudeep Kamath and Randall Dougherty, Sudeep Kamath and Christopher F. Freiling, Sudeep Kamath and Kenneth Zeger, Terence Tao and Muriel Medard, Steven Weber and Muriel Medard, Steven Weber and Massimo Franceschetti, Steven Weber and Randall Dougherty, Steven Weber and Christopher F. Freiling, Steven Weber and Kenneth Zeger, Christopher F. Freiling and Muriel Medard, Christopher F. Freiling and Frank H. P. Fitzek, Christopher F. Freiling and Shuo-Yen Robert Li, Christopher F. Freiling and Qifu Sun, Christopher F. Freiling and Issa Khalil, Christopher F. Freiling and Alex J. Grant, Christopher F. Freiling and Massimo Franceschetti, Christopher F. Freiling and Randall Dougherty, Christopher F. Freiling and Kenneth Zeger, Kenneth Zeger and Muriel Medard, Kenneth Zeger and Frank H. P. Fitzek, Kenneth Zeger and Shuo-Yen Robert Li, Kenneth Zeger and Qifu Sun, Kenneth Zeger and Issa Khalil, Kenneth Zeger and Alex J. Grant, Kenneth Zeger and Massimo Franceschetti, Kenneth Zeger and Randall Dougherty, Massimo Franceschetti and Muriel Medard, Massimo Franceschetti and Shuo-Yen Robert Li, Massimo Franceschetti and Randall Dougherty, Randall Dougherty and Muriel Medard, Randall Dougherty and Frank H. P. Fitzek, Randall Dougherty and Shuo-Yen Robert Li, Randall Dougherty and Qifu Sun, Randall Dougherty and Issa Khalil, Randall Dougherty and Alex J. Grant, Issa Khalil and Muriel Medard, Frank H. P. Fitzek and Muriel Medard, Frank H. P. Fitzek and Shuo-Yen Robert Li, Alex J. Grant and Muriel Medard, Alex J. Grant and Shuo-Yen Robert Li, Shuo-Yen Robert Li and Muriel Medard, Shuo-Yen Robert Li and Qifu Sun.\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: Maguy Medlej, Fabienne Jézéquel, Hassan Harb, David Laiymani, Deborah Estrin, Christophe Denis, Tian He, Christophe Guyeux, Ali Jaber, Samar Tawbi, Timothy Teo, Abdallah Makhoul, Raphaël Couturier, Jacques M. Bahi\n- Research collaborations between these authors: Maguy Medlej and Jacques M. Bahi, Maguy Medlej and David Laiymani, Maguy Medlej and Abdallah Makhoul, Maguy Medlej and Ali Jaber, Maguy Medlej and Raphaël Couturier, Maguy Medlej and Hassan Harb, Fabienne Jézéquel and Christophe Denis, Fabienne Jézéquel and Jacques M. Bahi, Fabienne Jézéquel and Raphaël Couturier, Hassan Harb and Abdallah Makhoul, Hassan Harb and Raphaël Couturier, Hassan Harb and Jacques M. Bahi, Hassan Harb and David Laiymani, Hassan Harb and Ali Jaber, David Laiymani and Jacques M. Bahi, David Laiymani and Abdallah Makhoul, David Laiymani and Raphaël Couturier, David Laiymani and Ali Jaber, Deborah Estrin and Samar Tawbi, Deborah Estrin and Tian He, Christophe Denis and Jacques M. Bahi, Christophe Denis and Raphaël Couturier, Tian He and Jacques M. Bahi, Tian He and Christophe Guyeux, Tian He and Abdallah Makhoul, Christophe Guyeux and Jacques M. Bahi, Christophe Guyeux and Abdallah Makhoul, Christophe Guyeux and Raphaël Couturier, Ali Jaber and Abdallah Makhoul, Ali Jaber and Jacques M. Bahi, Samar Tawbi and Jacques M. Bahi, Samar Tawbi and Abdallah Makhoul, Abdallah Makhoul and Jacques M. Bahi, Abdallah Makhoul and Raphaël Couturier, Raphaël Couturier and Jacques M. Bahi.\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\": \"Fabienne J\\u00e9z\\u00e9quel\", \"id\": 474657}, {\"name\": \"Hassan Harb\", \"id\": 209378}, {\"name\": \"David Laiymani\", \"id\": 54435}, {\"name\": \"Deborah Estrin\", \"id\": 52260}, {\"name\": \"Christophe Denis\", \"id\": 193957}, {\"name\": \"Tian He\", \"id\": 299596}, {\"name\": \"Abdallah Makhoul\", \"id\": 72797}, {\"name\": \"Christophe Guyeux\", \"id\": 35959}, {\"name\": \"Ali Jaber\", \"id\": 72798}, {\"name\": \"Samar Tawbi\", \"id\": 216122}, {\"name\": \"Timothy Teo\", \"id\": 253436}, {\"name\": \"Maguy Medlej\", \"id\": 138717}, {\"name\": \"Rapha\\u00ebl Couturier\", \"id\": 186654}, {\"name\": \"Jacques M. Bahi\", \"id\": 30271}], \"links\": [{\"source\": 474657, \"target\": 193957}, {\"source\": 474657, \"target\": 30271}, {\"source\": 474657, \"target\": 186654}, {\"source\": 209378, \"target\": 72797}, {\"source\": 209378, \"target\": 186654}, {\"source\": 209378, \"target\": 30271}, {\"source\": 209378, \"target\": 54435}, {\"source\": 209378, \"target\": 72798}, {\"source\": 209378, \"target\": 138717}, {\"source\": 54435, \"target\": 30271}, {\"source\": 54435, \"target\": 72797}, {\"source\": 54435, \"target\": 138717}, {\"source\": 54435, \"target\": 186654}, {\"source\": 54435, \"target\": 72798}, {\"source\": 52260, \"target\": 216122}, {\"source\": 52260, \"target\": 299596}, {\"source\": 193957, \"target\": 30271}, {\"source\": 193957, \"target\": 186654}, {\"source\": 299596, \"target\": 30271}, {\"source\": 299596, \"target\": 35959}, {\"source\": 299596, \"target\": 72797}, {\"source\": 72797, \"target\": 30271}, {\"source\": 72797, \"target\": 35959}, {\"source\": 72797, \"target\": 72798}, {\"source\": 72797, \"target\": 138717}, {\"source\": 72797, \"target\": 186654}, {\"source\": 72797, \"target\": 216122}, {\"source\": 35959, \"target\": 30271}, {\"source\": 35959, \"target\": 186654}, {\"source\": 72798, \"target\": 30271}, {\"source\": 72798, \"target\": 138717}, {\"source\": 216122, \"target\": 30271}, {\"source\": 138717, \"target\": 30271}, {\"source\": 138717, \"target\": 186654}, {\"source\": 186654, \"target\": 30271}]}",
"id": 1521,
"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: Maguy Medlej, Fabienne Jézéquel, Hassan Harb, David Laiymani, Deborah Estrin, Christophe Denis, Tian He, Christophe Guyeux, Ali Jaber, Samar Tawbi, Timothy Teo, Abdallah Makhoul, Raphaël Couturier, Jacques M. Bahi\n- Research collaborations between these authors: Maguy Medlej and Jacques M. Bahi, Maguy Medlej and David Laiymani, Maguy Medlej and Abdallah Makhoul, Maguy Medlej and Ali Jaber, Maguy Medlej and Raphaël Couturier, Maguy Medlej and Hassan Harb, Fabienne Jézéquel and Christophe Denis, Fabienne Jézéquel and Jacques M. Bahi, Fabienne Jézéquel and Raphaël Couturier, Hassan Harb and Abdallah Makhoul, Hassan Harb and Raphaël Couturier, Hassan Harb and Jacques M. Bahi, Hassan Harb and David Laiymani, Hassan Harb and Ali Jaber, David Laiymani and Jacques M. Bahi, David Laiymani and Abdallah Makhoul, David Laiymani and Raphaël Couturier, David Laiymani and Ali Jaber, Deborah Estrin and Samar Tawbi, Deborah Estrin and Tian He, Christophe Denis and Jacques M. Bahi, Christophe Denis and Raphaël Couturier, Tian He and Jacques M. Bahi, Tian He and Christophe Guyeux, Tian He and Abdallah Makhoul, Christophe Guyeux and Jacques M. Bahi, Christophe Guyeux and Abdallah Makhoul, Christophe Guyeux and Raphaël Couturier, Ali Jaber and Abdallah Makhoul, Ali Jaber and Jacques M. Bahi, Samar Tawbi and Jacques M. Bahi, Samar Tawbi and Abdallah Makhoul, Abdallah Makhoul and Jacques M. Bahi, Abdallah Makhoul and Raphaël Couturier, Raphaël Couturier and Jacques M. Bahi.\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: Karthikeyan Sundaresan, Anand Prabhu Subramanian, Vaidyanathan Anantharaman, Nitin H. Vaidya, Prasant Mohapatra, Dina Katabi, Melissa Duarte, Mohammad Amir Khojastepour, Ehsan Aryafar, B. Venkata Ramana, Romit Roy Choudhury, Xinyu Zhang, Elza Erkip, Peter Steenkiste\n- Research collaborations between these authors: Karthikeyan Sundaresan and Prasant Mohapatra, Karthikeyan Sundaresan and Xinyu Zhang, Karthikeyan Sundaresan and Elza Erkip, Karthikeyan Sundaresan and Nitin H. Vaidya, Karthikeyan Sundaresan and Peter Steenkiste, Karthikeyan Sundaresan and Dina Katabi, Karthikeyan Sundaresan and Ehsan Aryafar, Karthikeyan Sundaresan and Romit Roy Choudhury, Karthikeyan Sundaresan and Anand Prabhu Subramanian, Karthikeyan Sundaresan and Melissa Duarte, Karthikeyan Sundaresan and Mohammad Amir Khojastepour, Karthikeyan Sundaresan and B. Venkata Ramana, Anand Prabhu Subramanian and Xinyu Zhang, Anand Prabhu Subramanian and Nitin H. Vaidya, Anand Prabhu Subramanian and Peter Steenkiste, Anand Prabhu Subramanian and Ehsan Aryafar, Anand Prabhu Subramanian and Romit Roy Choudhury, Vaidyanathan Anantharaman and B. Venkata Ramana, Nitin H. Vaidya and Prasant Mohapatra, Nitin H. Vaidya and Dina Katabi, Nitin H. Vaidya and Peter Steenkiste, Nitin H. Vaidya and Romit Roy Choudhury, Prasant Mohapatra and Dina Katabi, Prasant Mohapatra and Xinyu Zhang, Prasant Mohapatra and Peter Steenkiste, Prasant Mohapatra and Romit Roy Choudhury, Dina Katabi and Peter Steenkiste, Dina Katabi and Romit Roy Choudhury, Dina Katabi and Xinyu Zhang, Dina Katabi and Ehsan Aryafar, Melissa Duarte and Elza Erkip, Ehsan Aryafar and Xinyu Zhang, Ehsan Aryafar and Peter Steenkiste, Romit Roy Choudhury and Xinyu Zhang, Romit Roy Choudhury and Peter Steenkiste, Xinyu Zhang and Peter Steenkiste.\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\": \"Karthikeyan Sundaresan\", \"id\": 281792}, {\"name\": \"Nitin H. Vaidya\", \"id\": 121633}, {\"name\": \"Prasant Mohapatra\", \"id\": 40641}, {\"name\": \"Vaidyanathan Anantharaman\", \"id\": 331168}, {\"name\": \"Anand Prabhu Subramanian\", \"id\": 363712}, {\"name\": \"Dina Katabi\", \"id\": 55016}, {\"name\": \"Melissa Duarte\", \"id\": 632562}, {\"name\": \"Mohammad Amir Khojastepour\", \"id\": 635314}, {\"name\": \"Ehsan Aryafar\", \"id\": 283957}, {\"name\": \"B. Venkata Ramana\", \"id\": 343189}, {\"name\": \"Romit Roy Choudhury\", \"id\": 310709}, {\"name\": \"Xinyu Zhang\", \"id\": 70203}, {\"name\": \"Elza Erkip\", \"id\": 82876}, {\"name\": \"Peter Steenkiste\", \"id\": 231295}], \"links\": [{\"source\": 281792, \"target\": 40641}, {\"source\": 281792, \"target\": 70203}, {\"source\": 281792, \"target\": 82876}, {\"source\": 281792, \"target\": 121633}, {\"source\": 281792, \"target\": 231295}, {\"source\": 281792, \"target\": 55016}, {\"source\": 281792, \"target\": 283957}, {\"source\": 281792, \"target\": 310709}, {\"source\": 281792, \"target\": 363712}, {\"source\": 281792, \"target\": 632562}, {\"source\": 281792, \"target\": 635314}, {\"source\": 281792, \"target\": 343189}, {\"source\": 121633, \"target\": 40641}, {\"source\": 121633, \"target\": 55016}, {\"source\": 121633, \"target\": 231295}, {\"source\": 121633, \"target\": 310709}, {\"source\": 121633, \"target\": 363712}, {\"source\": 40641, \"target\": 55016}, {\"source\": 40641, \"target\": 70203}, {\"source\": 40641, \"target\": 231295}, {\"source\": 40641, \"target\": 310709}, {\"source\": 331168, \"target\": 343189}, {\"source\": 363712, \"target\": 70203}, {\"source\": 363712, \"target\": 231295}, {\"source\": 363712, \"target\": 283957}, {\"source\": 363712, \"target\": 310709}, {\"source\": 55016, \"target\": 231295}, {\"source\": 55016, \"target\": 310709}, {\"source\": 55016, \"target\": 70203}, {\"source\": 55016, \"target\": 283957}, {\"source\": 632562, \"target\": 82876}, {\"source\": 283957, \"target\": 70203}, {\"source\": 283957, \"target\": 231295}, {\"source\": 310709, \"target\": 70203}, {\"source\": 310709, \"target\": 231295}, {\"source\": 70203, \"target\": 231295}]}",
"id": 1426,
"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: Karthikeyan Sundaresan, Anand Prabhu Subramanian, Vaidyanathan Anantharaman, Nitin H. Vaidya, Prasant Mohapatra, Dina Katabi, Melissa Duarte, Mohammad Amir Khojastepour, Ehsan Aryafar, B. Venkata Ramana, Romit Roy Choudhury, Xinyu Zhang, Elza Erkip, Peter Steenkiste\n- Research collaborations between these authors: Karthikeyan Sundaresan and Prasant Mohapatra, Karthikeyan Sundaresan and Xinyu Zhang, Karthikeyan Sundaresan and Elza Erkip, Karthikeyan Sundaresan and Nitin H. Vaidya, Karthikeyan Sundaresan and Peter Steenkiste, Karthikeyan Sundaresan and Dina Katabi, Karthikeyan Sundaresan and Ehsan Aryafar, Karthikeyan Sundaresan and Romit Roy Choudhury, Karthikeyan Sundaresan and Anand Prabhu Subramanian, Karthikeyan Sundaresan and Melissa Duarte, Karthikeyan Sundaresan and Mohammad Amir Khojastepour, Karthikeyan Sundaresan and B. Venkata Ramana, Anand Prabhu Subramanian and Xinyu Zhang, Anand Prabhu Subramanian and Nitin H. Vaidya, Anand Prabhu Subramanian and Peter Steenkiste, Anand Prabhu Subramanian and Ehsan Aryafar, Anand Prabhu Subramanian and Romit Roy Choudhury, Vaidyanathan Anantharaman and B. Venkata Ramana, Nitin H. Vaidya and Prasant Mohapatra, Nitin H. Vaidya and Dina Katabi, Nitin H. Vaidya and Peter Steenkiste, Nitin H. Vaidya and Romit Roy Choudhury, Prasant Mohapatra and Dina Katabi, Prasant Mohapatra and Xinyu Zhang, Prasant Mohapatra and Peter Steenkiste, Prasant Mohapatra and Romit Roy Choudhury, Dina Katabi and Peter Steenkiste, Dina Katabi and Romit Roy Choudhury, Dina Katabi and Xinyu Zhang, Dina Katabi and Ehsan Aryafar, Melissa Duarte and Elza Erkip, Ehsan Aryafar and Xinyu Zhang, Ehsan Aryafar and Peter Steenkiste, Romit Roy Choudhury and Xinyu Zhang, Romit Roy Choudhury and Peter Steenkiste, Xinyu Zhang and Peter Steenkiste.\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, Rodrigo Santos, Pham Phuoc Hung, Ali A. Ghorbani, Claudio Bartolini, Aditya Akella, Björn auf dem Graben, Carlos Becker Westphall, Chuanxiong Guo, Jennifer Rexford, Dimitrios Tzovaras, Raouf Boutaba, Lisandro Zambenedetti Granville, Scott Shenker\n- Research collaborations between these authors: Albert G. Greenberg and Raouf Boutaba, Albert G. Greenberg and Scott Shenker, Albert G. Greenberg and Jennifer Rexford, Albert G. Greenberg and Chuanxiong Guo, Albert G. Greenberg and Aditya Akella, Albert G. Greenberg and Lisandro Zambenedetti Granville, Rodrigo Santos and Claudio Bartolini, Rodrigo Santos and Lisandro Zambenedetti Granville, Ali A. Ghorbani and Dimitrios Tzovaras, Ali A. Ghorbani and Lisandro Zambenedetti Granville, Claudio Bartolini and Raouf Boutaba, Claudio Bartolini and Lisandro Zambenedetti Granville, Aditya Akella and Raouf Boutaba, Aditya Akella and Scott Shenker, Aditya Akella and Lisandro Zambenedetti Granville, Aditya Akella and Jennifer Rexford, Aditya Akella and Chuanxiong Guo, Björn auf dem Graben and Lisandro Zambenedetti Granville, Carlos Becker Westphall and Lisandro Zambenedetti Granville, Chuanxiong Guo and Raouf Boutaba, Chuanxiong Guo and Scott Shenker, Chuanxiong Guo and Lisandro Zambenedetti Granville, Chuanxiong Guo and Jennifer Rexford, Jennifer Rexford and Raouf Boutaba, Jennifer Rexford and Scott Shenker, Jennifer Rexford and Lisandro Zambenedetti Granville, Dimitrios Tzovaras and Lisandro Zambenedetti Granville, Raouf Boutaba and Scott Shenker, Raouf Boutaba and Lisandro Zambenedetti Granville, Lisandro Zambenedetti Granville 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": 7,
"style": "rule"
}
|
{
"exact_answer": 7,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Albert G. Greenberg\", \"id\": 75552}, {\"name\": \"Rodrigo Santos\", \"id\": 426145}, {\"name\": \"Pham Phuoc Hung\", \"id\": 76865}, {\"name\": \"Ali A. Ghorbani\", \"id\": 1444}, {\"name\": \"Claudio Bartolini\", \"id\": 42729}, {\"name\": \"Aditya Akella\", \"id\": 161290}, {\"name\": \"Bj\\u00f6rn auf dem Graben\", \"id\": 408270}, {\"name\": \"Carlos Becker Westphall\", \"id\": 175951}, {\"name\": \"Chuanxiong Guo\", \"id\": 148340}, {\"name\": \"Jennifer Rexford\", \"id\": 131285}, {\"name\": \"Dimitrios Tzovaras\", \"id\": 5525}, {\"name\": \"Raouf Boutaba\", \"id\": 19447}, {\"name\": \"Lisandro Zambenedetti Granville\", \"id\": 88794}, {\"name\": \"Scott Shenker\", \"id\": 32157}], \"links\": [{\"source\": 75552, \"target\": 19447}, {\"source\": 75552, \"target\": 32157}, {\"source\": 75552, \"target\": 131285}, {\"source\": 75552, \"target\": 148340}, {\"source\": 75552, \"target\": 161290}, {\"source\": 75552, \"target\": 88794}, {\"source\": 426145, \"target\": 42729}, {\"source\": 426145, \"target\": 88794}, {\"source\": 1444, \"target\": 5525}, {\"source\": 1444, \"target\": 88794}, {\"source\": 42729, \"target\": 19447}, {\"source\": 42729, \"target\": 88794}, {\"source\": 161290, \"target\": 19447}, {\"source\": 161290, \"target\": 32157}, {\"source\": 161290, \"target\": 88794}, {\"source\": 161290, \"target\": 131285}, {\"source\": 161290, \"target\": 148340}, {\"source\": 408270, \"target\": 88794}, {\"source\": 175951, \"target\": 88794}, {\"source\": 148340, \"target\": 19447}, {\"source\": 148340, \"target\": 32157}, {\"source\": 148340, \"target\": 88794}, {\"source\": 148340, \"target\": 131285}, {\"source\": 131285, \"target\": 19447}, {\"source\": 131285, \"target\": 32157}, {\"source\": 131285, \"target\": 88794}, {\"source\": 5525, \"target\": 88794}, {\"source\": 19447, \"target\": 32157}, {\"source\": 19447, \"target\": 88794}, {\"source\": 88794, \"target\": 32157}]}",
"id": 2278,
"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, Rodrigo Santos, Pham Phuoc Hung, Ali A. Ghorbani, Claudio Bartolini, Aditya Akella, Björn auf dem Graben, Carlos Becker Westphall, Chuanxiong Guo, Jennifer Rexford, Dimitrios Tzovaras, Raouf Boutaba, Lisandro Zambenedetti Granville, Scott Shenker\n- Research collaborations between these authors: Albert G. Greenberg and Raouf Boutaba, Albert G. Greenberg and Scott Shenker, Albert G. Greenberg and Jennifer Rexford, Albert G. Greenberg and Chuanxiong Guo, Albert G. Greenberg and Aditya Akella, Albert G. Greenberg and Lisandro Zambenedetti Granville, Rodrigo Santos and Claudio Bartolini, Rodrigo Santos and Lisandro Zambenedetti Granville, Ali A. Ghorbani and Dimitrios Tzovaras, Ali A. Ghorbani and Lisandro Zambenedetti Granville, Claudio Bartolini and Raouf Boutaba, Claudio Bartolini and Lisandro Zambenedetti Granville, Aditya Akella and Raouf Boutaba, Aditya Akella and Scott Shenker, Aditya Akella and Lisandro Zambenedetti Granville, Aditya Akella and Jennifer Rexford, Aditya Akella and Chuanxiong Guo, Björn auf dem Graben and Lisandro Zambenedetti Granville, Carlos Becker Westphall and Lisandro Zambenedetti Granville, Chuanxiong Guo and Raouf Boutaba, Chuanxiong Guo and Scott Shenker, Chuanxiong Guo and Lisandro Zambenedetti Granville, Chuanxiong Guo and Jennifer Rexford, Jennifer Rexford and Raouf Boutaba, Jennifer Rexford and Scott Shenker, Jennifer Rexford and Lisandro Zambenedetti Granville, Dimitrios Tzovaras and Lisandro Zambenedetti Granville, Raouf Boutaba and Scott Shenker, Raouf Boutaba and Lisandro Zambenedetti Granville, Lisandro Zambenedetti Granville 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: François Lemaire, Wei Pan, Bican Xia, Éric Schost, Lingchuan Meng, Jeremy R. Johnson, Liyun Li, Wenyuan Wu, James H. Davenport, Xin Li, Yuzhen Xie, Adrien Poteaux, Xavier Dahan, Marc Moreno Maza\n- Research collaborations between these authors: François Lemaire and Xin Li, François Lemaire and Wei Pan, François Lemaire and Marc Moreno Maza, François Lemaire and James H. Davenport, François Lemaire and Éric Schost, François Lemaire and Bican Xia, François Lemaire and Yuzhen Xie, François Lemaire and Xavier Dahan, Wei Pan and Xin Li, Wei Pan and Marc Moreno Maza, Wei Pan and Éric Schost, Wei Pan and Yuzhen Xie, Wei Pan and Xavier Dahan, Wei Pan and James H. Davenport, Wei Pan and Liyun Li, Wei Pan and Bican Xia, Bican Xia and Marc Moreno Maza, Bican Xia and James H. Davenport, Bican Xia and Wenyuan Wu, Bican Xia and Xin Li, Bican Xia and Éric Schost, Bican Xia and Yuzhen Xie, Bican Xia and Xavier Dahan, Éric Schost and Xin Li, Éric Schost and Marc Moreno Maza, Éric Schost and Jeremy R. Johnson, Éric Schost and Adrien Poteaux, Éric Schost and Wenyuan Wu, Éric Schost and Yuzhen Xie, Éric Schost and Xavier Dahan, Lingchuan Meng and Xin Li, Lingchuan Meng and Marc Moreno Maza, Lingchuan Meng and Jeremy R. Johnson, Lingchuan Meng and Yuzhen Xie, Jeremy R. Johnson and Xin Li, Jeremy R. Johnson and Marc Moreno Maza, Jeremy R. Johnson and Yuzhen Xie, Liyun Li and Marc Moreno Maza, Liyun Li and Yuzhen Xie, Wenyuan Wu and Xin Li, Wenyuan Wu and Marc Moreno Maza, Wenyuan Wu and Adrien Poteaux, Wenyuan Wu and James H. Davenport, Wenyuan Wu and Xavier Dahan, Wenyuan Wu and Yuzhen Xie, James H. Davenport and Marc Moreno Maza, James H. Davenport and Yuzhen Xie, Xin Li and Marc Moreno Maza, Xin Li and Yuzhen Xie, Xin Li and Xavier Dahan, Yuzhen Xie and Marc Moreno Maza, Yuzhen Xie and Adrien Poteaux, Yuzhen Xie and Xavier Dahan, Adrien Poteaux and Marc Moreno Maza, Adrien Poteaux and Xavier Dahan, Xavier Dahan and Marc Moreno Maza.\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\": \"Fran\\u00e7ois Lemaire\", \"id\": 114720}, {\"name\": \"Wei Pan\", \"id\": 3361}, {\"name\": \"Marc Moreno Maza\", \"id\": 12606}, {\"name\": \"\\u00c9ric Schost\", \"id\": 170535}, {\"name\": \"Lingchuan Meng\", \"id\": 96332}, {\"name\": \"Jeremy R. Johnson\", \"id\": 96333}, {\"name\": \"Liyun Li\", \"id\": 73873}, {\"name\": \"Wenyuan Wu\", \"id\": 146163}, {\"name\": \"James H. Davenport\", \"id\": 46549}, {\"name\": \"Xin Li\", \"id\": 2328}, {\"name\": \"Yuzhen Xie\", \"id\": 305337}, {\"name\": \"Adrien Poteaux\", \"id\": 143579}, {\"name\": \"Xavier Dahan\", \"id\": 490972}, {\"name\": \"Bican Xia\", \"id\": 220350}], \"links\": [{\"source\": 114720, \"target\": 2328}, {\"source\": 114720, \"target\": 3361}, {\"source\": 114720, \"target\": 12606}, {\"source\": 114720, \"target\": 46549}, {\"source\": 114720, \"target\": 170535}, {\"source\": 114720, \"target\": 220350}, {\"source\": 114720, \"target\": 305337}, {\"source\": 114720, \"target\": 490972}, {\"source\": 3361, \"target\": 2328}, {\"source\": 3361, \"target\": 12606}, {\"source\": 3361, \"target\": 170535}, {\"source\": 3361, \"target\": 305337}, {\"source\": 3361, \"target\": 490972}, {\"source\": 3361, \"target\": 46549}, {\"source\": 3361, \"target\": 73873}, {\"source\": 3361, \"target\": 220350}, {\"source\": 12606, \"target\": 2328}, {\"source\": 12606, \"target\": 46549}, {\"source\": 12606, \"target\": 96333}, {\"source\": 12606, \"target\": 146163}, {\"source\": 12606, \"target\": 170535}, {\"source\": 12606, \"target\": 220350}, {\"source\": 12606, \"target\": 305337}, {\"source\": 12606, \"target\": 490972}, {\"source\": 12606, \"target\": 73873}, {\"source\": 12606, \"target\": 96332}, {\"source\": 12606, \"target\": 143579}, {\"source\": 170535, \"target\": 2328}, {\"source\": 170535, \"target\": 96333}, {\"source\": 170535, \"target\": 143579}, {\"source\": 170535, \"target\": 146163}, {\"source\": 170535, \"target\": 305337}, {\"source\": 170535, \"target\": 490972}, {\"source\": 170535, \"target\": 220350}, {\"source\": 96332, \"target\": 2328}, {\"source\": 96332, \"target\": 96333}, {\"source\": 96332, \"target\": 305337}, {\"source\": 96333, \"target\": 2328}, {\"source\": 96333, \"target\": 305337}, {\"source\": 73873, \"target\": 305337}, {\"source\": 146163, \"target\": 2328}, {\"source\": 146163, \"target\": 143579}, {\"source\": 146163, \"target\": 46549}, {\"source\": 146163, \"target\": 220350}, {\"source\": 146163, \"target\": 490972}, {\"source\": 146163, \"target\": 305337}, {\"source\": 46549, \"target\": 220350}, {\"source\": 46549, \"target\": 305337}, {\"source\": 2328, \"target\": 305337}, {\"source\": 2328, \"target\": 490972}, {\"source\": 2328, \"target\": 220350}, {\"source\": 305337, \"target\": 143579}, {\"source\": 305337, \"target\": 220350}, {\"source\": 305337, \"target\": 490972}, {\"source\": 143579, \"target\": 490972}, {\"source\": 490972, \"target\": 220350}]}",
"id": 2920,
"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: François Lemaire, Wei Pan, Bican Xia, Éric Schost, Lingchuan Meng, Jeremy R. Johnson, Liyun Li, Wenyuan Wu, James H. Davenport, Xin Li, Yuzhen Xie, Adrien Poteaux, Xavier Dahan, Marc Moreno Maza\n- Research collaborations between these authors: François Lemaire and Xin Li, François Lemaire and Wei Pan, François Lemaire and Marc Moreno Maza, François Lemaire and James H. Davenport, François Lemaire and Éric Schost, François Lemaire and Bican Xia, François Lemaire and Yuzhen Xie, François Lemaire and Xavier Dahan, Wei Pan and Xin Li, Wei Pan and Marc Moreno Maza, Wei Pan and Éric Schost, Wei Pan and Yuzhen Xie, Wei Pan and Xavier Dahan, Wei Pan and James H. Davenport, Wei Pan and Liyun Li, Wei Pan and Bican Xia, Bican Xia and Marc Moreno Maza, Bican Xia and James H. Davenport, Bican Xia and Wenyuan Wu, Bican Xia and Xin Li, Bican Xia and Éric Schost, Bican Xia and Yuzhen Xie, Bican Xia and Xavier Dahan, Éric Schost and Xin Li, Éric Schost and Marc Moreno Maza, Éric Schost and Jeremy R. Johnson, Éric Schost and Adrien Poteaux, Éric Schost and Wenyuan Wu, Éric Schost and Yuzhen Xie, Éric Schost and Xavier Dahan, Lingchuan Meng and Xin Li, Lingchuan Meng and Marc Moreno Maza, Lingchuan Meng and Jeremy R. Johnson, Lingchuan Meng and Yuzhen Xie, Jeremy R. Johnson and Xin Li, Jeremy R. Johnson and Marc Moreno Maza, Jeremy R. Johnson and Yuzhen Xie, Liyun Li and Marc Moreno Maza, Liyun Li and Yuzhen Xie, Wenyuan Wu and Xin Li, Wenyuan Wu and Marc Moreno Maza, Wenyuan Wu and Adrien Poteaux, Wenyuan Wu and James H. Davenport, Wenyuan Wu and Xavier Dahan, Wenyuan Wu and Yuzhen Xie, James H. Davenport and Marc Moreno Maza, James H. Davenport and Yuzhen Xie, Xin Li and Marc Moreno Maza, Xin Li and Yuzhen Xie, Xin Li and Xavier Dahan, Yuzhen Xie and Marc Moreno Maza, Yuzhen Xie and Adrien Poteaux, Yuzhen Xie and Xavier Dahan, Adrien Poteaux and Marc Moreno Maza, Adrien Poteaux and Xavier Dahan, Xavier Dahan and Marc Moreno Maza.\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: Luca Salgarelli, El-Houssine Bouyakhf, Alfonso Iacovazzi, Dhiman Barman, Hyun-chul Kim, Antonio Pescape, Silvio Valenti, Alberto Dainotti, Marco Mellia, Andrew W. Moore, Jun Zhang, Essaid Sabir, Kensuke Fukuda, Rachid El-Azouzi\n- Research collaborations between these authors: Luca Salgarelli and Alfonso Iacovazzi, Luca Salgarelli and Alberto Dainotti, Luca Salgarelli and Antonio Pescape, Luca Salgarelli and Jun Zhang, Luca Salgarelli and Kensuke Fukuda, Luca Salgarelli and Marco Mellia, Luca Salgarelli and Andrew W. Moore, Luca Salgarelli and Dhiman Barman, Luca Salgarelli and Hyun-chul Kim, Luca Salgarelli and Silvio Valenti, El-Houssine Bouyakhf and Rachid El-Azouzi, El-Houssine Bouyakhf and Essaid Sabir, El-Houssine Bouyakhf and Dhiman Barman, Alfonso Iacovazzi and Alberto Dainotti, Alfonso Iacovazzi and Antonio Pescape, Alfonso Iacovazzi and Dhiman Barman, Alfonso Iacovazzi and Hyun-chul Kim, Dhiman Barman and Alberto Dainotti, Dhiman Barman and Antonio Pescape, Dhiman Barman and Jun Zhang, Dhiman Barman and Rachid El-Azouzi, Dhiman Barman and Kensuke Fukuda, Dhiman Barman and Marco Mellia, Dhiman Barman and Essaid Sabir, Dhiman Barman and Andrew W. Moore, Dhiman Barman and Silvio Valenti, Dhiman Barman and Hyun-chul Kim, Hyun-chul Kim and Alberto Dainotti, Hyun-chul Kim and Antonio Pescape, Hyun-chul Kim and Jun Zhang, Hyun-chul Kim and Kensuke Fukuda, Hyun-chul Kim and Marco Mellia, Hyun-chul Kim and Silvio Valenti, Hyun-chul Kim and Andrew W. Moore, Antonio Pescape and Alberto Dainotti, Antonio Pescape and Andrew W. Moore, Antonio Pescape and Marco Mellia, Antonio Pescape and Silvio Valenti, Antonio Pescape and Kensuke Fukuda, Silvio Valenti and Alberto Dainotti, Silvio Valenti and Jun Zhang, Silvio Valenti and Marco Mellia, Silvio Valenti and Andrew W. Moore, Alberto Dainotti and Andrew W. Moore, Alberto Dainotti and Marco Mellia, Alberto Dainotti and Kensuke Fukuda, Marco Mellia and Jun Zhang, Marco Mellia and Andrew W. Moore, Andrew W. Moore and Jun Zhang, Andrew W. Moore and Kensuke Fukuda, Essaid Sabir and Rachid El-Azouzi.\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\": \"Luca Salgarelli\", \"id\": 215942}, {\"name\": \"El-Houssine Bouyakhf\", \"id\": 411080}, {\"name\": \"Alfonso Iacovazzi\", \"id\": 12139}, {\"name\": \"Dhiman Barman\", \"id\": 224428}, {\"name\": \"Hyun-chul Kim\", \"id\": 238381}, {\"name\": \"Antonio Pescape\", \"id\": 12333}, {\"name\": \"Silvio Valenti\", \"id\": 234766}, {\"name\": \"Alberto Dainotti\", \"id\": 12331}, {\"name\": \"Marco Mellia\", \"id\": 128852}, {\"name\": \"Andrew W. Moore\", \"id\": 27703}, {\"name\": \"Jun Zhang\", \"id\": 21593}, {\"name\": \"Essaid Sabir\", \"id\": 137307}, {\"name\": \"Kensuke Fukuda\", \"id\": 67068}, {\"name\": \"Rachid El-Azouzi\", \"id\": 41085}], \"links\": [{\"source\": 215942, \"target\": 12139}, {\"source\": 215942, \"target\": 12331}, {\"source\": 215942, \"target\": 12333}, {\"source\": 215942, \"target\": 21593}, {\"source\": 215942, \"target\": 67068}, {\"source\": 215942, \"target\": 128852}, {\"source\": 215942, \"target\": 27703}, {\"source\": 215942, \"target\": 224428}, {\"source\": 215942, \"target\": 238381}, {\"source\": 215942, \"target\": 234766}, {\"source\": 411080, \"target\": 41085}, {\"source\": 411080, \"target\": 137307}, {\"source\": 411080, \"target\": 224428}, {\"source\": 12139, \"target\": 12331}, {\"source\": 12139, \"target\": 12333}, {\"source\": 12139, \"target\": 224428}, {\"source\": 12139, \"target\": 238381}, {\"source\": 224428, \"target\": 12331}, {\"source\": 224428, \"target\": 12333}, {\"source\": 224428, \"target\": 21593}, {\"source\": 224428, \"target\": 41085}, {\"source\": 224428, \"target\": 67068}, {\"source\": 224428, \"target\": 128852}, {\"source\": 224428, \"target\": 137307}, {\"source\": 224428, \"target\": 27703}, {\"source\": 224428, \"target\": 234766}, {\"source\": 224428, \"target\": 238381}, {\"source\": 238381, \"target\": 12331}, {\"source\": 238381, \"target\": 12333}, {\"source\": 238381, \"target\": 21593}, {\"source\": 238381, \"target\": 67068}, {\"source\": 238381, \"target\": 128852}, {\"source\": 238381, \"target\": 234766}, {\"source\": 238381, \"target\": 27703}, {\"source\": 12333, \"target\": 12331}, {\"source\": 12333, \"target\": 27703}, {\"source\": 12333, \"target\": 128852}, {\"source\": 12333, \"target\": 234766}, {\"source\": 12333, \"target\": 67068}, {\"source\": 234766, \"target\": 12331}, {\"source\": 234766, \"target\": 21593}, {\"source\": 234766, \"target\": 128852}, {\"source\": 234766, \"target\": 27703}, {\"source\": 12331, \"target\": 27703}, {\"source\": 12331, \"target\": 128852}, {\"source\": 12331, \"target\": 67068}, {\"source\": 128852, \"target\": 21593}, {\"source\": 128852, \"target\": 27703}, {\"source\": 27703, \"target\": 21593}, {\"source\": 27703, \"target\": 67068}, {\"source\": 137307, \"target\": 41085}]}",
"id": 2012,
"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: Luca Salgarelli, El-Houssine Bouyakhf, Alfonso Iacovazzi, Dhiman Barman, Hyun-chul Kim, Antonio Pescape, Silvio Valenti, Alberto Dainotti, Marco Mellia, Andrew W. Moore, Jun Zhang, Essaid Sabir, Kensuke Fukuda, Rachid El-Azouzi\n- Research collaborations between these authors: Luca Salgarelli and Alfonso Iacovazzi, Luca Salgarelli and Alberto Dainotti, Luca Salgarelli and Antonio Pescape, Luca Salgarelli and Jun Zhang, Luca Salgarelli and Kensuke Fukuda, Luca Salgarelli and Marco Mellia, Luca Salgarelli and Andrew W. Moore, Luca Salgarelli and Dhiman Barman, Luca Salgarelli and Hyun-chul Kim, Luca Salgarelli and Silvio Valenti, El-Houssine Bouyakhf and Rachid El-Azouzi, El-Houssine Bouyakhf and Essaid Sabir, El-Houssine Bouyakhf and Dhiman Barman, Alfonso Iacovazzi and Alberto Dainotti, Alfonso Iacovazzi and Antonio Pescape, Alfonso Iacovazzi and Dhiman Barman, Alfonso Iacovazzi and Hyun-chul Kim, Dhiman Barman and Alberto Dainotti, Dhiman Barman and Antonio Pescape, Dhiman Barman and Jun Zhang, Dhiman Barman and Rachid El-Azouzi, Dhiman Barman and Kensuke Fukuda, Dhiman Barman and Marco Mellia, Dhiman Barman and Essaid Sabir, Dhiman Barman and Andrew W. Moore, Dhiman Barman and Silvio Valenti, Dhiman Barman and Hyun-chul Kim, Hyun-chul Kim and Alberto Dainotti, Hyun-chul Kim and Antonio Pescape, Hyun-chul Kim and Jun Zhang, Hyun-chul Kim and Kensuke Fukuda, Hyun-chul Kim and Marco Mellia, Hyun-chul Kim and Silvio Valenti, Hyun-chul Kim and Andrew W. Moore, Antonio Pescape and Alberto Dainotti, Antonio Pescape and Andrew W. Moore, Antonio Pescape and Marco Mellia, Antonio Pescape and Silvio Valenti, Antonio Pescape and Kensuke Fukuda, Silvio Valenti and Alberto Dainotti, Silvio Valenti and Jun Zhang, Silvio Valenti and Marco Mellia, Silvio Valenti and Andrew W. Moore, Alberto Dainotti and Andrew W. Moore, Alberto Dainotti and Marco Mellia, Alberto Dainotti and Kensuke Fukuda, Marco Mellia and Jun Zhang, Marco Mellia and Andrew W. Moore, Andrew W. Moore and Jun Zhang, Andrew W. Moore and Kensuke Fukuda, Essaid Sabir and Rachid El-Azouzi.\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: Elena Karahanna, Fred D. Davis, Robert W. Zmud, Manju K. Ahuja, Viswanath Venkatesh, Kwok Kee Wei, Mary Crossan, Massimo Magni, Likoebe M. Maruping, Susan A. Brown, Joseph S. Valacich, Gordon B. Davis, Jon (Sean) Jasperson, Jason Bennett Thatcher\n- Research collaborations between these authors: Elena Karahanna and Massimo Magni, Elena Karahanna and Likoebe M. Maruping, Elena Karahanna and Joseph S. Valacich, Elena Karahanna and Jason Bennett Thatcher, Elena Karahanna and Kwok Kee Wei, Elena Karahanna and Robert W. Zmud, Elena Karahanna and Viswanath Venkatesh, Elena Karahanna and Fred D. Davis, Elena Karahanna and Gordon B. Davis, Elena Karahanna and Susan A. Brown, Fred D. Davis and Massimo Magni, Fred D. Davis and Likoebe M. Maruping, Fred D. Davis and Joseph S. Valacich, Fred D. Davis and Jason Bennett Thatcher, Fred D. Davis and Kwok Kee Wei, Fred D. Davis and Robert W. Zmud, Fred D. Davis and Susan A. Brown, Fred D. Davis and Viswanath Venkatesh, Robert W. Zmud and Massimo Magni, Robert W. Zmud and Likoebe M. Maruping, Robert W. Zmud and Joseph S. Valacich, Robert W. Zmud and Jason Bennett Thatcher, Robert W. Zmud and Kwok Kee Wei, Robert W. Zmud and Viswanath Venkatesh, Robert W. Zmud and Susan A. Brown, Manju K. Ahuja and Massimo Magni, Manju K. Ahuja and Likoebe M. Maruping, Manju K. Ahuja and Jason Bennett Thatcher, Manju K. Ahuja and Viswanath Venkatesh, Viswanath Venkatesh and Massimo Magni, Viswanath Venkatesh and Likoebe M. Maruping, Viswanath Venkatesh and Joseph S. Valacich, Viswanath Venkatesh and Jason Bennett Thatcher, Viswanath Venkatesh and Kwok Kee Wei, Viswanath Venkatesh and Susan A. Brown, Viswanath Venkatesh and Gordon B. Davis, Viswanath Venkatesh and Jon (Sean) Jasperson, Kwok Kee Wei and Massimo Magni, Kwok Kee Wei and Likoebe M. Maruping, Kwok Kee Wei and Joseph S. Valacich, Kwok Kee Wei and Jason Bennett Thatcher, Kwok Kee Wei and Gordon B. Davis, Kwok Kee Wei and Susan A. Brown, Mary Crossan and Massimo Magni, Massimo Magni and Likoebe M. Maruping, Massimo Magni and Joseph S. Valacich, Massimo Magni and Jason Bennett Thatcher, Massimo Magni and Susan A. Brown, Massimo Magni and Gordon B. Davis, Massimo Magni and Jon (Sean) Jasperson, Likoebe M. Maruping and Joseph S. Valacich, Likoebe M. Maruping and Jason Bennett Thatcher, Likoebe M. Maruping and Susan A. Brown, Likoebe M. Maruping and Gordon B. Davis, Likoebe M. Maruping and Jon (Sean) Jasperson, Susan A. Brown and Joseph S. Valacich, Susan A. Brown and Jason Bennett Thatcher, Susan A. Brown and Gordon B. Davis, Susan A. Brown and Jon (Sean) Jasperson, Joseph S. Valacich and Gordon B. Davis, Joseph S. Valacich and Jason Bennett Thatcher, Gordon B. Davis and Jason Bennett Thatcher, Jon (Sean) Jasperson and Jason Bennett Thatcher.\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\": \"Elena Karahanna\", \"id\": 28485}, {\"name\": \"Manju K. Ahuja\", \"id\": 422982}, {\"name\": \"Fred D. Davis\", \"id\": 110438}, {\"name\": \"Robert W. Zmud\", \"id\": 66119}, {\"name\": \"Viswanath Venkatesh\", \"id\": 74763}, {\"name\": \"Kwok Kee Wei\", \"id\": 28623}, {\"name\": \"Mary Crossan\", \"id\": 1003569}, {\"name\": \"Massimo Magni\", \"id\": 13458}, {\"name\": \"Likoebe M. Maruping\", \"id\": 13459}, {\"name\": \"Susan A. Brown\", \"id\": 71957}, {\"name\": \"Joseph S. Valacich\", \"id\": 13878}, {\"name\": \"Gordon B. Davis\", \"id\": 238679}, {\"name\": \"Jon (Sean) Jasperson\", \"id\": 427129}, {\"name\": \"Jason Bennett Thatcher\", \"id\": 16026}], \"links\": [{\"source\": 28485, \"target\": 13458}, {\"source\": 28485, \"target\": 13459}, {\"source\": 28485, \"target\": 13878}, {\"source\": 28485, \"target\": 16026}, {\"source\": 28485, \"target\": 28623}, {\"source\": 28485, \"target\": 66119}, {\"source\": 28485, \"target\": 74763}, {\"source\": 28485, \"target\": 110438}, {\"source\": 28485, \"target\": 238679}, {\"source\": 28485, \"target\": 71957}, {\"source\": 422982, \"target\": 13458}, {\"source\": 422982, \"target\": 13459}, {\"source\": 422982, \"target\": 16026}, {\"source\": 422982, \"target\": 74763}, {\"source\": 110438, \"target\": 13458}, {\"source\": 110438, \"target\": 13459}, {\"source\": 110438, \"target\": 13878}, {\"source\": 110438, \"target\": 16026}, {\"source\": 110438, \"target\": 28623}, {\"source\": 110438, \"target\": 66119}, {\"source\": 110438, \"target\": 71957}, {\"source\": 110438, \"target\": 74763}, {\"source\": 66119, \"target\": 13458}, {\"source\": 66119, \"target\": 13459}, {\"source\": 66119, \"target\": 13878}, {\"source\": 66119, \"target\": 16026}, {\"source\": 66119, \"target\": 28623}, {\"source\": 66119, \"target\": 74763}, {\"source\": 66119, \"target\": 71957}, {\"source\": 74763, \"target\": 13458}, {\"source\": 74763, \"target\": 13459}, {\"source\": 74763, \"target\": 13878}, {\"source\": 74763, \"target\": 16026}, {\"source\": 74763, \"target\": 28623}, {\"source\": 74763, \"target\": 71957}, {\"source\": 74763, \"target\": 238679}, {\"source\": 74763, \"target\": 427129}, {\"source\": 28623, \"target\": 13458}, {\"source\": 28623, \"target\": 13459}, {\"source\": 28623, \"target\": 13878}, {\"source\": 28623, \"target\": 16026}, {\"source\": 28623, \"target\": 238679}, {\"source\": 28623, \"target\": 71957}, {\"source\": 1003569, \"target\": 13458}, {\"source\": 13458, \"target\": 13459}, {\"source\": 13458, \"target\": 13878}, {\"source\": 13458, \"target\": 16026}, {\"source\": 13458, \"target\": 71957}, {\"source\": 13458, \"target\": 238679}, {\"source\": 13458, \"target\": 427129}, {\"source\": 13459, \"target\": 13878}, {\"source\": 13459, \"target\": 16026}, {\"source\": 13459, \"target\": 71957}, {\"source\": 13459, \"target\": 238679}, {\"source\": 13459, \"target\": 427129}, {\"source\": 71957, \"target\": 13878}, {\"source\": 71957, \"target\": 16026}, {\"source\": 71957, \"target\": 238679}, {\"source\": 71957, \"target\": 427129}, {\"source\": 13878, \"target\": 238679}, {\"source\": 13878, \"target\": 16026}, {\"source\": 238679, \"target\": 16026}, {\"source\": 427129, \"target\": 16026}]}",
"id": 1520,
"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: Elena Karahanna, Fred D. Davis, Robert W. Zmud, Manju K. Ahuja, Viswanath Venkatesh, Kwok Kee Wei, Mary Crossan, Massimo Magni, Likoebe M. Maruping, Susan A. Brown, Joseph S. Valacich, Gordon B. Davis, Jon (Sean) Jasperson, Jason Bennett Thatcher\n- Research collaborations between these authors: Elena Karahanna and Massimo Magni, Elena Karahanna and Likoebe M. Maruping, Elena Karahanna and Joseph S. Valacich, Elena Karahanna and Jason Bennett Thatcher, Elena Karahanna and Kwok Kee Wei, Elena Karahanna and Robert W. Zmud, Elena Karahanna and Viswanath Venkatesh, Elena Karahanna and Fred D. Davis, Elena Karahanna and Gordon B. Davis, Elena Karahanna and Susan A. Brown, Fred D. Davis and Massimo Magni, Fred D. Davis and Likoebe M. Maruping, Fred D. Davis and Joseph S. Valacich, Fred D. Davis and Jason Bennett Thatcher, Fred D. Davis and Kwok Kee Wei, Fred D. Davis and Robert W. Zmud, Fred D. Davis and Susan A. Brown, Fred D. Davis and Viswanath Venkatesh, Robert W. Zmud and Massimo Magni, Robert W. Zmud and Likoebe M. Maruping, Robert W. Zmud and Joseph S. Valacich, Robert W. Zmud and Jason Bennett Thatcher, Robert W. Zmud and Kwok Kee Wei, Robert W. Zmud and Viswanath Venkatesh, Robert W. Zmud and Susan A. Brown, Manju K. Ahuja and Massimo Magni, Manju K. Ahuja and Likoebe M. Maruping, Manju K. Ahuja and Jason Bennett Thatcher, Manju K. Ahuja and Viswanath Venkatesh, Viswanath Venkatesh and Massimo Magni, Viswanath Venkatesh and Likoebe M. Maruping, Viswanath Venkatesh and Joseph S. Valacich, Viswanath Venkatesh and Jason Bennett Thatcher, Viswanath Venkatesh and Kwok Kee Wei, Viswanath Venkatesh and Susan A. Brown, Viswanath Venkatesh and Gordon B. Davis, Viswanath Venkatesh and Jon (Sean) Jasperson, Kwok Kee Wei and Massimo Magni, Kwok Kee Wei and Likoebe M. Maruping, Kwok Kee Wei and Joseph S. Valacich, Kwok Kee Wei and Jason Bennett Thatcher, Kwok Kee Wei and Gordon B. Davis, Kwok Kee Wei and Susan A. Brown, Mary Crossan and Massimo Magni, Massimo Magni and Likoebe M. Maruping, Massimo Magni and Joseph S. Valacich, Massimo Magni and Jason Bennett Thatcher, Massimo Magni and Susan A. Brown, Massimo Magni and Gordon B. Davis, Massimo Magni and Jon (Sean) Jasperson, Likoebe M. Maruping and Joseph S. Valacich, Likoebe M. Maruping and Jason Bennett Thatcher, Likoebe M. Maruping and Susan A. Brown, Likoebe M. Maruping and Gordon B. Davis, Likoebe M. Maruping and Jon (Sean) Jasperson, Susan A. Brown and Joseph S. Valacich, Susan A. Brown and Jason Bennett Thatcher, Susan A. Brown and Gordon B. Davis, Susan A. Brown and Jon (Sean) Jasperson, Joseph S. Valacich and Gordon B. Davis, Joseph S. Valacich and Jason Bennett Thatcher, Gordon B. Davis and Jason Bennett Thatcher, Jon (Sean) Jasperson and Jason Bennett Thatcher.\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: Xuefeng Yin, Lu Lu, Weiming Duan, Lin X. Cai, Ruonan Zhang, Xiaofeng Lu, Zhimeng Zhong, Lin Cai, Michael A. Jensen, Jon Crowcroft, Olivier Duchenne, Jon W. Mark, Jianping Zhao, Hyunhee Park\n- Research collaborations between these authors: Xuefeng Yin and Zhimeng Zhong, Xuefeng Yin and Weiming Duan, Lu Lu and Lin Cai, Weiming Duan and Ruonan Zhang, Weiming Duan and Xiaofeng Lu, Weiming Duan and Zhimeng Zhong, Weiming Duan and Lin Cai, Weiming Duan and Jianping Zhao, Lin X. Cai and Ruonan Zhang, Lin X. Cai and Lin Cai, Lin X. Cai and Hyunhee Park, Lin X. Cai and Jon W. Mark, Ruonan Zhang and Xiaofeng Lu, Ruonan Zhang and Lin Cai, Ruonan Zhang and Jon W. Mark, Ruonan Zhang and Michael A. Jensen, Ruonan Zhang and Olivier Duchenne, Ruonan Zhang and Zhimeng Zhong, Ruonan Zhang and Hyunhee Park, Ruonan Zhang and Jianping Zhao, Xiaofeng Lu and Jon Crowcroft, Xiaofeng Lu and Lin Cai, Zhimeng Zhong and Lin Cai, Lin Cai and Jon Crowcroft, Lin Cai and Jon W. Mark, Lin Cai and Michael A. Jensen, Lin Cai and Hyunhee Park, Lin Cai and Jianping Zhao, Jon W. Mark and Hyunhee Park.\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\": \"Xuefeng Yin\", \"id\": 223587}, {\"name\": \"Lu Lu\", \"id\": 38339}, {\"name\": \"Weiming Duan\", \"id\": 591687}, {\"name\": \"Lin X. Cai\", \"id\": 348714}, {\"name\": \"Ruonan Zhang\", \"id\": 71980}, {\"name\": \"Xiaofeng Lu\", \"id\": 71981}, {\"name\": \"Zhimeng Zhong\", \"id\": 71982}, {\"name\": \"Lin Cai\", \"id\": 71983}, {\"name\": \"Michael A. Jensen\", \"id\": 399980}, {\"name\": \"Jon Crowcroft\", \"id\": 4469}, {\"name\": \"Jon W. Mark\", \"id\": 184923}, {\"name\": \"Olivier Duchenne\", \"id\": 503259}, {\"name\": \"Jianping Zhao\", \"id\": 371901}, {\"name\": \"Hyunhee Park\", \"id\": 118751}], \"links\": [{\"source\": 223587, \"target\": 71982}, {\"source\": 223587, \"target\": 591687}, {\"source\": 38339, \"target\": 71983}, {\"source\": 591687, \"target\": 71980}, {\"source\": 591687, \"target\": 71981}, {\"source\": 591687, \"target\": 71982}, {\"source\": 591687, \"target\": 71983}, {\"source\": 591687, \"target\": 371901}, {\"source\": 348714, \"target\": 71980}, {\"source\": 348714, \"target\": 71983}, {\"source\": 348714, \"target\": 118751}, {\"source\": 348714, \"target\": 184923}, {\"source\": 71980, \"target\": 71981}, {\"source\": 71980, \"target\": 71983}, {\"source\": 71980, \"target\": 184923}, {\"source\": 71980, \"target\": 399980}, {\"source\": 71980, \"target\": 503259}, {\"source\": 71980, \"target\": 71982}, {\"source\": 71980, \"target\": 118751}, {\"source\": 71980, \"target\": 371901}, {\"source\": 71981, \"target\": 4469}, {\"source\": 71981, \"target\": 71983}, {\"source\": 71982, \"target\": 71983}, {\"source\": 71983, \"target\": 4469}, {\"source\": 71983, \"target\": 184923}, {\"source\": 71983, \"target\": 399980}, {\"source\": 71983, \"target\": 118751}, {\"source\": 71983, \"target\": 371901}, {\"source\": 184923, \"target\": 118751}]}",
"id": 1488,
"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: Xuefeng Yin, Lu Lu, Weiming Duan, Lin X. Cai, Ruonan Zhang, Xiaofeng Lu, Zhimeng Zhong, Lin Cai, Michael A. Jensen, Jon Crowcroft, Olivier Duchenne, Jon W. Mark, Jianping Zhao, Hyunhee Park\n- Research collaborations between these authors: Xuefeng Yin and Zhimeng Zhong, Xuefeng Yin and Weiming Duan, Lu Lu and Lin Cai, Weiming Duan and Ruonan Zhang, Weiming Duan and Xiaofeng Lu, Weiming Duan and Zhimeng Zhong, Weiming Duan and Lin Cai, Weiming Duan and Jianping Zhao, Lin X. Cai and Ruonan Zhang, Lin X. Cai and Lin Cai, Lin X. Cai and Hyunhee Park, Lin X. Cai and Jon W. Mark, Ruonan Zhang and Xiaofeng Lu, Ruonan Zhang and Lin Cai, Ruonan Zhang and Jon W. Mark, Ruonan Zhang and Michael A. Jensen, Ruonan Zhang and Olivier Duchenne, Ruonan Zhang and Zhimeng Zhong, Ruonan Zhang and Hyunhee Park, Ruonan Zhang and Jianping Zhao, Xiaofeng Lu and Jon Crowcroft, Xiaofeng Lu and Lin Cai, Zhimeng Zhong and Lin Cai, Lin Cai and Jon Crowcroft, Lin Cai and Jon W. Mark, Lin Cai and Michael A. Jensen, Lin Cai and Hyunhee Park, Lin Cai and Jianping Zhao, Jon W. Mark and Hyunhee Park.\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: Anthony J. Yezzi, Ross T. Whitaker, Markus Hadwiger, Szymon Rusinkiewicz, Thomas A. Funkhouser, Michael M. Bronstein, Alexander M. Bronstein, Ron Kimmel, Won-Ki Jeong, P. Thomas Fletcher, Won Ki Jeong, Hanspeter Pfister, Elmar Eisemann, Johanna Beyer\n- Research collaborations between these authors: Anthony J. Yezzi and Michael M. Bronstein, Anthony J. Yezzi and Alexander M. Bronstein, Anthony J. Yezzi and Ross T. Whitaker, Anthony J. Yezzi and Ron Kimmel, Ross T. Whitaker and P. Thomas Fletcher, Ross T. Whitaker and Hanspeter Pfister, Ross T. Whitaker and Won Ki Jeong, Ross T. Whitaker and Szymon Rusinkiewicz, Ross T. Whitaker and Markus Hadwiger, Ross T. Whitaker and Won-Ki Jeong, Ross T. Whitaker and Johanna Beyer, Markus Hadwiger and Hanspeter Pfister, Markus Hadwiger and Elmar Eisemann, Markus Hadwiger and Won-Ki Jeong, Markus Hadwiger and Johanna Beyer, Markus Hadwiger and Won Ki Jeong, Szymon Rusinkiewicz and Michael M. Bronstein, Szymon Rusinkiewicz and Alexander M. Bronstein, Szymon Rusinkiewicz and Ron Kimmel, Szymon Rusinkiewicz and Hanspeter Pfister, Szymon Rusinkiewicz and Thomas A. Funkhouser, Szymon Rusinkiewicz and Elmar Eisemann, Szymon Rusinkiewicz and Won Ki Jeong, Thomas A. Funkhouser and Michael M. Bronstein, Thomas A. Funkhouser and Alexander M. Bronstein, Thomas A. Funkhouser and Ron Kimmel, Thomas A. Funkhouser and Hanspeter Pfister, Thomas A. Funkhouser and Won Ki Jeong, Michael M. Bronstein and Alexander M. Bronstein, Michael M. Bronstein and Ron Kimmel, Michael M. Bronstein and Won Ki Jeong, Alexander M. Bronstein and Ron Kimmel, Alexander M. Bronstein and Won Ki Jeong, Ron Kimmel and Won Ki Jeong, Won-Ki Jeong and Hanspeter Pfister, Won-Ki Jeong and Johanna Beyer, Won-Ki Jeong and Won Ki Jeong, P. Thomas Fletcher and Won Ki Jeong, Won Ki Jeong and Hanspeter Pfister, Won Ki Jeong and Johanna Beyer, Hanspeter Pfister and Elmar Eisemann, Hanspeter Pfister and Johanna Beyer, Elmar Eisemann and Johanna Beyer.\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\": \"Anthony J. Yezzi\", \"id\": 61536}, {\"name\": \"Ross T. Whitaker\", \"id\": 20961}, {\"name\": \"Markus Hadwiger\", \"id\": 108193}, {\"name\": \"Szymon Rusinkiewicz\", \"id\": 23459}, {\"name\": \"Thomas A. Funkhouser\", \"id\": 202405}, {\"name\": \"Michael M. Bronstein\", \"id\": 14022}, {\"name\": \"Alexander M. Bronstein\", \"id\": 14023}, {\"name\": \"Ron Kimmel\", \"id\": 14025}, {\"name\": \"Won-Ki Jeong\", \"id\": 270026}, {\"name\": \"P. Thomas Fletcher\", \"id\": 32173}, {\"name\": \"Won Ki Jeong\", \"id\": 340558}, {\"name\": \"Hanspeter Pfister\", \"id\": 94573}, {\"name\": \"Elmar Eisemann\", \"id\": 186101}, {\"name\": \"Johanna Beyer\", \"id\": 272346}], \"links\": [{\"source\": 61536, \"target\": 14022}, {\"source\": 61536, \"target\": 14023}, {\"source\": 61536, \"target\": 20961}, {\"source\": 61536, \"target\": 14025}, {\"source\": 20961, \"target\": 32173}, {\"source\": 20961, \"target\": 94573}, {\"source\": 20961, \"target\": 340558}, {\"source\": 20961, \"target\": 23459}, {\"source\": 20961, \"target\": 108193}, {\"source\": 20961, \"target\": 270026}, {\"source\": 20961, \"target\": 272346}, {\"source\": 108193, \"target\": 94573}, {\"source\": 108193, \"target\": 186101}, {\"source\": 108193, \"target\": 270026}, {\"source\": 108193, \"target\": 272346}, {\"source\": 108193, \"target\": 340558}, {\"source\": 23459, \"target\": 14022}, {\"source\": 23459, \"target\": 14023}, {\"source\": 23459, \"target\": 14025}, {\"source\": 23459, \"target\": 94573}, {\"source\": 23459, \"target\": 202405}, {\"source\": 23459, \"target\": 186101}, {\"source\": 23459, \"target\": 340558}, {\"source\": 202405, \"target\": 14022}, {\"source\": 202405, \"target\": 14023}, {\"source\": 202405, \"target\": 14025}, {\"source\": 202405, \"target\": 94573}, {\"source\": 202405, \"target\": 340558}, {\"source\": 14022, \"target\": 14023}, {\"source\": 14022, \"target\": 14025}, {\"source\": 14022, \"target\": 340558}, {\"source\": 14023, \"target\": 14025}, {\"source\": 14023, \"target\": 340558}, {\"source\": 14025, \"target\": 340558}, {\"source\": 270026, \"target\": 94573}, {\"source\": 270026, \"target\": 272346}, {\"source\": 270026, \"target\": 340558}, {\"source\": 32173, \"target\": 340558}, {\"source\": 340558, \"target\": 94573}, {\"source\": 340558, \"target\": 272346}, {\"source\": 94573, \"target\": 186101}, {\"source\": 94573, \"target\": 272346}, {\"source\": 186101, \"target\": 272346}]}",
"id": 1949,
"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: Anthony J. Yezzi, Ross T. Whitaker, Markus Hadwiger, Szymon Rusinkiewicz, Thomas A. Funkhouser, Michael M. Bronstein, Alexander M. Bronstein, Ron Kimmel, Won-Ki Jeong, P. Thomas Fletcher, Won Ki Jeong, Hanspeter Pfister, Elmar Eisemann, Johanna Beyer\n- Research collaborations between these authors: Anthony J. Yezzi and Michael M. Bronstein, Anthony J. Yezzi and Alexander M. Bronstein, Anthony J. Yezzi and Ross T. Whitaker, Anthony J. Yezzi and Ron Kimmel, Ross T. Whitaker and P. Thomas Fletcher, Ross T. Whitaker and Hanspeter Pfister, Ross T. Whitaker and Won Ki Jeong, Ross T. Whitaker and Szymon Rusinkiewicz, Ross T. Whitaker and Markus Hadwiger, Ross T. Whitaker and Won-Ki Jeong, Ross T. Whitaker and Johanna Beyer, Markus Hadwiger and Hanspeter Pfister, Markus Hadwiger and Elmar Eisemann, Markus Hadwiger and Won-Ki Jeong, Markus Hadwiger and Johanna Beyer, Markus Hadwiger and Won Ki Jeong, Szymon Rusinkiewicz and Michael M. Bronstein, Szymon Rusinkiewicz and Alexander M. Bronstein, Szymon Rusinkiewicz and Ron Kimmel, Szymon Rusinkiewicz and Hanspeter Pfister, Szymon Rusinkiewicz and Thomas A. Funkhouser, Szymon Rusinkiewicz and Elmar Eisemann, Szymon Rusinkiewicz and Won Ki Jeong, Thomas A. Funkhouser and Michael M. Bronstein, Thomas A. Funkhouser and Alexander M. Bronstein, Thomas A. Funkhouser and Ron Kimmel, Thomas A. Funkhouser and Hanspeter Pfister, Thomas A. Funkhouser and Won Ki Jeong, Michael M. Bronstein and Alexander M. Bronstein, Michael M. Bronstein and Ron Kimmel, Michael M. Bronstein and Won Ki Jeong, Alexander M. Bronstein and Ron Kimmel, Alexander M. Bronstein and Won Ki Jeong, Ron Kimmel and Won Ki Jeong, Won-Ki Jeong and Hanspeter Pfister, Won-Ki Jeong and Johanna Beyer, Won-Ki Jeong and Won Ki Jeong, P. Thomas Fletcher and Won Ki Jeong, Won Ki Jeong and Hanspeter Pfister, Won Ki Jeong and Johanna Beyer, Hanspeter Pfister and Elmar Eisemann, Hanspeter Pfister and Johanna Beyer, Elmar Eisemann and Johanna Beyer.\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: Hans-Joachim Böckenhauer, Ralf Klasing, Richard Královič, Andreas Sprock, Davide Bilò, Juraj Hromkovič, Rastislav Královič, Christian Kudahl, Karin Freiermuth, Alejandro López-Ortiz, Björn Steffen, Walter Unger, Tobias Mömke, M. Grazia Speranza\n- Research collaborations between these authors: Hans-Joachim Böckenhauer and Alejandro López-Ortiz, Hans-Joachim Böckenhauer and Björn Steffen, Hans-Joachim Böckenhauer and Juraj Hromkovič, Hans-Joachim Böckenhauer and Davide Bilò, Hans-Joachim Böckenhauer and Richard Královič, Hans-Joachim Böckenhauer and Ralf Klasing, Hans-Joachim Böckenhauer and Rastislav Královič, Hans-Joachim Böckenhauer and Andreas Sprock, Hans-Joachim Böckenhauer and Tobias Mömke, Hans-Joachim Böckenhauer and Walter Unger, Hans-Joachim Böckenhauer and M. Grazia Speranza, Hans-Joachim Böckenhauer and Christian Kudahl, Hans-Joachim Böckenhauer and Karin Freiermuth, Ralf Klasing and Juraj Hromkovič, Ralf Klasing and Rastislav Královič, Ralf Klasing and Walter Unger, Ralf Klasing and Tobias Mömke, Richard Královič and Alejandro López-Ortiz, Richard Královič and Björn Steffen, Richard Královič and Juraj Hromkovič, Richard Královič and Davide Bilò, Richard Královič and Rastislav Královič, Richard Královič and Tobias Mömke, Richard Královič and Andreas Sprock, Richard Královič and Christian Kudahl, Andreas Sprock and Juraj Hromkovič, Andreas Sprock and Davide Bilò, Andreas Sprock and Tobias Mömke, Andreas Sprock and M. Grazia Speranza, Davide Bilò and Juraj Hromkovič, Davide Bilò and Tobias Mömke, Davide Bilò and M. Grazia Speranza, Juraj Hromkovič and Alejandro López-Ortiz, Juraj Hromkovič and Björn Steffen, Juraj Hromkovič and Rastislav Královič, Juraj Hromkovič and Tobias Mömke, Juraj Hromkovič and Walter Unger, Juraj Hromkovič and M. Grazia Speranza, Juraj Hromkovič and Christian Kudahl, Juraj Hromkovič and Karin Freiermuth, Rastislav Královič and Alejandro López-Ortiz, Rastislav Královič and Björn Steffen, Rastislav Královič and Tobias Mömke, Rastislav Královič and Christian Kudahl, Christian Kudahl and Alejandro López-Ortiz, Christian Kudahl and Tobias Mömke, Karin Freiermuth and Tobias Mömke, Alejandro López-Ortiz and Tobias Mömke, Björn Steffen and Tobias Mömke, Walter Unger and Tobias Mömke, Tobias Mömke and M. Grazia Speranza.\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\": \"Hans-Joachim B\\u00f6ckenhauer\", \"id\": 26501}, {\"name\": \"Ralf Klasing\", \"id\": 32933}, {\"name\": \"Richard Kr\\u00e1lovi\\u010d\", \"id\": 26503}, {\"name\": \"Tobias M\\u00f6mke\", \"id\": 96315}, {\"name\": \"Andreas Sprock\", \"id\": 86987}, {\"name\": \"Davide Bil\\u00f2\", \"id\": 25868}, {\"name\": \"Juraj Hromkovi\\u010d\", \"id\": 22733}, {\"name\": \"Rastislav Kr\\u00e1lovi\\u010d\", \"id\": 63020}, {\"name\": \"Christian Kudahl\", \"id\": 189583}, {\"name\": \"Karin Freiermuth\", \"id\": 344559}, {\"name\": \"Bj\\u00f6rn Steffen\", \"id\": 3245}, {\"name\": \"Walter Unger\", \"id\": 132213}, {\"name\": \"Alejandro L\\u00f3pez-Ortiz\", \"id\": 251}, {\"name\": \"M. Grazia Speranza\", \"id\": 169244}], \"links\": [{\"source\": 26501, \"target\": 251}, {\"source\": 26501, \"target\": 3245}, {\"source\": 26501, \"target\": 22733}, {\"source\": 26501, \"target\": 25868}, {\"source\": 26501, \"target\": 26503}, {\"source\": 26501, \"target\": 32933}, {\"source\": 26501, \"target\": 63020}, {\"source\": 26501, \"target\": 86987}, {\"source\": 26501, \"target\": 96315}, {\"source\": 26501, \"target\": 132213}, {\"source\": 26501, \"target\": 169244}, {\"source\": 26501, \"target\": 189583}, {\"source\": 26501, \"target\": 344559}, {\"source\": 32933, \"target\": 22733}, {\"source\": 32933, \"target\": 63020}, {\"source\": 32933, \"target\": 132213}, {\"source\": 32933, \"target\": 96315}, {\"source\": 26503, \"target\": 251}, {\"source\": 26503, \"target\": 3245}, {\"source\": 26503, \"target\": 22733}, {\"source\": 26503, \"target\": 25868}, {\"source\": 26503, \"target\": 63020}, {\"source\": 26503, \"target\": 96315}, {\"source\": 26503, \"target\": 86987}, {\"source\": 26503, \"target\": 189583}, {\"source\": 96315, \"target\": 251}, {\"source\": 96315, \"target\": 3245}, {\"source\": 96315, \"target\": 22733}, {\"source\": 96315, \"target\": 25868}, {\"source\": 96315, \"target\": 63020}, {\"source\": 96315, \"target\": 86987}, {\"source\": 96315, \"target\": 132213}, {\"source\": 96315, \"target\": 169244}, {\"source\": 96315, \"target\": 189583}, {\"source\": 96315, \"target\": 344559}, {\"source\": 86987, \"target\": 22733}, {\"source\": 86987, \"target\": 25868}, {\"source\": 86987, \"target\": 169244}, {\"source\": 25868, \"target\": 22733}, {\"source\": 25868, \"target\": 169244}, {\"source\": 22733, \"target\": 251}, {\"source\": 22733, \"target\": 3245}, {\"source\": 22733, \"target\": 63020}, {\"source\": 22733, \"target\": 132213}, {\"source\": 22733, \"target\": 169244}, {\"source\": 22733, \"target\": 189583}, {\"source\": 22733, \"target\": 344559}, {\"source\": 63020, \"target\": 251}, {\"source\": 63020, \"target\": 3245}, {\"source\": 63020, \"target\": 189583}, {\"source\": 189583, \"target\": 251}]}",
"id": 2262,
"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: Hans-Joachim Böckenhauer, Ralf Klasing, Richard Královič, Andreas Sprock, Davide Bilò, Juraj Hromkovič, Rastislav Královič, Christian Kudahl, Karin Freiermuth, Alejandro López-Ortiz, Björn Steffen, Walter Unger, Tobias Mömke, M. Grazia Speranza\n- Research collaborations between these authors: Hans-Joachim Böckenhauer and Alejandro López-Ortiz, Hans-Joachim Böckenhauer and Björn Steffen, Hans-Joachim Böckenhauer and Juraj Hromkovič, Hans-Joachim Böckenhauer and Davide Bilò, Hans-Joachim Böckenhauer and Richard Královič, Hans-Joachim Böckenhauer and Ralf Klasing, Hans-Joachim Böckenhauer and Rastislav Královič, Hans-Joachim Böckenhauer and Andreas Sprock, Hans-Joachim Böckenhauer and Tobias Mömke, Hans-Joachim Böckenhauer and Walter Unger, Hans-Joachim Böckenhauer and M. Grazia Speranza, Hans-Joachim Böckenhauer and Christian Kudahl, Hans-Joachim Böckenhauer and Karin Freiermuth, Ralf Klasing and Juraj Hromkovič, Ralf Klasing and Rastislav Královič, Ralf Klasing and Walter Unger, Ralf Klasing and Tobias Mömke, Richard Královič and Alejandro López-Ortiz, Richard Královič and Björn Steffen, Richard Královič and Juraj Hromkovič, Richard Královič and Davide Bilò, Richard Královič and Rastislav Královič, Richard Královič and Tobias Mömke, Richard Královič and Andreas Sprock, Richard Královič and Christian Kudahl, Andreas Sprock and Juraj Hromkovič, Andreas Sprock and Davide Bilò, Andreas Sprock and Tobias Mömke, Andreas Sprock and M. Grazia Speranza, Davide Bilò and Juraj Hromkovič, Davide Bilò and Tobias Mömke, Davide Bilò and M. Grazia Speranza, Juraj Hromkovič and Alejandro López-Ortiz, Juraj Hromkovič and Björn Steffen, Juraj Hromkovič and Rastislav Královič, Juraj Hromkovič and Tobias Mömke, Juraj Hromkovič and Walter Unger, Juraj Hromkovič and M. Grazia Speranza, Juraj Hromkovič and Christian Kudahl, Juraj Hromkovič and Karin Freiermuth, Rastislav Královič and Alejandro López-Ortiz, Rastislav Královič and Björn Steffen, Rastislav Královič and Tobias Mömke, Rastislav Královič and Christian Kudahl, Christian Kudahl and Alejandro López-Ortiz, Christian Kudahl and Tobias Mömke, Karin Freiermuth and Tobias Mömke, Alejandro López-Ortiz and Tobias Mömke, Björn Steffen and Tobias Mömke, Walter Unger and Tobias Mömke, Tobias Mömke and M. Grazia Speranza.\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: Dongyan Zhao, Ali Braytee, Arvind Ganesh, Hong-Jiang Zhang, Leonard Barolli, Wei Liu, Kamel Barkaoui, Heng Wang, Victor Lavrenko, Chun Chen, Margrit Gelautz, Takeo Kanade, Rama Chellappa, Yu Hua\n- Research collaborations between these authors: Ali Braytee and Wei Liu, Arvind Ganesh and Wei Liu, Arvind Ganesh and Rama Chellappa, Arvind Ganesh and Chun Chen, Arvind Ganesh and Hong-Jiang Zhang, Hong-Jiang Zhang and Wei Liu, Hong-Jiang Zhang and Rama Chellappa, Hong-Jiang Zhang and Chun Chen, Hong-Jiang Zhang and Takeo Kanade, Hong-Jiang Zhang and Victor Lavrenko, Wei Liu and Rama Chellappa, Wei Liu and Chun Chen, Wei Liu and Takeo Kanade, Wei Liu and Margrit Gelautz, Wei Liu and Heng Wang, Wei Liu and Victor Lavrenko, Victor Lavrenko and Chun Chen, Margrit Gelautz and Takeo Kanade, Takeo Kanade 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": 4,
"style": "rule"
}
|
{
"exact_answer": 4,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Dongyan Zhao\", \"id\": 22490}, {\"name\": \"Ali Braytee\", \"id\": 1217574}, {\"name\": \"Arvind Ganesh\", \"id\": 222505}, {\"name\": \"Hong-Jiang Zhang\", \"id\": 32362}, {\"name\": \"Takeo Kanade\", \"id\": 14007}, {\"name\": \"Leonard Barolli\", \"id\": 27821}, {\"name\": \"Wei Liu\", \"id\": 238}, {\"name\": \"Kamel Barkaoui\", \"id\": 35312}, {\"name\": \"Victor Lavrenko\", \"id\": 140626}, {\"name\": \"Chun Chen\", \"id\": 7219}, {\"name\": \"Margrit Gelautz\", \"id\": 15862}, {\"name\": \"Heng Wang\", \"id\": 29623}, {\"name\": \"Rama Chellappa\", \"id\": 6938}, {\"name\": \"Yu Hua\", \"id\": 158011}], \"links\": [{\"source\": 1217574, \"target\": 238}, {\"source\": 222505, \"target\": 238}, {\"source\": 222505, \"target\": 6938}, {\"source\": 222505, \"target\": 7219}, {\"source\": 222505, \"target\": 32362}, {\"source\": 32362, \"target\": 238}, {\"source\": 32362, \"target\": 6938}, {\"source\": 32362, \"target\": 7219}, {\"source\": 32362, \"target\": 14007}, {\"source\": 32362, \"target\": 140626}, {\"source\": 14007, \"target\": 238}, {\"source\": 14007, \"target\": 6938}, {\"source\": 14007, \"target\": 15862}, {\"source\": 238, \"target\": 6938}, {\"source\": 238, \"target\": 7219}, {\"source\": 238, \"target\": 15862}, {\"source\": 238, \"target\": 29623}, {\"source\": 238, \"target\": 140626}, {\"source\": 140626, \"target\": 7219}]}",
"id": 1341,
"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: Dongyan Zhao, Ali Braytee, Arvind Ganesh, Hong-Jiang Zhang, Leonard Barolli, Wei Liu, Kamel Barkaoui, Heng Wang, Victor Lavrenko, Chun Chen, Margrit Gelautz, Takeo Kanade, Rama Chellappa, Yu Hua\n- Research collaborations between these authors: Ali Braytee and Wei Liu, Arvind Ganesh and Wei Liu, Arvind Ganesh and Rama Chellappa, Arvind Ganesh and Chun Chen, Arvind Ganesh and Hong-Jiang Zhang, Hong-Jiang Zhang and Wei Liu, Hong-Jiang Zhang and Rama Chellappa, Hong-Jiang Zhang and Chun Chen, Hong-Jiang Zhang and Takeo Kanade, Hong-Jiang Zhang and Victor Lavrenko, Wei Liu and Rama Chellappa, Wei Liu and Chun Chen, Wei Liu and Takeo Kanade, Wei Liu and Margrit Gelautz, Wei Liu and Heng Wang, Wei Liu and Victor Lavrenko, Victor Lavrenko and Chun Chen, Margrit Gelautz and Takeo Kanade, Takeo Kanade 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: Ognjen Arandjelovic, Xiaodong He, Lie Lu, Nicu Sebe, Christos Faloutsos, Xin Zhang, Trang Pham, Svetha Venkatesh, Emmanuel J. Candès, Anil K. Jain, Yu-Fei Ma, Jérémy Patrix, Junfeng Jiang, Brian Kulis\n- Research collaborations between these authors: Ognjen Arandjelovic and Svetha Venkatesh, Ognjen Arandjelovic and Anil K. Jain, Ognjen Arandjelovic and Emmanuel J. Candès, Xiaodong He and Svetha Venkatesh, Lie Lu and Svetha Venkatesh, Lie Lu and Yu-Fei Ma, Lie Lu and Junfeng Jiang, Nicu Sebe and Svetha Venkatesh, Nicu Sebe and Anil K. Jain, Nicu Sebe and Brian Kulis, Christos Faloutsos and Svetha Venkatesh, Christos Faloutsos and Brian Kulis, Xin Zhang and Svetha Venkatesh, Xin Zhang and Anil K. Jain, Xin Zhang and Emmanuel J. Candès, Trang Pham and Svetha Venkatesh, Svetha Venkatesh and Anil K. Jain, Svetha Venkatesh and Emmanuel J. Candès, Svetha Venkatesh and Brian Kulis, Svetha Venkatesh and Jérémy Patrix, Svetha Venkatesh and Junfeng Jiang, Emmanuel J. Candès and Anil K. Jain, Yu-Fei Ma and Junfeng Jiang.\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\": \"Ognjen Arandjelovic\", \"id\": 281190}, {\"name\": \"Lie Lu\", \"id\": 32361}, {\"name\": \"Nicu Sebe\", \"id\": 111371}, {\"name\": \"Christos Faloutsos\", \"id\": 13547}, {\"name\": \"Xin Zhang\", \"id\": 20141}, {\"name\": \"Trang Pham\", \"id\": 1270348}, {\"name\": \"Junfeng Jiang\", \"id\": 309881}, {\"name\": \"Svetha Venkatesh\", \"id\": 6292}, {\"name\": \"Emmanuel J. Cand\\u00e8s\", \"id\": 256756}, {\"name\": \"Anil K. Jain\", \"id\": 28181}, {\"name\": \"Yu-Fei Ma\", \"id\": 226103}, {\"name\": \"J\\u00e9r\\u00e9my Patrix\", \"id\": 74232}, {\"name\": \"Xiaodong He\", \"id\": 36185}, {\"name\": \"Brian Kulis\", \"id\": 310652}], \"links\": [{\"source\": 281190, \"target\": 6292}, {\"source\": 281190, \"target\": 28181}, {\"source\": 281190, \"target\": 256756}, {\"source\": 32361, \"target\": 6292}, {\"source\": 32361, \"target\": 226103}, {\"source\": 32361, \"target\": 309881}, {\"source\": 111371, \"target\": 6292}, {\"source\": 111371, \"target\": 28181}, {\"source\": 111371, \"target\": 310652}, {\"source\": 13547, \"target\": 6292}, {\"source\": 13547, \"target\": 310652}, {\"source\": 20141, \"target\": 6292}, {\"source\": 20141, \"target\": 28181}, {\"source\": 20141, \"target\": 256756}, {\"source\": 1270348, \"target\": 6292}, {\"source\": 309881, \"target\": 6292}, {\"source\": 309881, \"target\": 226103}, {\"source\": 6292, \"target\": 28181}, {\"source\": 6292, \"target\": 36185}, {\"source\": 6292, \"target\": 256756}, {\"source\": 6292, \"target\": 310652}, {\"source\": 6292, \"target\": 74232}, {\"source\": 256756, \"target\": 28181}]}",
"id": 202,
"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: Ognjen Arandjelovic, Xiaodong He, Lie Lu, Nicu Sebe, Christos Faloutsos, Xin Zhang, Trang Pham, Svetha Venkatesh, Emmanuel J. Candès, Anil K. Jain, Yu-Fei Ma, Jérémy Patrix, Junfeng Jiang, Brian Kulis\n- Research collaborations between these authors: Ognjen Arandjelovic and Svetha Venkatesh, Ognjen Arandjelovic and Anil K. Jain, Ognjen Arandjelovic and Emmanuel J. Candès, Xiaodong He and Svetha Venkatesh, Lie Lu and Svetha Venkatesh, Lie Lu and Yu-Fei Ma, Lie Lu and Junfeng Jiang, Nicu Sebe and Svetha Venkatesh, Nicu Sebe and Anil K. Jain, Nicu Sebe and Brian Kulis, Christos Faloutsos and Svetha Venkatesh, Christos Faloutsos and Brian Kulis, Xin Zhang and Svetha Venkatesh, Xin Zhang and Anil K. Jain, Xin Zhang and Emmanuel J. Candès, Trang Pham and Svetha Venkatesh, Svetha Venkatesh and Anil K. Jain, Svetha Venkatesh and Emmanuel J. Candès, Svetha Venkatesh and Brian Kulis, Svetha Venkatesh and Jérémy Patrix, Svetha Venkatesh and Junfeng Jiang, Emmanuel J. Candès and Anil K. Jain, Yu-Fei Ma and Junfeng Jiang.\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: Bjarne Kjær Ersbøll, Robert B. Fisher, Fei Wu, Rasmus Reinhold Paulsen, William V. Stoecker, Hitoshi Iyatomi, Klaus Baggesen Hilger, M. Emre Celebi, Constantine Butakoff, Rasmus Larsen, Christopher J. Taylor, Yueting Zhuang, Sune Darkner, David Delgado Gomez\n- Research collaborations between these authors: Bjarne Kjær Ersbøll and Sune Darkner, Bjarne Kjær Ersbøll and Rasmus Larsen, Bjarne Kjær Ersbøll and Christopher J. Taylor, Bjarne Kjær Ersbøll and David Delgado Gomez, Bjarne Kjær Ersbøll and Yueting Zhuang, Bjarne Kjær Ersbøll and Rasmus Reinhold Paulsen, Bjarne Kjær Ersbøll and Klaus Baggesen Hilger, Bjarne Kjær Ersbøll and Fei Wu, Bjarne Kjær Ersbøll and M. Emre Celebi, Bjarne Kjær Ersbøll and Robert B. Fisher, Bjarne Kjær Ersbøll and Hitoshi Iyatomi, Bjarne Kjær Ersbøll and Constantine Butakoff, Bjarne Kjær Ersbøll and William V. Stoecker, Robert B. Fisher and Rasmus Larsen, Robert B. Fisher and M. Emre Celebi, Robert B. Fisher and Hitoshi Iyatomi, Robert B. Fisher and William V. Stoecker, Fei Wu and Yueting Zhuang, Rasmus Reinhold Paulsen and Sune Darkner, Rasmus Reinhold Paulsen and Rasmus Larsen, Rasmus Reinhold Paulsen and Christopher J. Taylor, Rasmus Reinhold Paulsen and Klaus Baggesen Hilger, William V. Stoecker and M. Emre Celebi, William V. Stoecker and Hitoshi Iyatomi, William V. Stoecker and David Delgado Gomez, Hitoshi Iyatomi and M. Emre Celebi, Hitoshi Iyatomi and Constantine Butakoff, Hitoshi Iyatomi and David Delgado Gomez, Klaus Baggesen Hilger and Rasmus Larsen, Klaus Baggesen Hilger and Christopher J. Taylor, M. Emre Celebi and Constantine Butakoff, M. Emre Celebi and David Delgado Gomez, Constantine Butakoff and Christopher J. Taylor, Rasmus Larsen and Sune Darkner, Rasmus Larsen and Christopher J. Taylor, Christopher J. Taylor and Sune Darkner.\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\": \"Bjarne Kj\\u00e6r Ersb\\u00f8ll\", \"id\": 46913}, {\"name\": \"Fei Wu\", \"id\": 93094}, {\"name\": \"Rasmus Reinhold Paulsen\", \"id\": 79977}, {\"name\": \"William V. Stoecker\", \"id\": 393386}, {\"name\": \"Hitoshi Iyatomi\", \"id\": 119402}, {\"name\": \"Klaus Baggesen Hilger\", \"id\": 79978}, {\"name\": \"M. Emre Celebi\", \"id\": 97289}, {\"name\": \"Constantine Butakoff\", \"id\": 164688}, {\"name\": \"Rasmus Larsen\", \"id\": 31249}, {\"name\": \"Christopher J. Taylor\", \"id\": 25597}, {\"name\": \"Yueting Zhuang\", \"id\": 52088}, {\"name\": \"Sune Darkner\", \"id\": 8477}, {\"name\": \"Robert B. Fisher\", \"id\": 108765}, {\"name\": \"David Delgado Gomez\", \"id\": 330654}], \"links\": [{\"source\": 46913, \"target\": 8477}, {\"source\": 46913, \"target\": 31249}, {\"source\": 46913, \"target\": 25597}, {\"source\": 46913, \"target\": 330654}, {\"source\": 46913, \"target\": 52088}, {\"source\": 46913, \"target\": 79977}, {\"source\": 46913, \"target\": 79978}, {\"source\": 46913, \"target\": 93094}, {\"source\": 46913, \"target\": 97289}, {\"source\": 46913, \"target\": 108765}, {\"source\": 46913, \"target\": 119402}, {\"source\": 46913, \"target\": 164688}, {\"source\": 46913, \"target\": 393386}, {\"source\": 93094, \"target\": 52088}, {\"source\": 79977, \"target\": 8477}, {\"source\": 79977, \"target\": 31249}, {\"source\": 79977, \"target\": 25597}, {\"source\": 79977, \"target\": 79978}, {\"source\": 393386, \"target\": 97289}, {\"source\": 393386, \"target\": 108765}, {\"source\": 393386, \"target\": 119402}, {\"source\": 393386, \"target\": 330654}, {\"source\": 119402, \"target\": 97289}, {\"source\": 119402, \"target\": 108765}, {\"source\": 119402, \"target\": 164688}, {\"source\": 119402, \"target\": 330654}, {\"source\": 79978, \"target\": 31249}, {\"source\": 79978, \"target\": 25597}, {\"source\": 97289, \"target\": 164688}, {\"source\": 97289, \"target\": 330654}, {\"source\": 97289, \"target\": 108765}, {\"source\": 164688, \"target\": 25597}, {\"source\": 31249, \"target\": 8477}, {\"source\": 31249, \"target\": 25597}, {\"source\": 31249, \"target\": 108765}, {\"source\": 25597, \"target\": 8477}]}",
"id": 2009,
"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: Bjarne Kjær Ersbøll, Robert B. Fisher, Fei Wu, Rasmus Reinhold Paulsen, William V. Stoecker, Hitoshi Iyatomi, Klaus Baggesen Hilger, M. Emre Celebi, Constantine Butakoff, Rasmus Larsen, Christopher J. Taylor, Yueting Zhuang, Sune Darkner, David Delgado Gomez\n- Research collaborations between these authors: Bjarne Kjær Ersbøll and Sune Darkner, Bjarne Kjær Ersbøll and Rasmus Larsen, Bjarne Kjær Ersbøll and Christopher J. Taylor, Bjarne Kjær Ersbøll and David Delgado Gomez, Bjarne Kjær Ersbøll and Yueting Zhuang, Bjarne Kjær Ersbøll and Rasmus Reinhold Paulsen, Bjarne Kjær Ersbøll and Klaus Baggesen Hilger, Bjarne Kjær Ersbøll and Fei Wu, Bjarne Kjær Ersbøll and M. Emre Celebi, Bjarne Kjær Ersbøll and Robert B. Fisher, Bjarne Kjær Ersbøll and Hitoshi Iyatomi, Bjarne Kjær Ersbøll and Constantine Butakoff, Bjarne Kjær Ersbøll and William V. Stoecker, Robert B. Fisher and Rasmus Larsen, Robert B. Fisher and M. Emre Celebi, Robert B. Fisher and Hitoshi Iyatomi, Robert B. Fisher and William V. Stoecker, Fei Wu and Yueting Zhuang, Rasmus Reinhold Paulsen and Sune Darkner, Rasmus Reinhold Paulsen and Rasmus Larsen, Rasmus Reinhold Paulsen and Christopher J. Taylor, Rasmus Reinhold Paulsen and Klaus Baggesen Hilger, William V. Stoecker and M. Emre Celebi, William V. Stoecker and Hitoshi Iyatomi, William V. Stoecker and David Delgado Gomez, Hitoshi Iyatomi and M. Emre Celebi, Hitoshi Iyatomi and Constantine Butakoff, Hitoshi Iyatomi and David Delgado Gomez, Klaus Baggesen Hilger and Rasmus Larsen, Klaus Baggesen Hilger and Christopher J. Taylor, M. Emre Celebi and Constantine Butakoff, M. Emre Celebi and David Delgado Gomez, Constantine Butakoff and Christopher J. Taylor, Rasmus Larsen and Sune Darkner, Rasmus Larsen and Christopher J. Taylor, Christopher J. Taylor and Sune Darkner.\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: Rajkumar Buyya, Teemu Koponen, Mohamed Fekih Ahmed, Benjie Chen, Ramesh Govindan, Guy Pujolle, Leandros Tassiulas, Mark Handley, Ghassan O. Karame, Martin Casado, Jennifer Rexford, Guofei Gu, Puneet Sharma, Scott Shenker\n- Research collaborations between these authors: Rajkumar Buyya and Guy Pujolle, Rajkumar Buyya and Scott Shenker, Rajkumar Buyya and Jennifer Rexford, Rajkumar Buyya and Mark Handley, Teemu Koponen and Guy Pujolle, Teemu Koponen and Guofei Gu, Teemu Koponen and Leandros Tassiulas, Teemu Koponen and Ghassan O. Karame, Teemu Koponen and Scott Shenker, Teemu Koponen and Puneet Sharma, Teemu Koponen and Martin Casado, Teemu Koponen and Jennifer Rexford, Teemu Koponen and Mark Handley, Teemu Koponen and Mohamed Fekih Ahmed, Mohamed Fekih Ahmed and Scott Shenker, Mohamed Fekih Ahmed and Martin Casado, Benjie Chen and Guy Pujolle, Benjie Chen and Leandros Tassiulas, Benjie Chen and Scott Shenker, Benjie Chen and Jennifer Rexford, Benjie Chen and Mark Handley, Ramesh Govindan and Leandros Tassiulas, Ramesh Govindan and Scott Shenker, Ramesh Govindan and Puneet Sharma, Ramesh Govindan and Martin Casado, Ramesh Govindan and Jennifer Rexford, Ramesh Govindan and Mark Handley, Guy Pujolle and Scott Shenker, Guy Pujolle and Martin Casado, Guy Pujolle and Jennifer Rexford, Guy Pujolle and Mark Handley, Leandros Tassiulas and Scott Shenker, Leandros Tassiulas and Jennifer Rexford, Mark Handley and Scott Shenker, Mark Handley and Martin Casado, Mark Handley and Jennifer Rexford, Ghassan O. Karame and Scott Shenker, Ghassan O. Karame and Martin Casado, Ghassan O. Karame and Jennifer Rexford, Martin Casado and Guofei Gu, Martin Casado and Scott Shenker, Martin Casado and Puneet Sharma, Martin Casado and Jennifer Rexford, Jennifer Rexford and Guofei Gu, Jennifer Rexford and Scott Shenker, Jennifer Rexford and Puneet Sharma, Guofei Gu and Scott Shenker, Puneet Sharma 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": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Rajkumar Buyya\", \"id\": 7042}, {\"name\": \"Teemu Koponen\", \"id\": 56291}, {\"name\": \"Mohamed Fekih Ahmed\", \"id\": 260390}, {\"name\": \"Ramesh Govindan\", \"id\": 52940}, {\"name\": \"Guy Pujolle\", \"id\": 4557}, {\"name\": \"Leandros Tassiulas\", \"id\": 14606}, {\"name\": \"Mark Handley\", \"id\": 225425}, {\"name\": \"Ghassan O. Karame\", \"id\": 23922}, {\"name\": \"Martin Casado\", \"id\": 83797}, {\"name\": \"Jennifer Rexford\", \"id\": 131285}, {\"name\": \"Guofei Gu\", \"id\": 9467}, {\"name\": \"Puneet Sharma\", \"id\": 52124}, {\"name\": \"Benjie Chen\", \"id\": 107325}, {\"name\": \"Scott Shenker\", \"id\": 32157}], \"links\": [{\"source\": 7042, \"target\": 4557}, {\"source\": 7042, \"target\": 32157}, {\"source\": 7042, \"target\": 131285}, {\"source\": 7042, \"target\": 225425}, {\"source\": 56291, \"target\": 4557}, {\"source\": 56291, \"target\": 9467}, {\"source\": 56291, \"target\": 14606}, {\"source\": 56291, \"target\": 23922}, {\"source\": 56291, \"target\": 32157}, {\"source\": 56291, \"target\": 52124}, {\"source\": 56291, \"target\": 83797}, {\"source\": 56291, \"target\": 131285}, {\"source\": 56291, \"target\": 225425}, {\"source\": 56291, \"target\": 260390}, {\"source\": 260390, \"target\": 32157}, {\"source\": 260390, \"target\": 83797}, {\"source\": 52940, \"target\": 14606}, {\"source\": 52940, \"target\": 32157}, {\"source\": 52940, \"target\": 52124}, {\"source\": 52940, \"target\": 83797}, {\"source\": 52940, \"target\": 131285}, {\"source\": 52940, \"target\": 225425}, {\"source\": 4557, \"target\": 32157}, {\"source\": 4557, \"target\": 83797}, {\"source\": 4557, \"target\": 107325}, {\"source\": 4557, \"target\": 131285}, {\"source\": 4557, \"target\": 225425}, {\"source\": 14606, \"target\": 32157}, {\"source\": 14606, \"target\": 107325}, {\"source\": 14606, \"target\": 131285}, {\"source\": 225425, \"target\": 32157}, {\"source\": 225425, \"target\": 83797}, {\"source\": 225425, \"target\": 131285}, {\"source\": 225425, \"target\": 107325}, {\"source\": 23922, \"target\": 32157}, {\"source\": 23922, \"target\": 83797}, {\"source\": 23922, \"target\": 131285}, {\"source\": 83797, \"target\": 9467}, {\"source\": 83797, \"target\": 32157}, {\"source\": 83797, \"target\": 52124}, {\"source\": 83797, \"target\": 131285}, {\"source\": 131285, \"target\": 9467}, {\"source\": 131285, \"target\": 32157}, {\"source\": 131285, \"target\": 52124}, {\"source\": 131285, \"target\": 107325}, {\"source\": 9467, \"target\": 32157}, {\"source\": 52124, \"target\": 32157}, {\"source\": 107325, \"target\": 32157}]}",
"id": 1260,
"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: Rajkumar Buyya, Teemu Koponen, Mohamed Fekih Ahmed, Benjie Chen, Ramesh Govindan, Guy Pujolle, Leandros Tassiulas, Mark Handley, Ghassan O. Karame, Martin Casado, Jennifer Rexford, Guofei Gu, Puneet Sharma, Scott Shenker\n- Research collaborations between these authors: Rajkumar Buyya and Guy Pujolle, Rajkumar Buyya and Scott Shenker, Rajkumar Buyya and Jennifer Rexford, Rajkumar Buyya and Mark Handley, Teemu Koponen and Guy Pujolle, Teemu Koponen and Guofei Gu, Teemu Koponen and Leandros Tassiulas, Teemu Koponen and Ghassan O. Karame, Teemu Koponen and Scott Shenker, Teemu Koponen and Puneet Sharma, Teemu Koponen and Martin Casado, Teemu Koponen and Jennifer Rexford, Teemu Koponen and Mark Handley, Teemu Koponen and Mohamed Fekih Ahmed, Mohamed Fekih Ahmed and Scott Shenker, Mohamed Fekih Ahmed and Martin Casado, Benjie Chen and Guy Pujolle, Benjie Chen and Leandros Tassiulas, Benjie Chen and Scott Shenker, Benjie Chen and Jennifer Rexford, Benjie Chen and Mark Handley, Ramesh Govindan and Leandros Tassiulas, Ramesh Govindan and Scott Shenker, Ramesh Govindan and Puneet Sharma, Ramesh Govindan and Martin Casado, Ramesh Govindan and Jennifer Rexford, Ramesh Govindan and Mark Handley, Guy Pujolle and Scott Shenker, Guy Pujolle and Martin Casado, Guy Pujolle and Jennifer Rexford, Guy Pujolle and Mark Handley, Leandros Tassiulas and Scott Shenker, Leandros Tassiulas and Jennifer Rexford, Mark Handley and Scott Shenker, Mark Handley and Martin Casado, Mark Handley and Jennifer Rexford, Ghassan O. Karame and Scott Shenker, Ghassan O. Karame and Martin Casado, Ghassan O. Karame and Jennifer Rexford, Martin Casado and Guofei Gu, Martin Casado and Scott Shenker, Martin Casado and Puneet Sharma, Martin Casado and Jennifer Rexford, Jennifer Rexford and Guofei Gu, Jennifer Rexford and Scott Shenker, Jennifer Rexford and Puneet Sharma, Guofei Gu and Scott Shenker, Puneet Sharma 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": 835,
"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: Daan G. E. Hobbelen, Mark W. Spong, A.S. Morse, Srdjan S. Stankovic, Xuebo Chen, Jie Zhao, Ulrik Pagh Schultz, Xue-Bo Chen, Zack J. Butler, Daniela Rus, Fumihiko Asano, Wang-bao Xu, Randal W. Beard, Thomas Parisini\n- Research collaborations between these authors: Daan G. E. Hobbelen and Jie Zhao, Daan G. E. Hobbelen and Fumihiko Asano, Mark W. Spong and Daniela Rus, Mark W. Spong and Jie Zhao, Mark W. Spong and Randal W. Beard, Mark W. Spong and Fumihiko Asano, Mark W. Spong and A.S. Morse, A.S. Morse and Daniela Rus, A.S. Morse and Srdjan S. Stankovic, Srdjan S. Stankovic and Xuebo Chen, Srdjan S. Stankovic and Thomas Parisini, Srdjan S. Stankovic and Randal W. Beard, Srdjan S. Stankovic and Xue-Bo Chen, Xuebo Chen and Wang-bao Xu, Xuebo Chen and Xue-Bo Chen, Jie Zhao and Zack J. Butler, Jie Zhao and Daniela Rus, Jie Zhao and Wang-bao Xu, Jie Zhao and Ulrik Pagh Schultz, Jie Zhao and Fumihiko Asano, Ulrik Pagh Schultz and Zack J. Butler, Ulrik Pagh Schultz and Daniela Rus, Zack J. Butler and Daniela Rus.\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 W. Spong\", \"id\": 161637}, {\"name\": \"A.S. Morse\", \"id\": 444422}, {\"name\": \"Srdjan S. Stankovic\", \"id\": 207916}, {\"name\": \"Xuebo Chen\", \"id\": 3917}, {\"name\": \"Thomas Parisini\", \"id\": 181887}, {\"name\": \"Jie Zhao\", \"id\": 20688}, {\"name\": \"Ulrik Pagh Schultz\", \"id\": 160081}, {\"name\": \"Xue-Bo Chen\", \"id\": 923475}, {\"name\": \"Zack J. Butler\", \"id\": 18836}, {\"name\": \"Daniela Rus\", \"id\": 18837}, {\"name\": \"Fumihiko Asano\", \"id\": 317524}, {\"name\": \"Wang-bao Xu\", \"id\": 86105}, {\"name\": \"Randal W. Beard\", \"id\": 295833}, {\"name\": \"Daan G. E. Hobbelen\", \"id\": 638143}], \"links\": [{\"source\": 161637, \"target\": 18837}, {\"source\": 161637, \"target\": 20688}, {\"source\": 161637, \"target\": 295833}, {\"source\": 161637, \"target\": 317524}, {\"source\": 161637, \"target\": 444422}, {\"source\": 444422, \"target\": 18837}, {\"source\": 444422, \"target\": 207916}, {\"source\": 207916, \"target\": 3917}, {\"source\": 207916, \"target\": 181887}, {\"source\": 207916, \"target\": 295833}, {\"source\": 207916, \"target\": 923475}, {\"source\": 3917, \"target\": 86105}, {\"source\": 3917, \"target\": 923475}, {\"source\": 20688, \"target\": 18836}, {\"source\": 20688, \"target\": 18837}, {\"source\": 20688, \"target\": 86105}, {\"source\": 20688, \"target\": 160081}, {\"source\": 20688, \"target\": 317524}, {\"source\": 20688, \"target\": 638143}, {\"source\": 160081, \"target\": 18836}, {\"source\": 160081, \"target\": 18837}, {\"source\": 18836, \"target\": 18837}, {\"source\": 317524, \"target\": 638143}]}",
"id": 572,
"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: Daan G. E. Hobbelen, Mark W. Spong, A.S. Morse, Srdjan S. Stankovic, Xuebo Chen, Jie Zhao, Ulrik Pagh Schultz, Xue-Bo Chen, Zack J. Butler, Daniela Rus, Fumihiko Asano, Wang-bao Xu, Randal W. Beard, Thomas Parisini\n- Research collaborations between these authors: Daan G. E. Hobbelen and Jie Zhao, Daan G. E. Hobbelen and Fumihiko Asano, Mark W. Spong and Daniela Rus, Mark W. Spong and Jie Zhao, Mark W. Spong and Randal W. Beard, Mark W. Spong and Fumihiko Asano, Mark W. Spong and A.S. Morse, A.S. Morse and Daniela Rus, A.S. Morse and Srdjan S. Stankovic, Srdjan S. Stankovic and Xuebo Chen, Srdjan S. Stankovic and Thomas Parisini, Srdjan S. Stankovic and Randal W. Beard, Srdjan S. Stankovic and Xue-Bo Chen, Xuebo Chen and Wang-bao Xu, Xuebo Chen and Xue-Bo Chen, Jie Zhao and Zack J. Butler, Jie Zhao and Daniela Rus, Jie Zhao and Wang-bao Xu, Jie Zhao and Ulrik Pagh Schultz, Jie Zhao and Fumihiko Asano, Ulrik Pagh Schultz and Zack J. Butler, Ulrik Pagh Schultz and Daniela Rus, Zack J. Butler and Daniela Rus.\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 Hornegger, Thomas Kilgus, Alfred M. Franz, Eric Heim, Erhardt Barth, Stefanie Speidel, T. R. dos Santos, Adrien Bartoli, Michael Müller, Alexander Seitel, Ivo Wolf, Heinz Peter Schlemmer, Lena Maier-Hein, Jakob Wasza\n- Research collaborations between these authors: Joachim Hornegger and Jakob Wasza, Joachim Hornegger and Ivo Wolf, Joachim Hornegger and Erhardt Barth, Joachim Hornegger and Adrien Bartoli, Joachim Hornegger and Alexander Seitel, Joachim Hornegger and Lena Maier-Hein, Joachim Hornegger and Alfred M. Franz, Joachim Hornegger and Thomas Kilgus, Joachim Hornegger and T. R. dos Santos, Joachim Hornegger and Stefanie Speidel, Joachim Hornegger and Heinz Peter Schlemmer, Thomas Kilgus and Jakob Wasza, Thomas Kilgus and Michael Müller, Thomas Kilgus and Alexander Seitel, Thomas Kilgus and Lena Maier-Hein, Thomas Kilgus and Stefanie Speidel, Thomas Kilgus and Alfred M. Franz, Thomas Kilgus and Heinz Peter Schlemmer, Thomas Kilgus and Ivo Wolf, Thomas Kilgus and Erhardt Barth, Thomas Kilgus and Adrien Bartoli, Thomas Kilgus and T. R. dos Santos, Thomas Kilgus and Eric Heim, Alfred M. Franz and Ivo Wolf, Alfred M. Franz and Jakob Wasza, Alfred M. Franz and Michael Müller, Alfred M. Franz and Alexander Seitel, Alfred M. Franz and Lena Maier-Hein, Alfred M. Franz and Stefanie Speidel, Alfred M. Franz and Erhardt Barth, Alfred M. Franz and Heinz Peter Schlemmer, Alfred M. Franz and T. R. dos Santos, Alfred M. Franz and Eric Heim, Eric Heim and Lena Maier-Hein, Eric Heim and Alexander Seitel, Eric Heim and Stefanie Speidel, Eric Heim and T. R. dos Santos, Erhardt Barth and Jakob Wasza, Erhardt Barth and Alexander Seitel, Erhardt Barth and Lena Maier-Hein, Stefanie Speidel and Alexander Seitel, Stefanie Speidel and Lena Maier-Hein, Stefanie Speidel and Ivo Wolf, Stefanie Speidel and Adrien Bartoli, Stefanie Speidel and Heinz Peter Schlemmer, Stefanie Speidel and T. R. dos Santos, T. R. dos Santos and Jakob Wasza, T. R. dos Santos and Adrien Bartoli, T. R. dos Santos and Michael Müller, T. R. dos Santos and Alexander Seitel, T. R. dos Santos and Lena Maier-Hein, T. R. dos Santos and Heinz Peter Schlemmer, Adrien Bartoli and Lena Maier-Hein, Adrien Bartoli and Alexander Seitel, Adrien Bartoli and Heinz Peter Schlemmer, Michael Müller and Ivo Wolf, Michael Müller and Alexander Seitel, Michael Müller and Lena Maier-Hein, Michael Müller and Heinz Peter Schlemmer, Alexander Seitel and Ivo Wolf, Alexander Seitel and Jakob Wasza, Alexander Seitel and Lena Maier-Hein, Alexander Seitel and Heinz Peter Schlemmer, Ivo Wolf and Lena Maier-Hein, Ivo Wolf and Heinz Peter Schlemmer, Heinz Peter Schlemmer and Lena Maier-Hein, Lena Maier-Hein and Jakob Wasza.\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\": \"Joachim Hornegger\", \"id\": 1409}, {\"name\": \"Thomas Kilgus\", \"id\": 66759}, {\"name\": \"Lena Maier-Hein\", \"id\": 14395}, {\"name\": \"Eric Heim\", \"id\": 129231}, {\"name\": \"Erhardt Barth\", \"id\": 6544}, {\"name\": \"Stefanie Speidel\", \"id\": 34640}, {\"name\": \"T. R. dos Santos\", \"id\": 473775}, {\"name\": \"Adrien Bartoli\", \"id\": 7827}, {\"name\": \"Michael M\\u00fcller\", \"id\": 14389}, {\"name\": \"Alexander Seitel\", \"id\": 14390}, {\"name\": \"Alfred M. Franz\", \"id\": 53591}, {\"name\": \"Heinz Peter Schlemmer\", \"id\": 61562}, {\"name\": \"Ivo Wolf\", \"id\": 443}, {\"name\": \"Jakob Wasza\", \"id\": 1406}], \"links\": [{\"source\": 1409, \"target\": 1406}, {\"source\": 1409, \"target\": 443}, {\"source\": 1409, \"target\": 6544}, {\"source\": 1409, \"target\": 7827}, {\"source\": 1409, \"target\": 14390}, {\"source\": 1409, \"target\": 14395}, {\"source\": 1409, \"target\": 53591}, {\"source\": 1409, \"target\": 66759}, {\"source\": 1409, \"target\": 473775}, {\"source\": 1409, \"target\": 34640}, {\"source\": 1409, \"target\": 61562}, {\"source\": 66759, \"target\": 1406}, {\"source\": 66759, \"target\": 14389}, {\"source\": 66759, \"target\": 14390}, {\"source\": 66759, \"target\": 14395}, {\"source\": 66759, \"target\": 34640}, {\"source\": 66759, \"target\": 53591}, {\"source\": 66759, \"target\": 61562}, {\"source\": 66759, \"target\": 443}, {\"source\": 66759, \"target\": 6544}, {\"source\": 66759, \"target\": 7827}, {\"source\": 66759, \"target\": 473775}, {\"source\": 66759, \"target\": 129231}, {\"source\": 14395, \"target\": 443}, {\"source\": 14395, \"target\": 1406}, {\"source\": 14395, \"target\": 7827}, {\"source\": 14395, \"target\": 14389}, {\"source\": 14395, \"target\": 14390}, {\"source\": 14395, \"target\": 6544}, {\"source\": 14395, \"target\": 34640}, {\"source\": 14395, \"target\": 53591}, {\"source\": 14395, \"target\": 61562}, {\"source\": 14395, \"target\": 129231}, {\"source\": 14395, \"target\": 473775}, {\"source\": 129231, \"target\": 14390}, {\"source\": 129231, \"target\": 34640}, {\"source\": 129231, \"target\": 53591}, {\"source\": 129231, \"target\": 473775}, {\"source\": 6544, \"target\": 1406}, {\"source\": 6544, \"target\": 14390}, {\"source\": 6544, \"target\": 53591}, {\"source\": 34640, \"target\": 14390}, {\"source\": 34640, \"target\": 443}, {\"source\": 34640, \"target\": 7827}, {\"source\": 34640, \"target\": 53591}, {\"source\": 34640, \"target\": 61562}, {\"source\": 34640, \"target\": 473775}, {\"source\": 473775, \"target\": 1406}, {\"source\": 473775, \"target\": 7827}, {\"source\": 473775, \"target\": 14389}, {\"source\": 473775, \"target\": 14390}, {\"source\": 473775, \"target\": 53591}, {\"source\": 473775, \"target\": 61562}, {\"source\": 7827, \"target\": 14390}, {\"source\": 7827, \"target\": 61562}, {\"source\": 14389, \"target\": 443}, {\"source\": 14389, \"target\": 14390}, {\"source\": 14389, \"target\": 53591}, {\"source\": 14389, \"target\": 61562}, {\"source\": 14390, \"target\": 443}, {\"source\": 14390, \"target\": 1406}, {\"source\": 14390, \"target\": 53591}, {\"source\": 14390, \"target\": 61562}, {\"source\": 53591, \"target\": 443}, {\"source\": 53591, \"target\": 1406}, {\"source\": 53591, \"target\": 61562}, {\"source\": 61562, \"target\": 443}]}",
"id": 67,
"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 Hornegger, Thomas Kilgus, Alfred M. Franz, Eric Heim, Erhardt Barth, Stefanie Speidel, T. R. dos Santos, Adrien Bartoli, Michael Müller, Alexander Seitel, Ivo Wolf, Heinz Peter Schlemmer, Lena Maier-Hein, Jakob Wasza\n- Research collaborations between these authors: Joachim Hornegger and Jakob Wasza, Joachim Hornegger and Ivo Wolf, Joachim Hornegger and Erhardt Barth, Joachim Hornegger and Adrien Bartoli, Joachim Hornegger and Alexander Seitel, Joachim Hornegger and Lena Maier-Hein, Joachim Hornegger and Alfred M. Franz, Joachim Hornegger and Thomas Kilgus, Joachim Hornegger and T. R. dos Santos, Joachim Hornegger and Stefanie Speidel, Joachim Hornegger and Heinz Peter Schlemmer, Thomas Kilgus and Jakob Wasza, Thomas Kilgus and Michael Müller, Thomas Kilgus and Alexander Seitel, Thomas Kilgus and Lena Maier-Hein, Thomas Kilgus and Stefanie Speidel, Thomas Kilgus and Alfred M. Franz, Thomas Kilgus and Heinz Peter Schlemmer, Thomas Kilgus and Ivo Wolf, Thomas Kilgus and Erhardt Barth, Thomas Kilgus and Adrien Bartoli, Thomas Kilgus and T. R. dos Santos, Thomas Kilgus and Eric Heim, Alfred M. Franz and Ivo Wolf, Alfred M. Franz and Jakob Wasza, Alfred M. Franz and Michael Müller, Alfred M. Franz and Alexander Seitel, Alfred M. Franz and Lena Maier-Hein, Alfred M. Franz and Stefanie Speidel, Alfred M. Franz and Erhardt Barth, Alfred M. Franz and Heinz Peter Schlemmer, Alfred M. Franz and T. R. dos Santos, Alfred M. Franz and Eric Heim, Eric Heim and Lena Maier-Hein, Eric Heim and Alexander Seitel, Eric Heim and Stefanie Speidel, Eric Heim and T. R. dos Santos, Erhardt Barth and Jakob Wasza, Erhardt Barth and Alexander Seitel, Erhardt Barth and Lena Maier-Hein, Stefanie Speidel and Alexander Seitel, Stefanie Speidel and Lena Maier-Hein, Stefanie Speidel and Ivo Wolf, Stefanie Speidel and Adrien Bartoli, Stefanie Speidel and Heinz Peter Schlemmer, Stefanie Speidel and T. R. dos Santos, T. R. dos Santos and Jakob Wasza, T. R. dos Santos and Adrien Bartoli, T. R. dos Santos and Michael Müller, T. R. dos Santos and Alexander Seitel, T. R. dos Santos and Lena Maier-Hein, T. R. dos Santos and Heinz Peter Schlemmer, Adrien Bartoli and Lena Maier-Hein, Adrien Bartoli and Alexander Seitel, Adrien Bartoli and Heinz Peter Schlemmer, Michael Müller and Ivo Wolf, Michael Müller and Alexander Seitel, Michael Müller and Lena Maier-Hein, Michael Müller and Heinz Peter Schlemmer, Alexander Seitel and Ivo Wolf, Alexander Seitel and Jakob Wasza, Alexander Seitel and Lena Maier-Hein, Alexander Seitel and Heinz Peter Schlemmer, Ivo Wolf and Lena Maier-Hein, Ivo Wolf and Heinz Peter Schlemmer, Heinz Peter Schlemmer and Lena Maier-Hein, Lena Maier-Hein and Jakob Wasza.\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: Pablo Cesar, Raktim Mitra, Natalya Fridman Noy, Viswanath Venkatesh, Abigail Sellen, Gillian R. Hayes, Sergio Alonso, Yulin Fang, Jon M. Kleinberg, Aniket Kittur, Markus Strohmaier, Munmun De Choudhury, Robert E. Kraut, Nazanin Andalibi\n- Research collaborations between these authors: Pablo Cesar and Abigail Sellen, Pablo Cesar and Robert E. Kraut, Raktim Mitra and Robert E. Kraut, Natalya Fridman Noy and Markus Strohmaier, Natalya Fridman Noy and Robert E. Kraut, Natalya Fridman Noy and Aniket Kittur, Viswanath Venkatesh and Yulin Fang, Viswanath Venkatesh and Robert E. Kraut, Abigail Sellen and Gillian R. Hayes, Gillian R. Hayes and Robert E. Kraut, Gillian R. Hayes and Nazanin Andalibi, Sergio Alonso and Robert E. Kraut, Yulin Fang and Robert E. Kraut, Jon M. Kleinberg and Munmun De Choudhury, Jon M. Kleinberg and Markus Strohmaier, Jon M. Kleinberg and Robert E. Kraut, Jon M. Kleinberg and Aniket Kittur, Aniket Kittur and Markus Strohmaier, Aniket Kittur and Robert E. Kraut, Aniket Kittur and Nazanin Andalibi, Markus Strohmaier and Robert E. Kraut, Munmun De Choudhury and Robert E. Kraut, Munmun De Choudhury and Nazanin Andalibi, Robert E. Kraut and Nazanin Andalibi.\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\": \"Pablo Cesar\", \"id\": 128098}, {\"name\": \"Raktim Mitra\", \"id\": 512548}, {\"name\": \"Natalya Fridman Noy\", \"id\": 1609}, {\"name\": \"Viswanath Venkatesh\", \"id\": 74763}, {\"name\": \"Abigail Sellen\", \"id\": 57868}, {\"name\": \"Gillian R. Hayes\", \"id\": 72875}, {\"name\": \"Sergio Alonso\", \"id\": 17680}, {\"name\": \"Yulin Fang\", \"id\": 13680}, {\"name\": \"Jon M. Kleinberg\", \"id\": 31632}, {\"name\": \"Aniket Kittur\", \"id\": 488336}, {\"name\": \"Markus Strohmaier\", \"id\": 21717}, {\"name\": \"Munmun De Choudhury\", \"id\": 3702}, {\"name\": \"Robert E. Kraut\", \"id\": 121238}, {\"name\": \"Nazanin Andalibi\", \"id\": 652665}], \"links\": [{\"source\": 128098, \"target\": 57868}, {\"source\": 128098, \"target\": 121238}, {\"source\": 512548, \"target\": 121238}, {\"source\": 1609, \"target\": 21717}, {\"source\": 1609, \"target\": 121238}, {\"source\": 1609, \"target\": 488336}, {\"source\": 74763, \"target\": 13680}, {\"source\": 74763, \"target\": 121238}, {\"source\": 57868, \"target\": 72875}, {\"source\": 72875, \"target\": 121238}, {\"source\": 72875, \"target\": 652665}, {\"source\": 17680, \"target\": 121238}, {\"source\": 13680, \"target\": 121238}, {\"source\": 31632, \"target\": 3702}, {\"source\": 31632, \"target\": 21717}, {\"source\": 31632, \"target\": 121238}, {\"source\": 31632, \"target\": 488336}, {\"source\": 488336, \"target\": 21717}, {\"source\": 488336, \"target\": 121238}, {\"source\": 488336, \"target\": 652665}, {\"source\": 21717, \"target\": 121238}, {\"source\": 3702, \"target\": 121238}, {\"source\": 3702, \"target\": 652665}, {\"source\": 121238, \"target\": 652665}]}",
"id": 1847,
"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: Pablo Cesar, Raktim Mitra, Natalya Fridman Noy, Viswanath Venkatesh, Abigail Sellen, Gillian R. Hayes, Sergio Alonso, Yulin Fang, Jon M. Kleinberg, Aniket Kittur, Markus Strohmaier, Munmun De Choudhury, Robert E. Kraut, Nazanin Andalibi\n- Research collaborations between these authors: Pablo Cesar and Abigail Sellen, Pablo Cesar and Robert E. Kraut, Raktim Mitra and Robert E. Kraut, Natalya Fridman Noy and Markus Strohmaier, Natalya Fridman Noy and Robert E. Kraut, Natalya Fridman Noy and Aniket Kittur, Viswanath Venkatesh and Yulin Fang, Viswanath Venkatesh and Robert E. Kraut, Abigail Sellen and Gillian R. Hayes, Gillian R. Hayes and Robert E. Kraut, Gillian R. Hayes and Nazanin Andalibi, Sergio Alonso and Robert E. Kraut, Yulin Fang and Robert E. Kraut, Jon M. Kleinberg and Munmun De Choudhury, Jon M. Kleinberg and Markus Strohmaier, Jon M. Kleinberg and Robert E. Kraut, Jon M. Kleinberg and Aniket Kittur, Aniket Kittur and Markus Strohmaier, Aniket Kittur and Robert E. Kraut, Aniket Kittur and Nazanin Andalibi, Markus Strohmaier and Robert E. Kraut, Munmun De Choudhury and Robert E. Kraut, Munmun De Choudhury and Nazanin Andalibi, Robert E. Kraut and Nazanin Andalibi.\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: Inger Boivie, Kasper Hornbæk, Janice Anne Rohn, Elina Eriksson, Åsa Cajander, Henrik Artman, Jan Stage, Netta Iivari, Jan Gulliksen, Kim Nguyen, Peter Nielsen, Morten Hertzum, Rolf Molich, Carl Åborg\n- Research collaborations between these authors: Inger Boivie and Peter Nielsen, Inger Boivie and Jan Stage, Inger Boivie and Morten Hertzum, Inger Boivie and Netta Iivari, Inger Boivie and Kasper Hornbæk, Inger Boivie and Elina Eriksson, Inger Boivie and Jan Gulliksen, Inger Boivie and Kim Nguyen, Inger Boivie and Åsa Cajander, Inger Boivie and Carl Åborg, Inger Boivie and Janice Anne Rohn, Kasper Hornbæk and Jan Stage, Kasper Hornbæk and Morten Hertzum, Kasper Hornbæk and Jan Gulliksen, Kasper Hornbæk and Rolf Molich, Kasper Hornbæk and Janice Anne Rohn, Janice Anne Rohn and Jan Stage, Janice Anne Rohn and Netta Iivari, Janice Anne Rohn and Jan Gulliksen, Elina Eriksson and Netta Iivari, Elina Eriksson and Jan Gulliksen, Elina Eriksson and Åsa Cajander, Elina Eriksson and Henrik Artman, Elina Eriksson and Carl Åborg, Åsa Cajander and Jan Stage, Åsa Cajander and Netta Iivari, Åsa Cajander and Jan Gulliksen, Åsa Cajander and Carl Åborg, Henrik Artman and Jan Gulliksen, Jan Stage and Morten Hertzum, Jan Stage and Jan Gulliksen, Jan Stage and Kim Nguyen, Jan Stage and Rolf Molich, Netta Iivari and Jan Gulliksen, Jan Gulliksen and Peter Nielsen, Jan Gulliksen and Morten Hertzum, Jan Gulliksen and Carl Åborg, Jan Gulliksen and Kim Nguyen, Morten Hertzum and Rolf Molich.\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\": \"Inger Boivie\", \"id\": 320768}, {\"name\": \"Elina Eriksson\", \"id\": 50240}, {\"name\": \"Janice Anne Rohn\", \"id\": 656738}, {\"name\": \"Kasper Hornb\\u00e6k\", \"id\": 31904}, {\"name\": \"\\u00c5sa Cajander\", \"id\": 262339}, {\"name\": \"Henrik Artman\", \"id\": 394817}, {\"name\": \"Jan Stage\", \"id\": 6794}, {\"name\": \"Netta Iivari\", \"id\": 25803}, {\"name\": \"Jan Gulliksen\", \"id\": 157803}, {\"name\": \"Kim Nguyen\", \"id\": 212426}, {\"name\": \"Peter Nielsen\", \"id\": 944}, {\"name\": \"Morten Hertzum\", \"id\": 17779}, {\"name\": \"Rolf Molich\", \"id\": 537942}, {\"name\": \"Carl \\u00c5borg\", \"id\": 549048}], \"links\": [{\"source\": 320768, \"target\": 944}, {\"source\": 320768, \"target\": 6794}, {\"source\": 320768, \"target\": 17779}, {\"source\": 320768, \"target\": 25803}, {\"source\": 320768, \"target\": 31904}, {\"source\": 320768, \"target\": 50240}, {\"source\": 320768, \"target\": 157803}, {\"source\": 320768, \"target\": 212426}, {\"source\": 320768, \"target\": 262339}, {\"source\": 320768, \"target\": 549048}, {\"source\": 320768, \"target\": 656738}, {\"source\": 50240, \"target\": 25803}, {\"source\": 50240, \"target\": 157803}, {\"source\": 50240, \"target\": 262339}, {\"source\": 50240, \"target\": 394817}, {\"source\": 50240, \"target\": 549048}, {\"source\": 656738, \"target\": 6794}, {\"source\": 656738, \"target\": 25803}, {\"source\": 656738, \"target\": 31904}, {\"source\": 656738, \"target\": 157803}, {\"source\": 31904, \"target\": 6794}, {\"source\": 31904, \"target\": 17779}, {\"source\": 31904, \"target\": 157803}, {\"source\": 31904, \"target\": 537942}, {\"source\": 262339, \"target\": 6794}, {\"source\": 262339, \"target\": 25803}, {\"source\": 262339, \"target\": 157803}, {\"source\": 262339, \"target\": 549048}, {\"source\": 394817, \"target\": 157803}, {\"source\": 6794, \"target\": 17779}, {\"source\": 6794, \"target\": 157803}, {\"source\": 6794, \"target\": 212426}, {\"source\": 6794, \"target\": 537942}, {\"source\": 25803, \"target\": 157803}, {\"source\": 157803, \"target\": 944}, {\"source\": 157803, \"target\": 17779}, {\"source\": 157803, \"target\": 549048}, {\"source\": 157803, \"target\": 212426}, {\"source\": 17779, \"target\": 537942}]}",
"id": 2217,
"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: Inger Boivie, Kasper Hornbæk, Janice Anne Rohn, Elina Eriksson, Åsa Cajander, Henrik Artman, Jan Stage, Netta Iivari, Jan Gulliksen, Kim Nguyen, Peter Nielsen, Morten Hertzum, Rolf Molich, Carl Åborg\n- Research collaborations between these authors: Inger Boivie and Peter Nielsen, Inger Boivie and Jan Stage, Inger Boivie and Morten Hertzum, Inger Boivie and Netta Iivari, Inger Boivie and Kasper Hornbæk, Inger Boivie and Elina Eriksson, Inger Boivie and Jan Gulliksen, Inger Boivie and Kim Nguyen, Inger Boivie and Åsa Cajander, Inger Boivie and Carl Åborg, Inger Boivie and Janice Anne Rohn, Kasper Hornbæk and Jan Stage, Kasper Hornbæk and Morten Hertzum, Kasper Hornbæk and Jan Gulliksen, Kasper Hornbæk and Rolf Molich, Kasper Hornbæk and Janice Anne Rohn, Janice Anne Rohn and Jan Stage, Janice Anne Rohn and Netta Iivari, Janice Anne Rohn and Jan Gulliksen, Elina Eriksson and Netta Iivari, Elina Eriksson and Jan Gulliksen, Elina Eriksson and Åsa Cajander, Elina Eriksson and Henrik Artman, Elina Eriksson and Carl Åborg, Åsa Cajander and Jan Stage, Åsa Cajander and Netta Iivari, Åsa Cajander and Jan Gulliksen, Åsa Cajander and Carl Åborg, Henrik Artman and Jan Gulliksen, Jan Stage and Morten Hertzum, Jan Stage and Jan Gulliksen, Jan Stage and Kim Nguyen, Jan Stage and Rolf Molich, Netta Iivari and Jan Gulliksen, Jan Gulliksen and Peter Nielsen, Jan Gulliksen and Morten Hertzum, Jan Gulliksen and Carl Åborg, Jan Gulliksen and Kim Nguyen, Morten Hertzum and Rolf Molich.\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: Keiichi Kushida, Atsushi Kawasumi, Shinichi Sasaki, Toshikazu Suzuki, Shinji Miyano, Tomoaki Yabe, Osamu Hirabayashi, Yasuhisa Takeyama, Farshad Moradi, Takahiko Sasaki, Meng-Fan Chang, Azuma Suzuki, Y. Shizuki, Yuki Fujimura\n- Research collaborations between these authors: Keiichi Kushida and Farshad Moradi, Keiichi Kushida and Meng-Fan Chang, Keiichi Kushida and Shinichi Sasaki, Keiichi Kushida and Atsushi Kawasumi, Keiichi Kushida and Tomoaki Yabe, Keiichi Kushida and Osamu Hirabayashi, Keiichi Kushida and Yasuhisa Takeyama, Keiichi Kushida and Takahiko Sasaki, Keiichi Kushida and Yuki Fujimura, Keiichi Kushida and Azuma Suzuki, Keiichi Kushida and Y. Shizuki, Keiichi Kushida and Toshikazu Suzuki, Keiichi Kushida and Shinji Miyano, Atsushi Kawasumi and Farshad Moradi, Atsushi Kawasumi and Meng-Fan Chang, Atsushi Kawasumi and Shinichi Sasaki, Atsushi Kawasumi and Toshikazu Suzuki, Atsushi Kawasumi and Shinji Miyano, Atsushi Kawasumi and Tomoaki Yabe, Atsushi Kawasumi and Osamu Hirabayashi, Atsushi Kawasumi and Yasuhisa Takeyama, Atsushi Kawasumi and Takahiko Sasaki, Atsushi Kawasumi and Yuki Fujimura, Atsushi Kawasumi and Azuma Suzuki, Atsushi Kawasumi and Y. Shizuki, Shinichi Sasaki and Tomoaki Yabe, Shinichi Sasaki and Osamu Hirabayashi, Shinichi Sasaki and Yasuhisa Takeyama, Shinichi Sasaki and Yuki Fujimura, Shinichi Sasaki and Azuma Suzuki, Toshikazu Suzuki and Shinji Miyano, Toshikazu Suzuki and Tomoaki Yabe, Toshikazu Suzuki and Osamu Hirabayashi, Toshikazu Suzuki and Yasuhisa Takeyama, Toshikazu Suzuki and Takahiko Sasaki, Toshikazu Suzuki and Yuki Fujimura, Toshikazu Suzuki and Azuma Suzuki, Shinji Miyano and Tomoaki Yabe, Shinji Miyano and Osamu Hirabayashi, Shinji Miyano and Yasuhisa Takeyama, Shinji Miyano and Takahiko Sasaki, Shinji Miyano and Yuki Fujimura, Shinji Miyano and Azuma Suzuki, Tomoaki Yabe and Farshad Moradi, Tomoaki Yabe and Meng-Fan Chang, Tomoaki Yabe and Osamu Hirabayashi, Tomoaki Yabe and Yasuhisa Takeyama, Tomoaki Yabe and Takahiko Sasaki, Tomoaki Yabe and Yuki Fujimura, Tomoaki Yabe and Azuma Suzuki, Tomoaki Yabe and Y. Shizuki, Osamu Hirabayashi and Farshad Moradi, Osamu Hirabayashi and Meng-Fan Chang, Osamu Hirabayashi and Yasuhisa Takeyama, Osamu Hirabayashi and Takahiko Sasaki, Osamu Hirabayashi and Yuki Fujimura, Osamu Hirabayashi and Azuma Suzuki, Osamu Hirabayashi and Y. Shizuki, Yasuhisa Takeyama and Farshad Moradi, Yasuhisa Takeyama and Meng-Fan Chang, Yasuhisa Takeyama and Takahiko Sasaki, Yasuhisa Takeyama and Yuki Fujimura, Yasuhisa Takeyama and Azuma Suzuki, Yasuhisa Takeyama and Y. Shizuki, Farshad Moradi and Takahiko Sasaki, Farshad Moradi and Yuki Fujimura, Farshad Moradi and Azuma Suzuki, Meng-Fan Chang and Yuki Fujimura, Azuma Suzuki and Yuki Fujimura.\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\": \"Keiichi Kushida\", \"id\": 492256}, {\"name\": \"Atsushi Kawasumi\", \"id\": 492261}, {\"name\": \"Shinichi Sasaki\", \"id\": 488902}, {\"name\": \"Toshikazu Suzuki\", \"id\": 503367}, {\"name\": \"Shinji Miyano\", \"id\": 503368}, {\"name\": \"Tomoaki Yabe\", \"id\": 570730}, {\"name\": \"Osamu Hirabayashi\", \"id\": 570731}, {\"name\": \"Yasuhisa Takeyama\", \"id\": 570732}, {\"name\": \"Farshad Moradi\", \"id\": 13517}, {\"name\": \"Takahiko Sasaki\", \"id\": 570733}, {\"name\": \"Meng-Fan Chang\", \"id\": 226481}, {\"name\": \"Azuma Suzuki\", \"id\": 828498}, {\"name\": \"Y. Shizuki\", \"id\": 895185}, {\"name\": \"Yuki Fujimura\", \"id\": 646871}], \"links\": [{\"source\": 492256, \"target\": 13517}, {\"source\": 492256, \"target\": 226481}, {\"source\": 492256, \"target\": 488902}, {\"source\": 492256, \"target\": 492261}, {\"source\": 492256, \"target\": 570730}, {\"source\": 492256, \"target\": 570731}, {\"source\": 492256, \"target\": 570732}, {\"source\": 492256, \"target\": 570733}, {\"source\": 492256, \"target\": 646871}, {\"source\": 492256, \"target\": 828498}, {\"source\": 492256, \"target\": 895185}, {\"source\": 492256, \"target\": 503367}, {\"source\": 492256, \"target\": 503368}, {\"source\": 492261, \"target\": 13517}, {\"source\": 492261, \"target\": 226481}, {\"source\": 492261, \"target\": 488902}, {\"source\": 492261, \"target\": 503367}, {\"source\": 492261, \"target\": 503368}, {\"source\": 492261, \"target\": 570730}, {\"source\": 492261, \"target\": 570731}, {\"source\": 492261, \"target\": 570732}, {\"source\": 492261, \"target\": 570733}, {\"source\": 492261, \"target\": 646871}, {\"source\": 492261, \"target\": 828498}, {\"source\": 492261, \"target\": 895185}, {\"source\": 488902, \"target\": 570730}, {\"source\": 488902, \"target\": 570731}, {\"source\": 488902, \"target\": 570732}, {\"source\": 488902, \"target\": 646871}, {\"source\": 488902, \"target\": 828498}, {\"source\": 503367, \"target\": 503368}, {\"source\": 503367, \"target\": 570730}, {\"source\": 503367, \"target\": 570731}, {\"source\": 503367, \"target\": 570732}, {\"source\": 503367, \"target\": 570733}, {\"source\": 503367, \"target\": 646871}, {\"source\": 503367, \"target\": 828498}, {\"source\": 503368, \"target\": 570730}, {\"source\": 503368, \"target\": 570731}, {\"source\": 503368, \"target\": 570732}, {\"source\": 503368, \"target\": 570733}, {\"source\": 503368, \"target\": 646871}, {\"source\": 503368, \"target\": 828498}, {\"source\": 570730, \"target\": 13517}, {\"source\": 570730, \"target\": 226481}, {\"source\": 570730, \"target\": 570731}, {\"source\": 570730, \"target\": 570732}, {\"source\": 570730, \"target\": 570733}, {\"source\": 570730, \"target\": 646871}, {\"source\": 570730, \"target\": 828498}, {\"source\": 570730, \"target\": 895185}, {\"source\": 570731, \"target\": 13517}, {\"source\": 570731, \"target\": 226481}, {\"source\": 570731, \"target\": 570732}, {\"source\": 570731, \"target\": 570733}, {\"source\": 570731, \"target\": 646871}, {\"source\": 570731, \"target\": 828498}, {\"source\": 570731, \"target\": 895185}, {\"source\": 570732, \"target\": 13517}, {\"source\": 570732, \"target\": 226481}, {\"source\": 570732, \"target\": 570733}, {\"source\": 570732, \"target\": 646871}, {\"source\": 570732, \"target\": 828498}, {\"source\": 570732, \"target\": 895185}, {\"source\": 13517, \"target\": 570733}, {\"source\": 13517, \"target\": 646871}, {\"source\": 13517, \"target\": 828498}, {\"source\": 226481, \"target\": 646871}, {\"source\": 828498, \"target\": 646871}]}",
"id": 2519,
"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: Keiichi Kushida, Atsushi Kawasumi, Shinichi Sasaki, Toshikazu Suzuki, Shinji Miyano, Tomoaki Yabe, Osamu Hirabayashi, Yasuhisa Takeyama, Farshad Moradi, Takahiko Sasaki, Meng-Fan Chang, Azuma Suzuki, Y. Shizuki, Yuki Fujimura\n- Research collaborations between these authors: Keiichi Kushida and Farshad Moradi, Keiichi Kushida and Meng-Fan Chang, Keiichi Kushida and Shinichi Sasaki, Keiichi Kushida and Atsushi Kawasumi, Keiichi Kushida and Tomoaki Yabe, Keiichi Kushida and Osamu Hirabayashi, Keiichi Kushida and Yasuhisa Takeyama, Keiichi Kushida and Takahiko Sasaki, Keiichi Kushida and Yuki Fujimura, Keiichi Kushida and Azuma Suzuki, Keiichi Kushida and Y. Shizuki, Keiichi Kushida and Toshikazu Suzuki, Keiichi Kushida and Shinji Miyano, Atsushi Kawasumi and Farshad Moradi, Atsushi Kawasumi and Meng-Fan Chang, Atsushi Kawasumi and Shinichi Sasaki, Atsushi Kawasumi and Toshikazu Suzuki, Atsushi Kawasumi and Shinji Miyano, Atsushi Kawasumi and Tomoaki Yabe, Atsushi Kawasumi and Osamu Hirabayashi, Atsushi Kawasumi and Yasuhisa Takeyama, Atsushi Kawasumi and Takahiko Sasaki, Atsushi Kawasumi and Yuki Fujimura, Atsushi Kawasumi and Azuma Suzuki, Atsushi Kawasumi and Y. Shizuki, Shinichi Sasaki and Tomoaki Yabe, Shinichi Sasaki and Osamu Hirabayashi, Shinichi Sasaki and Yasuhisa Takeyama, Shinichi Sasaki and Yuki Fujimura, Shinichi Sasaki and Azuma Suzuki, Toshikazu Suzuki and Shinji Miyano, Toshikazu Suzuki and Tomoaki Yabe, Toshikazu Suzuki and Osamu Hirabayashi, Toshikazu Suzuki and Yasuhisa Takeyama, Toshikazu Suzuki and Takahiko Sasaki, Toshikazu Suzuki and Yuki Fujimura, Toshikazu Suzuki and Azuma Suzuki, Shinji Miyano and Tomoaki Yabe, Shinji Miyano and Osamu Hirabayashi, Shinji Miyano and Yasuhisa Takeyama, Shinji Miyano and Takahiko Sasaki, Shinji Miyano and Yuki Fujimura, Shinji Miyano and Azuma Suzuki, Tomoaki Yabe and Farshad Moradi, Tomoaki Yabe and Meng-Fan Chang, Tomoaki Yabe and Osamu Hirabayashi, Tomoaki Yabe and Yasuhisa Takeyama, Tomoaki Yabe and Takahiko Sasaki, Tomoaki Yabe and Yuki Fujimura, Tomoaki Yabe and Azuma Suzuki, Tomoaki Yabe and Y. Shizuki, Osamu Hirabayashi and Farshad Moradi, Osamu Hirabayashi and Meng-Fan Chang, Osamu Hirabayashi and Yasuhisa Takeyama, Osamu Hirabayashi and Takahiko Sasaki, Osamu Hirabayashi and Yuki Fujimura, Osamu Hirabayashi and Azuma Suzuki, Osamu Hirabayashi and Y. Shizuki, Yasuhisa Takeyama and Farshad Moradi, Yasuhisa Takeyama and Meng-Fan Chang, Yasuhisa Takeyama and Takahiko Sasaki, Yasuhisa Takeyama and Yuki Fujimura, Yasuhisa Takeyama and Azuma Suzuki, Yasuhisa Takeyama and Y. Shizuki, Farshad Moradi and Takahiko Sasaki, Farshad Moradi and Yuki Fujimura, Farshad Moradi and Azuma Suzuki, Meng-Fan Chang and Yuki Fujimura, Azuma Suzuki and Yuki Fujimura.\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: Nitin H. Vaidya, Hari Balakrishnan, Aljosa Dorni, Glenford E. Mapp, Qing-An Zeng, Takashi Watanabe, Wendi Rabiner Heinzelman, Fatos Xhafa, Jinde Cao, Somprakash Bandyopadhyay, Dharma P. Agrawal, Yang Yang, Kazunori Uchida, Jeffrey G. Andrews\n- Research collaborations between these authors: Nitin H. Vaidya and Yang Yang, Nitin H. Vaidya and Dharma P. Agrawal, Nitin H. Vaidya and Hari Balakrishnan, Nitin H. Vaidya and Somprakash Bandyopadhyay, Nitin H. Vaidya and Takashi Watanabe, Nitin H. Vaidya and Aljosa Dorni, Hari Balakrishnan and Yang Yang, Hari Balakrishnan and Fatos Xhafa, Hari Balakrishnan and Dharma P. Agrawal, Hari Balakrishnan and Wendi Rabiner Heinzelman, Hari Balakrishnan and Takashi Watanabe, Aljosa Dorni and Dharma P. Agrawal, Glenford E. Mapp and Dharma P. Agrawal, Glenford E. Mapp and Qing-An Zeng, Qing-An Zeng and Dharma P. Agrawal, Takashi Watanabe and Dharma P. Agrawal, Takashi Watanabe and Somprakash Bandyopadhyay, Wendi Rabiner Heinzelman and Fatos Xhafa, Wendi Rabiner Heinzelman and Dharma P. Agrawal, Fatos Xhafa and Dharma P. Agrawal, Fatos Xhafa and Kazunori Uchida, Somprakash Bandyopadhyay and Dharma P. Agrawal, Dharma P. Agrawal and Yang Yang, Dharma P. Agrawal and Jeffrey G. Andrews, Dharma P. Agrawal and Kazunori Uchida, Yang Yang and Jeffrey G. Andrews.\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\": \"Nitin H. Vaidya\", \"id\": 121633}, {\"name\": \"Hari Balakrishnan\", \"id\": 54761}, {\"name\": \"Aljosa Dorni\", \"id\": 581453}, {\"name\": \"Qing-An Zeng\", \"id\": 199214}, {\"name\": \"Glenford E. Mapp\", \"id\": 122190}, {\"name\": \"Takashi Watanabe\", \"id\": 247216}, {\"name\": \"Wendi Rabiner Heinzelman\", \"id\": 103825}, {\"name\": \"Fatos Xhafa\", \"id\": 27822}, {\"name\": \"Jeffrey G. Andrews\", \"id\": 134719}, {\"name\": \"Jinde Cao\", \"id\": 82293}, {\"name\": \"Somprakash Bandyopadhyay\", \"id\": 99832}, {\"name\": \"Dharma P. Agrawal\", \"id\": 30618}, {\"name\": \"Kazunori Uchida\", \"id\": 277726}, {\"name\": \"Yang Yang\", \"id\": 4095}], \"links\": [{\"source\": 121633, \"target\": 4095}, {\"source\": 121633, \"target\": 30618}, {\"source\": 121633, \"target\": 54761}, {\"source\": 121633, \"target\": 99832}, {\"source\": 121633, \"target\": 247216}, {\"source\": 121633, \"target\": 581453}, {\"source\": 54761, \"target\": 4095}, {\"source\": 54761, \"target\": 27822}, {\"source\": 54761, \"target\": 30618}, {\"source\": 54761, \"target\": 103825}, {\"source\": 54761, \"target\": 247216}, {\"source\": 581453, \"target\": 30618}, {\"source\": 199214, \"target\": 30618}, {\"source\": 199214, \"target\": 122190}, {\"source\": 122190, \"target\": 30618}, {\"source\": 247216, \"target\": 30618}, {\"source\": 247216, \"target\": 99832}, {\"source\": 103825, \"target\": 27822}, {\"source\": 103825, \"target\": 30618}, {\"source\": 27822, \"target\": 30618}, {\"source\": 27822, \"target\": 277726}, {\"source\": 134719, \"target\": 4095}, {\"source\": 134719, \"target\": 30618}, {\"source\": 99832, \"target\": 30618}, {\"source\": 30618, \"target\": 4095}, {\"source\": 30618, \"target\": 277726}]}",
"id": 1905,
"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: Nitin H. Vaidya, Hari Balakrishnan, Aljosa Dorni, Glenford E. Mapp, Qing-An Zeng, Takashi Watanabe, Wendi Rabiner Heinzelman, Fatos Xhafa, Jinde Cao, Somprakash Bandyopadhyay, Dharma P. Agrawal, Yang Yang, Kazunori Uchida, Jeffrey G. Andrews\n- Research collaborations between these authors: Nitin H. Vaidya and Yang Yang, Nitin H. Vaidya and Dharma P. Agrawal, Nitin H. Vaidya and Hari Balakrishnan, Nitin H. Vaidya and Somprakash Bandyopadhyay, Nitin H. Vaidya and Takashi Watanabe, Nitin H. Vaidya and Aljosa Dorni, Hari Balakrishnan and Yang Yang, Hari Balakrishnan and Fatos Xhafa, Hari Balakrishnan and Dharma P. Agrawal, Hari Balakrishnan and Wendi Rabiner Heinzelman, Hari Balakrishnan and Takashi Watanabe, Aljosa Dorni and Dharma P. Agrawal, Glenford E. Mapp and Dharma P. Agrawal, Glenford E. Mapp and Qing-An Zeng, Qing-An Zeng and Dharma P. Agrawal, Takashi Watanabe and Dharma P. Agrawal, Takashi Watanabe and Somprakash Bandyopadhyay, Wendi Rabiner Heinzelman and Fatos Xhafa, Wendi Rabiner Heinzelman and Dharma P. Agrawal, Fatos Xhafa and Dharma P. Agrawal, Fatos Xhafa and Kazunori Uchida, Somprakash Bandyopadhyay and Dharma P. Agrawal, Dharma P. Agrawal and Yang Yang, Dharma P. Agrawal and Jeffrey G. Andrews, Dharma P. Agrawal and Kazunori Uchida, Yang Yang and Jeffrey G. Andrews.\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: Marvin Tom, Ali Akoglu, Katarina Paulsson, Julien Lamoureux, Ian Kuon, Peter Y. K. Cheung, Miron Abramovici, Wu-chun Feng, Deming Chen, Joydip Das, Charles E. Stroud, Steven J. E. Wilton, Gregory M. Striemer, Adarsha Sreeramareddy\n- Research collaborations between these authors: Marvin Tom and Peter Y. K. Cheung, Marvin Tom and Steven J. E. Wilton, Marvin Tom and Ian Kuon, Marvin Tom and Ali Akoglu, Ali Akoglu and Wu-chun Feng, Ali Akoglu and Charles E. Stroud, Ali Akoglu and Steven J. E. Wilton, Ali Akoglu and Katarina Paulsson, Ali Akoglu and Miron Abramovici, Ali Akoglu and Ian Kuon, Ali Akoglu and Deming Chen, Ali Akoglu and Julien Lamoureux, Ali Akoglu and Adarsha Sreeramareddy, Ali Akoglu and Joydip Das, Ali Akoglu and Gregory M. Striemer, Katarina Paulsson and Adarsha Sreeramareddy, Julien Lamoureux and Peter Y. K. Cheung, Julien Lamoureux and Steven J. E. Wilton, Julien Lamoureux and Deming Chen, Ian Kuon and Peter Y. K. Cheung, Ian Kuon and Steven J. E. Wilton, Peter Y. K. Cheung and Charles E. Stroud, Peter Y. K. Cheung and Steven J. E. Wilton, Peter Y. K. Cheung and Miron Abramovici, Miron Abramovici and Charles E. Stroud, Miron Abramovici and Steven J. E. Wilton, Wu-chun Feng and Gregory M. Striemer, Deming Chen and Steven J. E. Wilton, Joydip Das and Steven J. E. Wilton.\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\": \"Marvin Tom\", \"id\": 479490}, {\"name\": \"Ali Akoglu\", \"id\": 501539}, {\"name\": \"Katarina Paulsson\", \"id\": 178182}, {\"name\": \"Julien Lamoureux\", \"id\": 403815}, {\"name\": \"Ian Kuon\", \"id\": 280937}, {\"name\": \"Peter Y. K. Cheung\", \"id\": 114122}, {\"name\": \"Miron Abramovici\", \"id\": 236204}, {\"name\": \"Wu-chun Feng\", \"id\": 134704}, {\"name\": \"Deming Chen\", \"id\": 336272}, {\"name\": \"Joydip Das\", \"id\": 748400}, {\"name\": \"Charles E. Stroud\", \"id\": 40535}, {\"name\": \"Steven J. E. Wilton\", \"id\": 150234}, {\"name\": \"Gregory M. Striemer\", \"id\": 690429}, {\"name\": \"Adarsha Sreeramareddy\", \"id\": 683358}], \"links\": [{\"source\": 479490, \"target\": 114122}, {\"source\": 479490, \"target\": 150234}, {\"source\": 479490, \"target\": 280937}, {\"source\": 479490, \"target\": 501539}, {\"source\": 501539, \"target\": 134704}, {\"source\": 501539, \"target\": 40535}, {\"source\": 501539, \"target\": 150234}, {\"source\": 501539, \"target\": 178182}, {\"source\": 501539, \"target\": 236204}, {\"source\": 501539, \"target\": 280937}, {\"source\": 501539, \"target\": 336272}, {\"source\": 501539, \"target\": 403815}, {\"source\": 501539, \"target\": 683358}, {\"source\": 501539, \"target\": 748400}, {\"source\": 501539, \"target\": 690429}, {\"source\": 178182, \"target\": 683358}, {\"source\": 403815, \"target\": 114122}, {\"source\": 403815, \"target\": 150234}, {\"source\": 403815, \"target\": 336272}, {\"source\": 280937, \"target\": 114122}, {\"source\": 280937, \"target\": 150234}, {\"source\": 114122, \"target\": 40535}, {\"source\": 114122, \"target\": 150234}, {\"source\": 114122, \"target\": 236204}, {\"source\": 236204, \"target\": 40535}, {\"source\": 236204, \"target\": 150234}, {\"source\": 134704, \"target\": 690429}, {\"source\": 336272, \"target\": 150234}, {\"source\": 748400, \"target\": 150234}]}",
"id": 910,
"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: Marvin Tom, Ali Akoglu, Katarina Paulsson, Julien Lamoureux, Ian Kuon, Peter Y. K. Cheung, Miron Abramovici, Wu-chun Feng, Deming Chen, Joydip Das, Charles E. Stroud, Steven J. E. Wilton, Gregory M. Striemer, Adarsha Sreeramareddy\n- Research collaborations between these authors: Marvin Tom and Peter Y. K. Cheung, Marvin Tom and Steven J. E. Wilton, Marvin Tom and Ian Kuon, Marvin Tom and Ali Akoglu, Ali Akoglu and Wu-chun Feng, Ali Akoglu and Charles E. Stroud, Ali Akoglu and Steven J. E. Wilton, Ali Akoglu and Katarina Paulsson, Ali Akoglu and Miron Abramovici, Ali Akoglu and Ian Kuon, Ali Akoglu and Deming Chen, Ali Akoglu and Julien Lamoureux, Ali Akoglu and Adarsha Sreeramareddy, Ali Akoglu and Joydip Das, Ali Akoglu and Gregory M. Striemer, Katarina Paulsson and Adarsha Sreeramareddy, Julien Lamoureux and Peter Y. K. Cheung, Julien Lamoureux and Steven J. E. Wilton, Julien Lamoureux and Deming Chen, Ian Kuon and Peter Y. K. Cheung, Ian Kuon and Steven J. E. Wilton, Peter Y. K. Cheung and Charles E. Stroud, Peter Y. K. Cheung and Steven J. E. Wilton, Peter Y. K. Cheung and Miron Abramovici, Miron Abramovici and Charles E. Stroud, Miron Abramovici and Steven J. E. Wilton, Wu-chun Feng and Gregory M. Striemer, Deming Chen and Steven J. E. Wilton, Joydip Das and Steven J. E. Wilton.\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: Kenrick Kin, Maneesh Agrawala, Shumin Zhai, Atif M. Memon, Patrick Baudisch, Sai Zhang, Atanas Rountev, Björn Hartmann, Hao Lü, Ravin Balakrishnan, Yang Li, Andrew D. Wilson, Michael D. Ernst, Jacob O. Wobbrock\n- Research collaborations between these authors: Kenrick Kin and Yang Li, Kenrick Kin and Maneesh Agrawala, Kenrick Kin and Ravin Balakrishnan, Kenrick Kin and Jacob O. Wobbrock, Kenrick Kin and Patrick Baudisch, Kenrick Kin and Andrew D. Wilson, Kenrick Kin and Hao Lü, Maneesh Agrawala and Ravin Balakrishnan, Maneesh Agrawala and Yang Li, Maneesh Agrawala and Jacob O. Wobbrock, Maneesh Agrawala and Patrick Baudisch, Maneesh Agrawala and Andrew D. Wilson, Maneesh Agrawala and Björn Hartmann, Maneesh Agrawala and Hao Lü, Shumin Zhai and Ravin Balakrishnan, Shumin Zhai and Yang Li, Shumin Zhai and Jacob O. Wobbrock, Shumin Zhai and Patrick Baudisch, Shumin Zhai and Andrew D. Wilson, Shumin Zhai and Hao Lü, Atif M. Memon and Michael D. Ernst, Atif M. Memon and Sai Zhang, Atif M. Memon and Atanas Rountev, Atif M. Memon and Hao Lü, Patrick Baudisch and Ravin Balakrishnan, Patrick Baudisch and Yang Li, Patrick Baudisch and Jacob O. Wobbrock, Patrick Baudisch and Andrew D. Wilson, Patrick Baudisch and Björn Hartmann, Patrick Baudisch and Hao Lü, Sai Zhang and Michael D. Ernst, Sai Zhang and Atanas Rountev, Sai Zhang and Hao Lü, Atanas Rountev and Michael D. Ernst, Atanas Rountev and Hao Lü, Björn Hartmann and Yang Li, Björn Hartmann and Jacob O. Wobbrock, Björn Hartmann and Ravin Balakrishnan, Björn Hartmann and Andrew D. Wilson, Björn Hartmann and Hao Lü, Hao Lü and Yang Li, Hao Lü and Ravin Balakrishnan, Hao Lü and Jacob O. Wobbrock, Hao Lü and Andrew D. Wilson, Hao Lü and Michael D. Ernst, Ravin Balakrishnan and Yang Li, Ravin Balakrishnan and Jacob O. Wobbrock, Ravin Balakrishnan and Andrew D. Wilson, Yang Li and Jacob O. Wobbrock, Yang Li and Andrew D. Wilson, Andrew D. Wilson and Jacob O. Wobbrock.\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\": \"Kenrick Kin\", \"id\": 332865}, {\"name\": \"Maneesh Agrawala\", \"id\": 116612}, {\"name\": \"Shumin Zhai\", \"id\": 32967}, {\"name\": \"Atif M. Memon\", \"id\": 7402}, {\"name\": \"Patrick Baudisch\", \"id\": 65770}, {\"name\": \"Sai Zhang\", \"id\": 378990}, {\"name\": \"Atanas Rountev\", \"id\": 385424}, {\"name\": \"Bj\\u00f6rn Hartmann\", \"id\": 143825}, {\"name\": \"Hao L\\u00fc\", \"id\": 387890}, {\"name\": \"Ravin Balakrishnan\", \"id\": 21684}, {\"name\": \"Yang Li\", \"id\": 33238}, {\"name\": \"Andrew D. Wilson\", \"id\": 112890}, {\"name\": \"Michael D. Ernst\", \"id\": 129883}, {\"name\": \"Jacob O. Wobbrock\", \"id\": 53308}], \"links\": [{\"source\": 332865, \"target\": 33238}, {\"source\": 332865, \"target\": 116612}, {\"source\": 332865, \"target\": 21684}, {\"source\": 332865, \"target\": 53308}, {\"source\": 332865, \"target\": 65770}, {\"source\": 332865, \"target\": 112890}, {\"source\": 332865, \"target\": 387890}, {\"source\": 116612, \"target\": 21684}, {\"source\": 116612, \"target\": 33238}, {\"source\": 116612, \"target\": 53308}, {\"source\": 116612, \"target\": 65770}, {\"source\": 116612, \"target\": 112890}, {\"source\": 116612, \"target\": 143825}, {\"source\": 116612, \"target\": 387890}, {\"source\": 32967, \"target\": 21684}, {\"source\": 32967, \"target\": 33238}, {\"source\": 32967, \"target\": 53308}, {\"source\": 32967, \"target\": 65770}, {\"source\": 32967, \"target\": 112890}, {\"source\": 32967, \"target\": 387890}, {\"source\": 7402, \"target\": 129883}, {\"source\": 7402, \"target\": 378990}, {\"source\": 7402, \"target\": 385424}, {\"source\": 7402, \"target\": 387890}, {\"source\": 65770, \"target\": 21684}, {\"source\": 65770, \"target\": 33238}, {\"source\": 65770, \"target\": 53308}, {\"source\": 65770, \"target\": 112890}, {\"source\": 65770, \"target\": 143825}, {\"source\": 65770, \"target\": 387890}, {\"source\": 378990, \"target\": 129883}, {\"source\": 378990, \"target\": 385424}, {\"source\": 378990, \"target\": 387890}, {\"source\": 385424, \"target\": 129883}, {\"source\": 385424, \"target\": 387890}, {\"source\": 143825, \"target\": 33238}, {\"source\": 143825, \"target\": 53308}, {\"source\": 143825, \"target\": 21684}, {\"source\": 143825, \"target\": 112890}, {\"source\": 143825, \"target\": 387890}, {\"source\": 387890, \"target\": 33238}, {\"source\": 387890, \"target\": 21684}, {\"source\": 387890, \"target\": 53308}, {\"source\": 387890, \"target\": 112890}, {\"source\": 387890, \"target\": 129883}, {\"source\": 21684, \"target\": 33238}, {\"source\": 21684, \"target\": 53308}, {\"source\": 21684, \"target\": 112890}, {\"source\": 33238, \"target\": 53308}, {\"source\": 33238, \"target\": 112890}, {\"source\": 112890, \"target\": 53308}]}",
"id": 483,
"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: Kenrick Kin, Maneesh Agrawala, Shumin Zhai, Atif M. Memon, Patrick Baudisch, Sai Zhang, Atanas Rountev, Björn Hartmann, Hao Lü, Ravin Balakrishnan, Yang Li, Andrew D. Wilson, Michael D. Ernst, Jacob O. Wobbrock\n- Research collaborations between these authors: Kenrick Kin and Yang Li, Kenrick Kin and Maneesh Agrawala, Kenrick Kin and Ravin Balakrishnan, Kenrick Kin and Jacob O. Wobbrock, Kenrick Kin and Patrick Baudisch, Kenrick Kin and Andrew D. Wilson, Kenrick Kin and Hao Lü, Maneesh Agrawala and Ravin Balakrishnan, Maneesh Agrawala and Yang Li, Maneesh Agrawala and Jacob O. Wobbrock, Maneesh Agrawala and Patrick Baudisch, Maneesh Agrawala and Andrew D. Wilson, Maneesh Agrawala and Björn Hartmann, Maneesh Agrawala and Hao Lü, Shumin Zhai and Ravin Balakrishnan, Shumin Zhai and Yang Li, Shumin Zhai and Jacob O. Wobbrock, Shumin Zhai and Patrick Baudisch, Shumin Zhai and Andrew D. Wilson, Shumin Zhai and Hao Lü, Atif M. Memon and Michael D. Ernst, Atif M. Memon and Sai Zhang, Atif M. Memon and Atanas Rountev, Atif M. Memon and Hao Lü, Patrick Baudisch and Ravin Balakrishnan, Patrick Baudisch and Yang Li, Patrick Baudisch and Jacob O. Wobbrock, Patrick Baudisch and Andrew D. Wilson, Patrick Baudisch and Björn Hartmann, Patrick Baudisch and Hao Lü, Sai Zhang and Michael D. Ernst, Sai Zhang and Atanas Rountev, Sai Zhang and Hao Lü, Atanas Rountev and Michael D. Ernst, Atanas Rountev and Hao Lü, Björn Hartmann and Yang Li, Björn Hartmann and Jacob O. Wobbrock, Björn Hartmann and Ravin Balakrishnan, Björn Hartmann and Andrew D. Wilson, Björn Hartmann and Hao Lü, Hao Lü and Yang Li, Hao Lü and Ravin Balakrishnan, Hao Lü and Jacob O. Wobbrock, Hao Lü and Andrew D. Wilson, Hao Lü and Michael D. Ernst, Ravin Balakrishnan and Yang Li, Ravin Balakrishnan and Jacob O. Wobbrock, Ravin Balakrishnan and Andrew D. Wilson, Yang Li and Jacob O. Wobbrock, Yang Li and Andrew D. Wilson, Andrew D. Wilson and Jacob O. Wobbrock.\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: Moisés Piedade, Khashayar Khorasani, A. Lorsawatsiri, Jinwei Sun, Yegui Xiao, Boyan Huang, Akira Ikuta, Sen M. Kuo, Liying Ma, R. Punchalard, Jeerasuda Koseeyaporn, W. Loetwassana, A. Roeksabutr, Paramote Wardkein\n- Research collaborations between these authors: Moisés Piedade and Yegui Xiao, Moisés Piedade and Akira Ikuta, Moisés Piedade and Liying Ma, Khashayar Khorasani and Yegui Xiao, Khashayar Khorasani and Akira Ikuta, Khashayar Khorasani and Liying Ma, Khashayar Khorasani and Sen M. Kuo, Khashayar Khorasani and Jinwei Sun, Khashayar Khorasani and Boyan Huang, A. Lorsawatsiri and R. Punchalard, Jinwei Sun and Yegui Xiao, Jinwei Sun and Akira Ikuta, Jinwei Sun and Liying Ma, Jinwei Sun and Sen M. Kuo, Jinwei Sun and Boyan Huang, Yegui Xiao and Akira Ikuta, Yegui Xiao and Liying Ma, Yegui Xiao and Sen M. Kuo, Yegui Xiao and R. Punchalard, Yegui Xiao and Boyan Huang, Boyan Huang and Akira Ikuta, Boyan Huang and Liying Ma, Boyan Huang and Sen M. Kuo, Akira Ikuta and Liying Ma, Akira Ikuta and Sen M. Kuo, Akira Ikuta and R. Punchalard, Sen M. Kuo and Liying Ma, R. Punchalard and Jeerasuda Koseeyaporn, R. Punchalard and Paramote Wardkein, R. Punchalard and W. Loetwassana, R. Punchalard and A. Roeksabutr.\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\": \"Mois\\u00e9s Piedade\", \"id\": 226464}, {\"name\": \"Khashayar Khorasani\", \"id\": 198756}, {\"name\": \"A. Lorsawatsiri\", \"id\": 520759}, {\"name\": \"Jinwei Sun\", \"id\": 549158}, {\"name\": \"Yegui Xiao\", \"id\": 268298}, {\"name\": \"Boyan Huang\", \"id\": 560331}, {\"name\": \"Akira Ikuta\", \"id\": 268300}, {\"name\": \"Sen M. Kuo\", \"id\": 317005}, {\"name\": \"Liying Ma\", \"id\": 292941}, {\"name\": \"R. Punchalard\", \"id\": 520758}, {\"name\": \"Jeerasuda Koseeyaporn\", \"id\": 398455}, {\"name\": \"W. Loetwassana\", \"id\": 520760}, {\"name\": \"A. Roeksabutr\", \"id\": 520761}, {\"name\": \"Paramote Wardkein\", \"id\": 398456}], \"links\": [{\"source\": 226464, \"target\": 268298}, {\"source\": 226464, \"target\": 268300}, {\"source\": 226464, \"target\": 292941}, {\"source\": 198756, \"target\": 268298}, {\"source\": 198756, \"target\": 268300}, {\"source\": 198756, \"target\": 292941}, {\"source\": 198756, \"target\": 317005}, {\"source\": 198756, \"target\": 549158}, {\"source\": 198756, \"target\": 560331}, {\"source\": 520759, \"target\": 520758}, {\"source\": 549158, \"target\": 268298}, {\"source\": 549158, \"target\": 268300}, {\"source\": 549158, \"target\": 292941}, {\"source\": 549158, \"target\": 317005}, {\"source\": 549158, \"target\": 560331}, {\"source\": 268298, \"target\": 268300}, {\"source\": 268298, \"target\": 292941}, {\"source\": 268298, \"target\": 317005}, {\"source\": 268298, \"target\": 520758}, {\"source\": 268298, \"target\": 560331}, {\"source\": 560331, \"target\": 268300}, {\"source\": 560331, \"target\": 292941}, {\"source\": 560331, \"target\": 317005}, {\"source\": 268300, \"target\": 292941}, {\"source\": 268300, \"target\": 317005}, {\"source\": 268300, \"target\": 520758}, {\"source\": 317005, \"target\": 292941}, {\"source\": 520758, \"target\": 398455}, {\"source\": 520758, \"target\": 398456}, {\"source\": 520758, \"target\": 520760}, {\"source\": 520758, \"target\": 520761}]}",
"id": 742,
"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: Moisés Piedade, Khashayar Khorasani, A. Lorsawatsiri, Jinwei Sun, Yegui Xiao, Boyan Huang, Akira Ikuta, Sen M. Kuo, Liying Ma, R. Punchalard, Jeerasuda Koseeyaporn, W. Loetwassana, A. Roeksabutr, Paramote Wardkein\n- Research collaborations between these authors: Moisés Piedade and Yegui Xiao, Moisés Piedade and Akira Ikuta, Moisés Piedade and Liying Ma, Khashayar Khorasani and Yegui Xiao, Khashayar Khorasani and Akira Ikuta, Khashayar Khorasani and Liying Ma, Khashayar Khorasani and Sen M. Kuo, Khashayar Khorasani and Jinwei Sun, Khashayar Khorasani and Boyan Huang, A. Lorsawatsiri and R. Punchalard, Jinwei Sun and Yegui Xiao, Jinwei Sun and Akira Ikuta, Jinwei Sun and Liying Ma, Jinwei Sun and Sen M. Kuo, Jinwei Sun and Boyan Huang, Yegui Xiao and Akira Ikuta, Yegui Xiao and Liying Ma, Yegui Xiao and Sen M. Kuo, Yegui Xiao and R. Punchalard, Yegui Xiao and Boyan Huang, Boyan Huang and Akira Ikuta, Boyan Huang and Liying Ma, Boyan Huang and Sen M. Kuo, Akira Ikuta and Liying Ma, Akira Ikuta and Sen M. Kuo, Akira Ikuta and R. Punchalard, Sen M. Kuo and Liying Ma, R. Punchalard and Jeerasuda Koseeyaporn, R. Punchalard and Paramote Wardkein, R. Punchalard and W. Loetwassana, R. Punchalard and A. Roeksabutr.\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: Naotaka Yamamoto, An-Ming Wu, Nischal Mishra, Gyanesh Chander, Dennis L. Helder, Hitomi Inada, Soushi Kato, Tetsushi Tachikawa, Ryosuke Nakamura, Kurtis J. Thome, Hirokazu Yamamoto, Xiaoxiong Xiong, Satoshi Tsuchida, Takahiro Kawashima\n- Research collaborations between these authors: Naotaka Yamamoto and Ryosuke Nakamura, Naotaka Yamamoto and Satoshi Tsuchida, Naotaka Yamamoto and Hirokazu Yamamoto, An-Ming Wu and Satoshi Tsuchida, An-Ming Wu and Gyanesh Chander, Nischal Mishra and Xiaoxiong Xiong, Nischal Mishra and Dennis L. Helder, Nischal Mishra and Kurtis J. Thome, Nischal Mishra and Gyanesh Chander, Gyanesh Chander and Ryosuke Nakamura, Gyanesh Chander and Xiaoxiong Xiong, Gyanesh Chander and Satoshi Tsuchida, Gyanesh Chander and Dennis L. Helder, Gyanesh Chander and Kurtis J. Thome, Gyanesh Chander and Soushi Kato, Dennis L. Helder and Kurtis J. Thome, Dennis L. Helder and Xiaoxiong Xiong, Hitomi Inada and Hirokazu Yamamoto, Hitomi Inada and Satoshi Tsuchida, Hitomi Inada and Tetsushi Tachikawa, Soushi Kato and Satoshi Tsuchida, Tetsushi Tachikawa and Satoshi Tsuchida, Tetsushi Tachikawa and Takahiro Kawashima, Ryosuke Nakamura and Hirokazu Yamamoto, Ryosuke Nakamura and Satoshi Tsuchida, Kurtis J. Thome and Xiaoxiong Xiong, Kurtis J. Thome and Satoshi Tsuchida, Hirokazu Yamamoto and Takahiro Kawashima, Hirokazu Yamamoto and Satoshi Tsuchida, Satoshi Tsuchida and Takahiro Kawashima.\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\": \"Naotaka Yamamoto\", \"id\": 391456}, {\"name\": \"An-Ming Wu\", \"id\": 347361}, {\"name\": \"Nischal Mishra\", \"id\": 617824}, {\"name\": \"Gyanesh Chander\", \"id\": 793475}, {\"name\": \"Dennis L. Helder\", \"id\": 605187}, {\"name\": \"Soushi Kato\", \"id\": 819720}, {\"name\": \"Tetsushi Tachikawa\", \"id\": 581514}, {\"name\": \"Satoshi Tsuchida\", \"id\": 560697}, {\"name\": \"Ryosuke Nakamura\", \"id\": 351313}, {\"name\": \"Kurtis J. Thome\", \"id\": 244786}, {\"name\": \"Hirokazu Yamamoto\", \"id\": 560695}, {\"name\": \"Xiaoxiong Xiong\", \"id\": 377368}, {\"name\": \"Hitomi Inada\", \"id\": 720089}, {\"name\": \"Takahiro Kawashima\", \"id\": 175229}], \"links\": [{\"source\": 391456, \"target\": 351313}, {\"source\": 391456, \"target\": 560697}, {\"source\": 391456, \"target\": 560695}, {\"source\": 347361, \"target\": 560697}, {\"source\": 347361, \"target\": 793475}, {\"source\": 617824, \"target\": 377368}, {\"source\": 617824, \"target\": 605187}, {\"source\": 617824, \"target\": 244786}, {\"source\": 617824, \"target\": 793475}, {\"source\": 793475, \"target\": 351313}, {\"source\": 793475, \"target\": 377368}, {\"source\": 793475, \"target\": 560697}, {\"source\": 793475, \"target\": 605187}, {\"source\": 793475, \"target\": 244786}, {\"source\": 793475, \"target\": 819720}, {\"source\": 605187, \"target\": 244786}, {\"source\": 605187, \"target\": 377368}, {\"source\": 819720, \"target\": 560697}, {\"source\": 581514, \"target\": 560697}, {\"source\": 581514, \"target\": 175229}, {\"source\": 581514, \"target\": 720089}, {\"source\": 560697, \"target\": 351313}, {\"source\": 560697, \"target\": 560695}, {\"source\": 560697, \"target\": 175229}, {\"source\": 560697, \"target\": 244786}, {\"source\": 560697, \"target\": 720089}, {\"source\": 351313, \"target\": 560695}, {\"source\": 244786, \"target\": 377368}, {\"source\": 560695, \"target\": 175229}, {\"source\": 560695, \"target\": 720089}]}",
"id": 203,
"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: Naotaka Yamamoto, An-Ming Wu, Nischal Mishra, Gyanesh Chander, Dennis L. Helder, Hitomi Inada, Soushi Kato, Tetsushi Tachikawa, Ryosuke Nakamura, Kurtis J. Thome, Hirokazu Yamamoto, Xiaoxiong Xiong, Satoshi Tsuchida, Takahiro Kawashima\n- Research collaborations between these authors: Naotaka Yamamoto and Ryosuke Nakamura, Naotaka Yamamoto and Satoshi Tsuchida, Naotaka Yamamoto and Hirokazu Yamamoto, An-Ming Wu and Satoshi Tsuchida, An-Ming Wu and Gyanesh Chander, Nischal Mishra and Xiaoxiong Xiong, Nischal Mishra and Dennis L. Helder, Nischal Mishra and Kurtis J. Thome, Nischal Mishra and Gyanesh Chander, Gyanesh Chander and Ryosuke Nakamura, Gyanesh Chander and Xiaoxiong Xiong, Gyanesh Chander and Satoshi Tsuchida, Gyanesh Chander and Dennis L. Helder, Gyanesh Chander and Kurtis J. Thome, Gyanesh Chander and Soushi Kato, Dennis L. Helder and Kurtis J. Thome, Dennis L. Helder and Xiaoxiong Xiong, Hitomi Inada and Hirokazu Yamamoto, Hitomi Inada and Satoshi Tsuchida, Hitomi Inada and Tetsushi Tachikawa, Soushi Kato and Satoshi Tsuchida, Tetsushi Tachikawa and Satoshi Tsuchida, Tetsushi Tachikawa and Takahiro Kawashima, Ryosuke Nakamura and Hirokazu Yamamoto, Ryosuke Nakamura and Satoshi Tsuchida, Kurtis J. Thome and Xiaoxiong Xiong, Kurtis J. Thome and Satoshi Tsuchida, Hirokazu Yamamoto and Takahiro Kawashima, Hirokazu Yamamoto and Satoshi Tsuchida, Satoshi Tsuchida and Takahiro Kawashima.\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. Bellotti, Ernesto Lopez Torres, G. Gemme, A. Chincarini, Arthur W. Toga, Alessandra Retico, Piergiorgio Cerello, Zhuowen Tu, Maria Evelina Fantacci, Liana G. Apostolova, Amity E. Green, Nicola Amoroso, Sabina Tangaro, Francesco De Sensi\n- Research collaborations between these authors: R. Bellotti and Alessandra Retico, R. Bellotti and Maria Evelina Fantacci, R. Bellotti and Ernesto Lopez Torres, R. Bellotti and A. Chincarini, R. Bellotti and Piergiorgio Cerello, R. Bellotti and Nicola Amoroso, R. Bellotti and Sabina Tangaro, R. Bellotti and Arthur W. Toga, R. Bellotti and Zhuowen Tu, R. Bellotti and Liana G. Apostolova, R. Bellotti and Amity E. Green, R. Bellotti and G. Gemme, R. Bellotti and Francesco De Sensi, Ernesto Lopez Torres and Alessandra Retico, Ernesto Lopez Torres and Maria Evelina Fantacci, Ernesto Lopez Torres and Piergiorgio Cerello, Ernesto Lopez Torres and Sabina Tangaro, Ernesto Lopez Torres and A. Chincarini, G. Gemme and Maria Evelina Fantacci, G. Gemme and A. Chincarini, G. Gemme and Piergiorgio Cerello, A. Chincarini and Arthur W. Toga, A. Chincarini and Zhuowen Tu, A. Chincarini and Alessandra Retico, A. Chincarini and Maria Evelina Fantacci, A. Chincarini and Piergiorgio Cerello, A. Chincarini and Liana G. Apostolova, A. Chincarini and Amity E. Green, A. Chincarini and Nicola Amoroso, A. Chincarini and Sabina Tangaro, A. Chincarini and Francesco De Sensi, Arthur W. Toga and Zhuowen Tu, Arthur W. Toga and Liana G. Apostolova, Arthur W. Toga and Amity E. Green, Arthur W. Toga and Nicola Amoroso, Arthur W. Toga and Sabina Tangaro, Alessandra Retico and Maria Evelina Fantacci, Alessandra Retico and Piergiorgio Cerello, Alessandra Retico and Sabina Tangaro, Piergiorgio Cerello and Maria Evelina Fantacci, Piergiorgio Cerello and Sabina Tangaro, Zhuowen Tu and Liana G. Apostolova, Zhuowen Tu and Amity E. Green, Zhuowen Tu and Nicola Amoroso, Zhuowen Tu and Sabina Tangaro, Maria Evelina Fantacci and Sabina Tangaro, Liana G. Apostolova and Amity E. Green, Liana G. Apostolova and Nicola Amoroso, Liana G. Apostolova and Sabina Tangaro, Amity E. Green and Nicola Amoroso, Amity E. Green and Sabina Tangaro, Nicola Amoroso and Sabina Tangaro, Nicola Amoroso and Francesco De Sensi, Sabina Tangaro and Francesco De Sensi.\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\": \"R. Bellotti\", \"id\": 409472}, {\"name\": \"Ernesto Lopez Torres\", \"id\": 394689}, {\"name\": \"G. Gemme\", \"id\": 444576}, {\"name\": \"A. Chincarini\", \"id\": 394691}, {\"name\": \"Arthur W. Toga\", \"id\": 24773}, {\"name\": \"Alessandra Retico\", \"id\": 274118}, {\"name\": \"Piergiorgio Cerello\", \"id\": 394695}, {\"name\": \"Zhuowen Tu\", \"id\": 65702}, {\"name\": \"Maria Evelina Fantacci\", \"id\": 365550}, {\"name\": \"Liana G. Apostolova\", \"id\": 397622}, {\"name\": \"Amity E. Green\", \"id\": 397623}, {\"name\": \"Nicola Amoroso\", \"id\": 409466}, {\"name\": \"Sabina Tangaro\", \"id\": 409470}, {\"name\": \"Francesco De Sensi\", \"id\": 444575}], \"links\": [{\"source\": 409472, \"target\": 274118}, {\"source\": 409472, \"target\": 365550}, {\"source\": 409472, \"target\": 394689}, {\"source\": 409472, \"target\": 394691}, {\"source\": 409472, \"target\": 394695}, {\"source\": 409472, \"target\": 409466}, {\"source\": 409472, \"target\": 409470}, {\"source\": 409472, \"target\": 24773}, {\"source\": 409472, \"target\": 65702}, {\"source\": 409472, \"target\": 397622}, {\"source\": 409472, \"target\": 397623}, {\"source\": 409472, \"target\": 444576}, {\"source\": 409472, \"target\": 444575}, {\"source\": 394689, \"target\": 274118}, {\"source\": 394689, \"target\": 365550}, {\"source\": 394689, \"target\": 394695}, {\"source\": 394689, \"target\": 409470}, {\"source\": 394689, \"target\": 394691}, {\"source\": 444576, \"target\": 365550}, {\"source\": 444576, \"target\": 394691}, {\"source\": 444576, \"target\": 394695}, {\"source\": 394691, \"target\": 24773}, {\"source\": 394691, \"target\": 65702}, {\"source\": 394691, \"target\": 274118}, {\"source\": 394691, \"target\": 365550}, {\"source\": 394691, \"target\": 394695}, {\"source\": 394691, \"target\": 397622}, {\"source\": 394691, \"target\": 397623}, {\"source\": 394691, \"target\": 409466}, {\"source\": 394691, \"target\": 409470}, {\"source\": 394691, \"target\": 444575}, {\"source\": 24773, \"target\": 65702}, {\"source\": 24773, \"target\": 397622}, {\"source\": 24773, \"target\": 397623}, {\"source\": 24773, \"target\": 409466}, {\"source\": 24773, \"target\": 409470}, {\"source\": 274118, \"target\": 365550}, {\"source\": 274118, \"target\": 394695}, {\"source\": 274118, \"target\": 409470}, {\"source\": 394695, \"target\": 365550}, {\"source\": 394695, \"target\": 409470}, {\"source\": 65702, \"target\": 397622}, {\"source\": 65702, \"target\": 397623}, {\"source\": 65702, \"target\": 409466}, {\"source\": 65702, \"target\": 409470}, {\"source\": 365550, \"target\": 409470}, {\"source\": 397622, \"target\": 397623}, {\"source\": 397622, \"target\": 409466}, {\"source\": 397622, \"target\": 409470}, {\"source\": 397623, \"target\": 409466}, {\"source\": 397623, \"target\": 409470}, {\"source\": 409466, \"target\": 409470}, {\"source\": 409466, \"target\": 444575}, {\"source\": 409470, \"target\": 444575}]}",
"id": 1821,
"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. Bellotti, Ernesto Lopez Torres, G. Gemme, A. Chincarini, Arthur W. Toga, Alessandra Retico, Piergiorgio Cerello, Zhuowen Tu, Maria Evelina Fantacci, Liana G. Apostolova, Amity E. Green, Nicola Amoroso, Sabina Tangaro, Francesco De Sensi\n- Research collaborations between these authors: R. Bellotti and Alessandra Retico, R. Bellotti and Maria Evelina Fantacci, R. Bellotti and Ernesto Lopez Torres, R. Bellotti and A. Chincarini, R. Bellotti and Piergiorgio Cerello, R. Bellotti and Nicola Amoroso, R. Bellotti and Sabina Tangaro, R. Bellotti and Arthur W. Toga, R. Bellotti and Zhuowen Tu, R. Bellotti and Liana G. Apostolova, R. Bellotti and Amity E. Green, R. Bellotti and G. Gemme, R. Bellotti and Francesco De Sensi, Ernesto Lopez Torres and Alessandra Retico, Ernesto Lopez Torres and Maria Evelina Fantacci, Ernesto Lopez Torres and Piergiorgio Cerello, Ernesto Lopez Torres and Sabina Tangaro, Ernesto Lopez Torres and A. Chincarini, G. Gemme and Maria Evelina Fantacci, G. Gemme and A. Chincarini, G. Gemme and Piergiorgio Cerello, A. Chincarini and Arthur W. Toga, A. Chincarini and Zhuowen Tu, A. Chincarini and Alessandra Retico, A. Chincarini and Maria Evelina Fantacci, A. Chincarini and Piergiorgio Cerello, A. Chincarini and Liana G. Apostolova, A. Chincarini and Amity E. Green, A. Chincarini and Nicola Amoroso, A. Chincarini and Sabina Tangaro, A. Chincarini and Francesco De Sensi, Arthur W. Toga and Zhuowen Tu, Arthur W. Toga and Liana G. Apostolova, Arthur W. Toga and Amity E. Green, Arthur W. Toga and Nicola Amoroso, Arthur W. Toga and Sabina Tangaro, Alessandra Retico and Maria Evelina Fantacci, Alessandra Retico and Piergiorgio Cerello, Alessandra Retico and Sabina Tangaro, Piergiorgio Cerello and Maria Evelina Fantacci, Piergiorgio Cerello and Sabina Tangaro, Zhuowen Tu and Liana G. Apostolova, Zhuowen Tu and Amity E. Green, Zhuowen Tu and Nicola Amoroso, Zhuowen Tu and Sabina Tangaro, Maria Evelina Fantacci and Sabina Tangaro, Liana G. Apostolova and Amity E. Green, Liana G. Apostolova and Nicola Amoroso, Liana G. Apostolova and Sabina Tangaro, Amity E. Green and Nicola Amoroso, Amity E. Green and Sabina Tangaro, Nicola Amoroso and Sabina Tangaro, Nicola Amoroso and Francesco De Sensi, Sabina Tangaro and Francesco De Sensi.\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: Mohamad Sawan, Xing Li, Gert Cauwenberghs, Roman Genov, Jose Luis Perez Velazquez, Jerald Yoo, Nitish V. Thakor, Mehdi Kiani, Hyung-Min Lee, Maysam Ghovanloo, Hangue Park, Gaurav Bawa, Wing-Hung Ki, Uei-Ming Jow\n- Research collaborations between these authors: Mohamad Sawan and Gert Cauwenberghs, Mohamad Sawan and Nitish V. Thakor, Mohamad Sawan and Wing-Hung Ki, Mohamad Sawan and Roman Genov, Mohamad Sawan and Maysam Ghovanloo, Mohamad Sawan and Hyung-Min Lee, Mohamad Sawan and Mehdi Kiani, Mohamad Sawan and Uei-Ming Jow, Mohamad Sawan and Jerald Yoo, Mohamad Sawan and Jose Luis Perez Velazquez, Xing Li and Wing-Hung Ki, Xing Li and Maysam Ghovanloo, Xing Li and Hyung-Min Lee, Xing Li and Uei-Ming Jow, Gert Cauwenberghs and Nitish V. Thakor, Gert Cauwenberghs and Jerald Yoo, Gert Cauwenberghs and Roman Genov, Gert Cauwenberghs and Maysam Ghovanloo, Gert Cauwenberghs and Hyung-Min Lee, Roman Genov and Nitish V. Thakor, Roman Genov and Jerald Yoo, Roman Genov and Maysam Ghovanloo, Roman Genov and Hyung-Min Lee, Roman Genov and Jose Luis Perez Velazquez, Roman Genov and Mehdi Kiani, Roman Genov and Uei-Ming Jow, Jose Luis Perez Velazquez and Nitish V. Thakor, Jose Luis Perez Velazquez and Maysam Ghovanloo, Jose Luis Perez Velazquez and Hyung-Min Lee, Jose Luis Perez Velazquez and Mehdi Kiani, Jose Luis Perez Velazquez and Uei-Ming Jow, Jerald Yoo and Maysam Ghovanloo, Jerald Yoo and Hyung-Min Lee, Nitish V. Thakor and Maysam Ghovanloo, Nitish V. Thakor and Uei-Ming Jow, Nitish V. Thakor and Hyung-Min Lee, Mehdi Kiani and Wing-Hung Ki, Mehdi Kiani and Maysam Ghovanloo, Mehdi Kiani and Hyung-Min Lee, Mehdi Kiani and Uei-Ming Jow, Hyung-Min Lee and Wing-Hung Ki, Hyung-Min Lee and Maysam Ghovanloo, Hyung-Min Lee and Uei-Ming Jow, Hyung-Min Lee and Gaurav Bawa, Hyung-Min Lee and Hangue Park, Maysam Ghovanloo and Wing-Hung Ki, Maysam Ghovanloo and Uei-Ming Jow, Maysam Ghovanloo and Gaurav Bawa, Maysam Ghovanloo and Hangue Park, Wing-Hung Ki and Uei-Ming Jow.\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\": \"Mohamad Sawan\", \"id\": 182690}, {\"name\": \"Xing Li\", \"id\": 14373}, {\"name\": \"Gert Cauwenberghs\", \"id\": 131943}, {\"name\": \"Roman Genov\", \"id\": 375081}, {\"name\": \"Jose Luis Perez Velazquez\", \"id\": 589066}, {\"name\": \"Jerald Yoo\", \"id\": 324972}, {\"name\": \"Nitish V. Thakor\", \"id\": 200845}, {\"name\": \"Mehdi Kiani\", \"id\": 618255}, {\"name\": \"Hyung-Min Lee\", \"id\": 514127}, {\"name\": \"Maysam Ghovanloo\", \"id\": 417107}, {\"name\": \"Hangue Park\", \"id\": 662613}, {\"name\": \"Gaurav Bawa\", \"id\": 824823}, {\"name\": \"Wing-Hung Ki\", \"id\": 220280}, {\"name\": \"Uei-Ming Jow\", \"id\": 793465}], \"links\": [{\"source\": 182690, \"target\": 131943}, {\"source\": 182690, \"target\": 200845}, {\"source\": 182690, \"target\": 220280}, {\"source\": 182690, \"target\": 375081}, {\"source\": 182690, \"target\": 417107}, {\"source\": 182690, \"target\": 514127}, {\"source\": 182690, \"target\": 618255}, {\"source\": 182690, \"target\": 793465}, {\"source\": 182690, \"target\": 324972}, {\"source\": 182690, \"target\": 589066}, {\"source\": 14373, \"target\": 220280}, {\"source\": 14373, \"target\": 417107}, {\"source\": 14373, \"target\": 514127}, {\"source\": 14373, \"target\": 793465}, {\"source\": 131943, \"target\": 200845}, {\"source\": 131943, \"target\": 324972}, {\"source\": 131943, \"target\": 375081}, {\"source\": 131943, \"target\": 417107}, {\"source\": 131943, \"target\": 514127}, {\"source\": 375081, \"target\": 200845}, {\"source\": 375081, \"target\": 324972}, {\"source\": 375081, \"target\": 417107}, {\"source\": 375081, \"target\": 514127}, {\"source\": 375081, \"target\": 589066}, {\"source\": 375081, \"target\": 618255}, {\"source\": 375081, \"target\": 793465}, {\"source\": 589066, \"target\": 200845}, {\"source\": 589066, \"target\": 417107}, {\"source\": 589066, \"target\": 514127}, {\"source\": 589066, \"target\": 618255}, {\"source\": 589066, \"target\": 793465}, {\"source\": 324972, \"target\": 417107}, {\"source\": 324972, \"target\": 514127}, {\"source\": 200845, \"target\": 417107}, {\"source\": 200845, \"target\": 793465}, {\"source\": 200845, \"target\": 514127}, {\"source\": 618255, \"target\": 220280}, {\"source\": 618255, \"target\": 417107}, {\"source\": 618255, \"target\": 514127}, {\"source\": 618255, \"target\": 793465}, {\"source\": 514127, \"target\": 220280}, {\"source\": 514127, \"target\": 417107}, {\"source\": 514127, \"target\": 793465}, {\"source\": 514127, \"target\": 824823}, {\"source\": 514127, \"target\": 662613}, {\"source\": 417107, \"target\": 220280}, {\"source\": 417107, \"target\": 793465}, {\"source\": 417107, \"target\": 824823}, {\"source\": 417107, \"target\": 662613}, {\"source\": 220280, \"target\": 793465}]}",
"id": 752,
"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: Mohamad Sawan, Xing Li, Gert Cauwenberghs, Roman Genov, Jose Luis Perez Velazquez, Jerald Yoo, Nitish V. Thakor, Mehdi Kiani, Hyung-Min Lee, Maysam Ghovanloo, Hangue Park, Gaurav Bawa, Wing-Hung Ki, Uei-Ming Jow\n- Research collaborations between these authors: Mohamad Sawan and Gert Cauwenberghs, Mohamad Sawan and Nitish V. Thakor, Mohamad Sawan and Wing-Hung Ki, Mohamad Sawan and Roman Genov, Mohamad Sawan and Maysam Ghovanloo, Mohamad Sawan and Hyung-Min Lee, Mohamad Sawan and Mehdi Kiani, Mohamad Sawan and Uei-Ming Jow, Mohamad Sawan and Jerald Yoo, Mohamad Sawan and Jose Luis Perez Velazquez, Xing Li and Wing-Hung Ki, Xing Li and Maysam Ghovanloo, Xing Li and Hyung-Min Lee, Xing Li and Uei-Ming Jow, Gert Cauwenberghs and Nitish V. Thakor, Gert Cauwenberghs and Jerald Yoo, Gert Cauwenberghs and Roman Genov, Gert Cauwenberghs and Maysam Ghovanloo, Gert Cauwenberghs and Hyung-Min Lee, Roman Genov and Nitish V. Thakor, Roman Genov and Jerald Yoo, Roman Genov and Maysam Ghovanloo, Roman Genov and Hyung-Min Lee, Roman Genov and Jose Luis Perez Velazquez, Roman Genov and Mehdi Kiani, Roman Genov and Uei-Ming Jow, Jose Luis Perez Velazquez and Nitish V. Thakor, Jose Luis Perez Velazquez and Maysam Ghovanloo, Jose Luis Perez Velazquez and Hyung-Min Lee, Jose Luis Perez Velazquez and Mehdi Kiani, Jose Luis Perez Velazquez and Uei-Ming Jow, Jerald Yoo and Maysam Ghovanloo, Jerald Yoo and Hyung-Min Lee, Nitish V. Thakor and Maysam Ghovanloo, Nitish V. Thakor and Uei-Ming Jow, Nitish V. Thakor and Hyung-Min Lee, Mehdi Kiani and Wing-Hung Ki, Mehdi Kiani and Maysam Ghovanloo, Mehdi Kiani and Hyung-Min Lee, Mehdi Kiani and Uei-Ming Jow, Hyung-Min Lee and Wing-Hung Ki, Hyung-Min Lee and Maysam Ghovanloo, Hyung-Min Lee and Uei-Ming Jow, Hyung-Min Lee and Gaurav Bawa, Hyung-Min Lee and Hangue Park, Maysam Ghovanloo and Wing-Hung Ki, Maysam Ghovanloo and Uei-Ming Jow, Maysam Ghovanloo and Gaurav Bawa, Maysam Ghovanloo and Hangue Park, Wing-Hung Ki and Uei-Ming Jow.\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 Chang, Yaohua Wang, Wilson W. L. Fung, Jung Ho Ahn, B. Krashinsky, Krste Asanovic, Hu Chen, William J. Dally, Shuming Chen, Krisztián Flautner, Brucek Khailany, George L. Yuan, Kai Zhang, Scott A. Mahlke\n- Research collaborations between these authors: Andrew Chang and Krste Asanovic, Andrew Chang and Shuming Chen, Andrew Chang and William J. Dally, Andrew Chang and Yaohua Wang, Yaohua Wang and Shuming Chen, Yaohua Wang and Krste Asanovic, Yaohua Wang and Kai Zhang, Yaohua Wang and Krisztián Flautner, Yaohua Wang and Hu Chen, Yaohua Wang and Scott A. Mahlke, Yaohua Wang and William J. Dally, Yaohua Wang and Brucek Khailany, Yaohua Wang and Wilson W. L. Fung, Yaohua Wang and George L. Yuan, Yaohua Wang and B. Krashinsky, Wilson W. L. Fung and Shuming Chen, Wilson W. L. Fung and Scott A. Mahlke, Wilson W. L. Fung and William J. Dally, Wilson W. L. Fung and George L. Yuan, Jung Ho Ahn and Krste Asanovic, Jung Ho Ahn and Scott A. Mahlke, Jung Ho Ahn and William J. Dally, Jung Ho Ahn and Brucek Khailany, B. Krashinsky and Shuming Chen, Krste Asanovic and Scott A. Mahlke, Krste Asanovic and William J. Dally, Krste Asanovic and Brucek Khailany, Krste Asanovic and Shuming Chen, Hu Chen and Krisztián Flautner, Hu Chen and Shuming Chen, Hu Chen and Scott A. Mahlke, Hu Chen and William J. Dally, Hu Chen and Brucek Khailany, William J. Dally and Kai Zhang, William J. Dally and Krisztián Flautner, William J. Dally and Shuming Chen, William J. Dally and Scott A. Mahlke, William J. Dally and Brucek Khailany, William J. Dally and George L. Yuan, Shuming Chen and Kai Zhang, Shuming Chen and Krisztián Flautner, Shuming Chen and Scott A. Mahlke, Shuming Chen and Brucek Khailany, Krisztián Flautner and Kai Zhang, Krisztián Flautner and Scott A. Mahlke, Krisztián Flautner and Brucek Khailany, Brucek Khailany and Kai Zhang, Brucek Khailany and Scott A. Mahlke, George L. Yuan and Scott A. Mahlke, Kai Zhang and Scott A. Mahlke.\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\": \"Andrew Chang\", \"id\": 325856}, {\"name\": \"Yaohua Wang\", \"id\": 614785}, {\"name\": \"Scott A. Mahlke\", \"id\": 239870}, {\"name\": \"Wilson W. L. Fung\", \"id\": 326147}, {\"name\": \"B. Krashinsky\", \"id\": 1057093}, {\"name\": \"Krste Asanovic\", \"id\": 26412}, {\"name\": \"William J. Dally\", \"id\": 262773}, {\"name\": \"Shuming Chen\", \"id\": 98166}, {\"name\": \"Hu Chen\", \"id\": 92183}, {\"name\": \"Brucek Khailany\", \"id\": 264446}, {\"name\": \"George L. Yuan\", \"id\": 564858}, {\"name\": \"Kai Zhang\", \"id\": 38651}, {\"name\": \"Jung Ho Ahn\", \"id\": 421278}, {\"name\": \"Kriszti\\u00e1n Flautner\", \"id\": 45431}], \"links\": [{\"source\": 325856, \"target\": 26412}, {\"source\": 325856, \"target\": 98166}, {\"source\": 325856, \"target\": 262773}, {\"source\": 325856, \"target\": 614785}, {\"source\": 614785, \"target\": 98166}, {\"source\": 614785, \"target\": 26412}, {\"source\": 614785, \"target\": 38651}, {\"source\": 614785, \"target\": 45431}, {\"source\": 614785, \"target\": 92183}, {\"source\": 614785, \"target\": 239870}, {\"source\": 614785, \"target\": 262773}, {\"source\": 614785, \"target\": 264446}, {\"source\": 614785, \"target\": 326147}, {\"source\": 614785, \"target\": 564858}, {\"source\": 614785, \"target\": 1057093}, {\"source\": 239870, \"target\": 26412}, {\"source\": 239870, \"target\": 38651}, {\"source\": 239870, \"target\": 45431}, {\"source\": 239870, \"target\": 92183}, {\"source\": 239870, \"target\": 98166}, {\"source\": 239870, \"target\": 262773}, {\"source\": 239870, \"target\": 264446}, {\"source\": 239870, \"target\": 326147}, {\"source\": 239870, \"target\": 421278}, {\"source\": 239870, \"target\": 564858}, {\"source\": 326147, \"target\": 98166}, {\"source\": 326147, \"target\": 262773}, {\"source\": 326147, \"target\": 564858}, {\"source\": 1057093, \"target\": 98166}, {\"source\": 26412, \"target\": 262773}, {\"source\": 26412, \"target\": 264446}, {\"source\": 26412, \"target\": 421278}, {\"source\": 26412, \"target\": 98166}, {\"source\": 262773, \"target\": 38651}, {\"source\": 262773, \"target\": 45431}, {\"source\": 262773, \"target\": 92183}, {\"source\": 262773, \"target\": 98166}, {\"source\": 262773, \"target\": 264446}, {\"source\": 262773, \"target\": 421278}, {\"source\": 262773, \"target\": 564858}, {\"source\": 98166, \"target\": 38651}, {\"source\": 98166, \"target\": 92183}, {\"source\": 98166, \"target\": 45431}, {\"source\": 98166, \"target\": 264446}, {\"source\": 92183, \"target\": 45431}, {\"source\": 92183, \"target\": 264446}, {\"source\": 264446, \"target\": 38651}, {\"source\": 264446, \"target\": 45431}, {\"source\": 264446, \"target\": 421278}, {\"source\": 38651, \"target\": 45431}]}",
"id": 2434,
"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 Chang, Yaohua Wang, Wilson W. L. Fung, Jung Ho Ahn, B. Krashinsky, Krste Asanovic, Hu Chen, William J. Dally, Shuming Chen, Krisztián Flautner, Brucek Khailany, George L. Yuan, Kai Zhang, Scott A. Mahlke\n- Research collaborations between these authors: Andrew Chang and Krste Asanovic, Andrew Chang and Shuming Chen, Andrew Chang and William J. Dally, Andrew Chang and Yaohua Wang, Yaohua Wang and Shuming Chen, Yaohua Wang and Krste Asanovic, Yaohua Wang and Kai Zhang, Yaohua Wang and Krisztián Flautner, Yaohua Wang and Hu Chen, Yaohua Wang and Scott A. Mahlke, Yaohua Wang and William J. Dally, Yaohua Wang and Brucek Khailany, Yaohua Wang and Wilson W. L. Fung, Yaohua Wang and George L. Yuan, Yaohua Wang and B. Krashinsky, Wilson W. L. Fung and Shuming Chen, Wilson W. L. Fung and Scott A. Mahlke, Wilson W. L. Fung and William J. Dally, Wilson W. L. Fung and George L. Yuan, Jung Ho Ahn and Krste Asanovic, Jung Ho Ahn and Scott A. Mahlke, Jung Ho Ahn and William J. Dally, Jung Ho Ahn and Brucek Khailany, B. Krashinsky and Shuming Chen, Krste Asanovic and Scott A. Mahlke, Krste Asanovic and William J. Dally, Krste Asanovic and Brucek Khailany, Krste Asanovic and Shuming Chen, Hu Chen and Krisztián Flautner, Hu Chen and Shuming Chen, Hu Chen and Scott A. Mahlke, Hu Chen and William J. Dally, Hu Chen and Brucek Khailany, William J. Dally and Kai Zhang, William J. Dally and Krisztián Flautner, William J. Dally and Shuming Chen, William J. Dally and Scott A. Mahlke, William J. Dally and Brucek Khailany, William J. Dally and George L. Yuan, Shuming Chen and Kai Zhang, Shuming Chen and Krisztián Flautner, Shuming Chen and Scott A. Mahlke, Shuming Chen and Brucek Khailany, Krisztián Flautner and Kai Zhang, Krisztián Flautner and Scott A. Mahlke, Krisztián Flautner and Brucek Khailany, Brucek Khailany and Kai Zhang, Brucek Khailany and Scott A. Mahlke, George L. Yuan and Scott A. Mahlke, Kai Zhang and Scott A. Mahlke.\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: Kwan-Yee Kenneth Wong, Peter F. Sturm, R. Swaninathan, Zhanyi Hu, Daniel Cremers, Srikumar Ramalingam, Jingyi Yu, Sing Bing Kang, Nanning Zheng, Shmuel Peleg, Rama Chellappa, Steven M. Seitz, Richard Szeliski, Yair Weiss\n- Research collaborations between these authors: Kwan-Yee Kenneth Wong and Daniel Cremers, Kwan-Yee Kenneth Wong and Richard Szeliski, Kwan-Yee Kenneth Wong and Steven M. Seitz, Kwan-Yee Kenneth Wong and Peter F. Sturm, Kwan-Yee Kenneth Wong and Srikumar Ramalingam, Peter F. Sturm and Jingyi Yu, Peter F. Sturm and Richard Szeliski, Peter F. Sturm and Daniel Cremers, Peter F. Sturm and Steven M. Seitz, Peter F. Sturm and Srikumar Ramalingam, Peter F. Sturm and Sing Bing Kang, Peter F. Sturm and Zhanyi Hu, Peter F. Sturm and Shmuel Peleg, Peter F. Sturm and R. Swaninathan, R. Swaninathan and Jingyi Yu, R. Swaninathan and Srikumar Ramalingam, Zhanyi Hu and Srikumar Ramalingam, Zhanyi Hu and Richard Szeliski, Zhanyi Hu and Steven M. Seitz, Zhanyi Hu and Sing Bing Kang, Daniel Cremers and Richard Szeliski, Daniel Cremers and Steven M. Seitz, Daniel Cremers and Srikumar Ramalingam, Srikumar Ramalingam and Rama Chellappa, Srikumar Ramalingam and Jingyi Yu, Srikumar Ramalingam and Richard Szeliski, Srikumar Ramalingam and Steven M. Seitz, Srikumar Ramalingam and Sing Bing Kang, Srikumar Ramalingam and Shmuel Peleg, Jingyi Yu and Rama Chellappa, Jingyi Yu and Nanning Zheng, Jingyi Yu and Richard Szeliski, Jingyi Yu and Steven M. Seitz, Jingyi Yu and Sing Bing Kang, Jingyi Yu and Yair Weiss, Jingyi Yu and Shmuel Peleg, Sing Bing Kang and Nanning Zheng, Sing Bing Kang and Richard Szeliski, Sing Bing Kang and Steven M. Seitz, Sing Bing Kang and Yair Weiss, Sing Bing Kang and Shmuel Peleg, Nanning Zheng and Rama Chellappa, Nanning Zheng and Richard Szeliski, Nanning Zheng and Steven M. Seitz, Nanning Zheng and Yair Weiss, Shmuel Peleg and Richard Szeliski, Shmuel Peleg and Steven M. Seitz, Shmuel Peleg and Yair Weiss, Rama Chellappa and Richard Szeliski, Rama Chellappa and Steven M. Seitz, Rama Chellappa and Yair Weiss, Steven M. Seitz and Richard Szeliski, Steven M. Seitz and Yair Weiss, Richard Szeliski and Yair Weiss.\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\": \"Kwan-Yee Kenneth Wong\", \"id\": 201795}, {\"name\": \"Peter F. Sturm\", \"id\": 37575}, {\"name\": \"R. Swaninathan\", \"id\": 1052424}, {\"name\": \"Daniel Cremers\", \"id\": 12814}, {\"name\": \"Zhanyi Hu\", \"id\": 173518}, {\"name\": \"Srikumar Ramalingam\", \"id\": 94896}, {\"name\": \"Jingyi Yu\", \"id\": 20273}, {\"name\": \"Sing Bing Kang\", \"id\": 150385}, {\"name\": \"Nanning Zheng\", \"id\": 17235}, {\"name\": \"Shmuel Peleg\", \"id\": 198488}, {\"name\": \"Rama Chellappa\", \"id\": 6938}, {\"name\": \"Steven M. Seitz\", \"id\": 36892}, {\"name\": \"Richard Szeliski\", \"id\": 26525}, {\"name\": \"Yair Weiss\", \"id\": 156767}], \"links\": [{\"source\": 201795, \"target\": 12814}, {\"source\": 201795, \"target\": 26525}, {\"source\": 201795, \"target\": 36892}, {\"source\": 201795, \"target\": 37575}, {\"source\": 201795, \"target\": 94896}, {\"source\": 37575, \"target\": 20273}, {\"source\": 37575, \"target\": 26525}, {\"source\": 37575, \"target\": 12814}, {\"source\": 37575, \"target\": 36892}, {\"source\": 37575, \"target\": 94896}, {\"source\": 37575, \"target\": 150385}, {\"source\": 37575, \"target\": 173518}, {\"source\": 37575, \"target\": 198488}, {\"source\": 37575, \"target\": 1052424}, {\"source\": 1052424, \"target\": 20273}, {\"source\": 1052424, \"target\": 94896}, {\"source\": 12814, \"target\": 26525}, {\"source\": 12814, \"target\": 36892}, {\"source\": 12814, \"target\": 94896}, {\"source\": 173518, \"target\": 94896}, {\"source\": 173518, \"target\": 26525}, {\"source\": 173518, \"target\": 36892}, {\"source\": 173518, \"target\": 150385}, {\"source\": 94896, \"target\": 6938}, {\"source\": 94896, \"target\": 20273}, {\"source\": 94896, \"target\": 26525}, {\"source\": 94896, \"target\": 36892}, {\"source\": 94896, \"target\": 150385}, {\"source\": 94896, \"target\": 198488}, {\"source\": 20273, \"target\": 6938}, {\"source\": 20273, \"target\": 17235}, {\"source\": 20273, \"target\": 26525}, {\"source\": 20273, \"target\": 36892}, {\"source\": 20273, \"target\": 150385}, {\"source\": 20273, \"target\": 156767}, {\"source\": 20273, \"target\": 198488}, {\"source\": 150385, \"target\": 17235}, {\"source\": 150385, \"target\": 26525}, {\"source\": 150385, \"target\": 36892}, {\"source\": 150385, \"target\": 156767}, {\"source\": 150385, \"target\": 198488}, {\"source\": 17235, \"target\": 6938}, {\"source\": 17235, \"target\": 26525}, {\"source\": 17235, \"target\": 36892}, {\"source\": 17235, \"target\": 156767}, {\"source\": 198488, \"target\": 26525}, {\"source\": 198488, \"target\": 36892}, {\"source\": 198488, \"target\": 156767}, {\"source\": 6938, \"target\": 26525}, {\"source\": 6938, \"target\": 36892}, {\"source\": 6938, \"target\": 156767}, {\"source\": 36892, \"target\": 26525}, {\"source\": 36892, \"target\": 156767}, {\"source\": 26525, \"target\": 156767}]}",
"id": 2114,
"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: Kwan-Yee Kenneth Wong, Peter F. Sturm, R. Swaninathan, Zhanyi Hu, Daniel Cremers, Srikumar Ramalingam, Jingyi Yu, Sing Bing Kang, Nanning Zheng, Shmuel Peleg, Rama Chellappa, Steven M. Seitz, Richard Szeliski, Yair Weiss\n- Research collaborations between these authors: Kwan-Yee Kenneth Wong and Daniel Cremers, Kwan-Yee Kenneth Wong and Richard Szeliski, Kwan-Yee Kenneth Wong and Steven M. Seitz, Kwan-Yee Kenneth Wong and Peter F. Sturm, Kwan-Yee Kenneth Wong and Srikumar Ramalingam, Peter F. Sturm and Jingyi Yu, Peter F. Sturm and Richard Szeliski, Peter F. Sturm and Daniel Cremers, Peter F. Sturm and Steven M. Seitz, Peter F. Sturm and Srikumar Ramalingam, Peter F. Sturm and Sing Bing Kang, Peter F. Sturm and Zhanyi Hu, Peter F. Sturm and Shmuel Peleg, Peter F. Sturm and R. Swaninathan, R. Swaninathan and Jingyi Yu, R. Swaninathan and Srikumar Ramalingam, Zhanyi Hu and Srikumar Ramalingam, Zhanyi Hu and Richard Szeliski, Zhanyi Hu and Steven M. Seitz, Zhanyi Hu and Sing Bing Kang, Daniel Cremers and Richard Szeliski, Daniel Cremers and Steven M. Seitz, Daniel Cremers and Srikumar Ramalingam, Srikumar Ramalingam and Rama Chellappa, Srikumar Ramalingam and Jingyi Yu, Srikumar Ramalingam and Richard Szeliski, Srikumar Ramalingam and Steven M. Seitz, Srikumar Ramalingam and Sing Bing Kang, Srikumar Ramalingam and Shmuel Peleg, Jingyi Yu and Rama Chellappa, Jingyi Yu and Nanning Zheng, Jingyi Yu and Richard Szeliski, Jingyi Yu and Steven M. Seitz, Jingyi Yu and Sing Bing Kang, Jingyi Yu and Yair Weiss, Jingyi Yu and Shmuel Peleg, Sing Bing Kang and Nanning Zheng, Sing Bing Kang and Richard Szeliski, Sing Bing Kang and Steven M. Seitz, Sing Bing Kang and Yair Weiss, Sing Bing Kang and Shmuel Peleg, Nanning Zheng and Rama Chellappa, Nanning Zheng and Richard Szeliski, Nanning Zheng and Steven M. Seitz, Nanning Zheng and Yair Weiss, Shmuel Peleg and Richard Szeliski, Shmuel Peleg and Steven M. Seitz, Shmuel Peleg and Yair Weiss, Rama Chellappa and Richard Szeliski, Rama Chellappa and Steven M. Seitz, Rama Chellappa and Yair Weiss, Steven M. Seitz and Richard Szeliski, Steven M. Seitz and Yair Weiss, Richard Szeliski and Yair Weiss.\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: Nilmini Wickramasinghe, Reinhold Haux, Rainer Röhrig, Dickson K. W. Chiu, Pirkko Nykänen, Matthias Gietzelt, Elske Ammenwerth, Michael Marschollek, Hans-Ulrich Prokosch, Heleen van der Sijs, Michael Rigby, Sebastian Garde, Petra Knaup, Martin Jung\n- Research collaborations between these authors: Nilmini Wickramasinghe and Elske Ammenwerth, Reinhold Haux and Sebastian Garde, Reinhold Haux and Michael Marschollek, Reinhold Haux and Elske Ammenwerth, Reinhold Haux and Hans-Ulrich Prokosch, Reinhold Haux and Petra Knaup, Reinhold Haux and Matthias Gietzelt, Reinhold Haux and Pirkko Nykänen, Reinhold Haux and Dickson K. W. Chiu, Reinhold Haux and Rainer Röhrig, Rainer Röhrig and Elske Ammenwerth, Dickson K. W. Chiu and Elske Ammenwerth, Pirkko Nykänen and Elske Ammenwerth, Pirkko Nykänen and Michael Rigby, Matthias Gietzelt and Michael Marschollek, Elske Ammenwerth and Michael Rigby, Elske Ammenwerth and Martin Jung, Elske Ammenwerth and Hans-Ulrich Prokosch, Elske Ammenwerth and Petra Knaup, Elske Ammenwerth and Heleen van der Sijs, Michael Marschollek and Petra Knaup, Hans-Ulrich Prokosch and Michael Rigby, Heleen van der Sijs and Martin Jung, Sebastian Garde and Petra Knaup.\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\": \"Nilmini Wickramasinghe\", \"id\": 3809}, {\"name\": \"Dickson K. W. Chiu\", \"id\": 78950}, {\"name\": \"Reinhold Haux\", \"id\": 4902}, {\"name\": \"Rainer R\\u00f6hrig\", \"id\": 84807}, {\"name\": \"Pirkko Nyk\\u00e4nen\", \"id\": 41513}, {\"name\": \"Matthias Gietzelt\", \"id\": 4903}, {\"name\": \"Elske Ammenwerth\", \"id\": 41515}, {\"name\": \"Michael Marschollek\", \"id\": 4906}, {\"name\": \"Hans-Ulrich Prokosch\", \"id\": 125769}, {\"name\": \"Heleen van der Sijs\", \"id\": 455596}, {\"name\": \"Michael Rigby\", \"id\": 41518}, {\"name\": \"Sebastian Garde\", \"id\": 337}, {\"name\": \"Petra Knaup\", \"id\": 311384}, {\"name\": \"Martin Jung\", \"id\": 53945}], \"links\": [{\"source\": 3809, \"target\": 41515}, {\"source\": 78950, \"target\": 4902}, {\"source\": 78950, \"target\": 41515}, {\"source\": 4902, \"target\": 337}, {\"source\": 4902, \"target\": 4906}, {\"source\": 4902, \"target\": 41515}, {\"source\": 4902, \"target\": 125769}, {\"source\": 4902, \"target\": 311384}, {\"source\": 4902, \"target\": 4903}, {\"source\": 4902, \"target\": 41513}, {\"source\": 4902, \"target\": 84807}, {\"source\": 84807, \"target\": 41515}, {\"source\": 41513, \"target\": 41515}, {\"source\": 41513, \"target\": 41518}, {\"source\": 4903, \"target\": 4906}, {\"source\": 41515, \"target\": 41518}, {\"source\": 41515, \"target\": 53945}, {\"source\": 41515, \"target\": 125769}, {\"source\": 41515, \"target\": 311384}, {\"source\": 41515, \"target\": 455596}, {\"source\": 4906, \"target\": 311384}, {\"source\": 125769, \"target\": 41518}, {\"source\": 455596, \"target\": 53945}, {\"source\": 337, \"target\": 311384}]}",
"id": 2721,
"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: Nilmini Wickramasinghe, Reinhold Haux, Rainer Röhrig, Dickson K. W. Chiu, Pirkko Nykänen, Matthias Gietzelt, Elske Ammenwerth, Michael Marschollek, Hans-Ulrich Prokosch, Heleen van der Sijs, Michael Rigby, Sebastian Garde, Petra Knaup, Martin Jung\n- Research collaborations between these authors: Nilmini Wickramasinghe and Elske Ammenwerth, Reinhold Haux and Sebastian Garde, Reinhold Haux and Michael Marschollek, Reinhold Haux and Elske Ammenwerth, Reinhold Haux and Hans-Ulrich Prokosch, Reinhold Haux and Petra Knaup, Reinhold Haux and Matthias Gietzelt, Reinhold Haux and Pirkko Nykänen, Reinhold Haux and Dickson K. W. Chiu, Reinhold Haux and Rainer Röhrig, Rainer Röhrig and Elske Ammenwerth, Dickson K. W. Chiu and Elske Ammenwerth, Pirkko Nykänen and Elske Ammenwerth, Pirkko Nykänen and Michael Rigby, Matthias Gietzelt and Michael Marschollek, Elske Ammenwerth and Michael Rigby, Elske Ammenwerth and Martin Jung, Elske Ammenwerth and Hans-Ulrich Prokosch, Elske Ammenwerth and Petra Knaup, Elske Ammenwerth and Heleen van der Sijs, Michael Marschollek and Petra Knaup, Hans-Ulrich Prokosch and Michael Rigby, Heleen van der Sijs and Martin Jung, Sebastian Garde and Petra Knaup.\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 Blecic, Arnaldo Cecchini, Wolfram Klingsch, Giuseppe Vizzari, Armin Seyfried, Tobias Kretz, Christian Rogsch, Jarosław Wąs, Stefania Bandini, Sara Manzoni, Danny Weyns, Lorenza Manenti, Marco Mamei, Katsuhiro Nishinari\n- Research collaborations between these authors: Ivan Blecic and Arnaldo Cecchini, Ivan Blecic and Stefania Bandini, Ivan Blecic and Giuseppe Vizzari, Arnaldo Cecchini and Stefania Bandini, Arnaldo Cecchini and Giuseppe Vizzari, Wolfram Klingsch and Stefania Bandini, Wolfram Klingsch and Giuseppe Vizzari, Wolfram Klingsch and Sara Manzoni, Wolfram Klingsch and Lorenza Manenti, Wolfram Klingsch and Armin Seyfried, Wolfram Klingsch and Tobias Kretz, Giuseppe Vizzari and Danny Weyns, Giuseppe Vizzari and Stefania Bandini, Giuseppe Vizzari and Jarosław Wąs, Giuseppe Vizzari and Marco Mamei, Giuseppe Vizzari and Sara Manzoni, Giuseppe Vizzari and Katsuhiro Nishinari, Giuseppe Vizzari and Lorenza Manenti, Giuseppe Vizzari and Armin Seyfried, Giuseppe Vizzari and Tobias Kretz, Giuseppe Vizzari and Christian Rogsch, Armin Seyfried and Stefania Bandini, Armin Seyfried and Jarosław Wąs, Armin Seyfried and Sara Manzoni, Armin Seyfried and Katsuhiro Nishinari, Armin Seyfried and Lorenza Manenti, Armin Seyfried and Tobias Kretz, Armin Seyfried and Christian Rogsch, Tobias Kretz and Stefania Bandini, Tobias Kretz and Sara Manzoni, Tobias Kretz and Lorenza Manenti, Tobias Kretz and Christian Rogsch, Christian Rogsch and Stefania Bandini, Christian Rogsch and Sara Manzoni, Christian Rogsch and Lorenza Manenti, Jarosław Wąs and Stefania Bandini, Jarosław Wąs and Lorenza Manenti, Stefania Bandini and Danny Weyns, Stefania Bandini and Marco Mamei, Stefania Bandini and Sara Manzoni, Stefania Bandini and Katsuhiro Nishinari, Stefania Bandini and Lorenza Manenti, Sara Manzoni and Danny Weyns, Sara Manzoni and Marco Mamei, Sara Manzoni and Katsuhiro Nishinari, Sara Manzoni and Lorenza Manenti, Danny Weyns and Marco Mamei, Lorenza Manenti and Katsuhiro Nishinari.\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\": \"Ivan Blecic\", \"id\": 5440}, {\"name\": \"Arnaldo Cecchini\", \"id\": 5441}, {\"name\": \"Wolfram Klingsch\", \"id\": 389316}, {\"name\": \"Giuseppe Vizzari\", \"id\": 29989}, {\"name\": \"Armin Seyfried\", \"id\": 135750}, {\"name\": \"Tobias Kretz\", \"id\": 231750}, {\"name\": \"Christian Rogsch\", \"id\": 389318}, {\"name\": \"Jaros\\u0142aw W\\u0105s\", \"id\": 25130}, {\"name\": \"Stefania Bandini\", \"id\": 16971}, {\"name\": \"Sara Manzoni\", \"id\": 36750}, {\"name\": \"Danny Weyns\", \"id\": 4086}, {\"name\": \"Lorenza Manenti\", \"id\": 95577}, {\"name\": \"Marco Mamei\", \"id\": 13661}, {\"name\": \"Katsuhiro Nishinari\", \"id\": 53887}], \"links\": [{\"source\": 5440, \"target\": 5441}, {\"source\": 5440, \"target\": 16971}, {\"source\": 5440, \"target\": 29989}, {\"source\": 5441, \"target\": 16971}, {\"source\": 5441, \"target\": 29989}, {\"source\": 389316, \"target\": 16971}, {\"source\": 389316, \"target\": 29989}, {\"source\": 389316, \"target\": 36750}, {\"source\": 389316, \"target\": 95577}, {\"source\": 389316, \"target\": 135750}, {\"source\": 389316, \"target\": 231750}, {\"source\": 29989, \"target\": 4086}, {\"source\": 29989, \"target\": 16971}, {\"source\": 29989, \"target\": 25130}, {\"source\": 29989, \"target\": 13661}, {\"source\": 29989, \"target\": 36750}, {\"source\": 29989, \"target\": 53887}, {\"source\": 29989, \"target\": 95577}, {\"source\": 29989, \"target\": 135750}, {\"source\": 29989, \"target\": 231750}, {\"source\": 29989, \"target\": 389318}, {\"source\": 135750, \"target\": 16971}, {\"source\": 135750, \"target\": 25130}, {\"source\": 135750, \"target\": 36750}, {\"source\": 135750, \"target\": 53887}, {\"source\": 135750, \"target\": 95577}, {\"source\": 135750, \"target\": 231750}, {\"source\": 135750, \"target\": 389318}, {\"source\": 231750, \"target\": 16971}, {\"source\": 231750, \"target\": 36750}, {\"source\": 231750, \"target\": 95577}, {\"source\": 231750, \"target\": 389318}, {\"source\": 389318, \"target\": 16971}, {\"source\": 389318, \"target\": 36750}, {\"source\": 389318, \"target\": 95577}, {\"source\": 25130, \"target\": 16971}, {\"source\": 25130, \"target\": 95577}, {\"source\": 16971, \"target\": 4086}, {\"source\": 16971, \"target\": 13661}, {\"source\": 16971, \"target\": 36750}, {\"source\": 16971, \"target\": 53887}, {\"source\": 16971, \"target\": 95577}, {\"source\": 36750, \"target\": 4086}, {\"source\": 36750, \"target\": 13661}, {\"source\": 36750, \"target\": 53887}, {\"source\": 36750, \"target\": 95577}, {\"source\": 4086, \"target\": 13661}, {\"source\": 95577, \"target\": 53887}]}",
"id": 124,
"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 Blecic, Arnaldo Cecchini, Wolfram Klingsch, Giuseppe Vizzari, Armin Seyfried, Tobias Kretz, Christian Rogsch, Jarosław Wąs, Stefania Bandini, Sara Manzoni, Danny Weyns, Lorenza Manenti, Marco Mamei, Katsuhiro Nishinari\n- Research collaborations between these authors: Ivan Blecic and Arnaldo Cecchini, Ivan Blecic and Stefania Bandini, Ivan Blecic and Giuseppe Vizzari, Arnaldo Cecchini and Stefania Bandini, Arnaldo Cecchini and Giuseppe Vizzari, Wolfram Klingsch and Stefania Bandini, Wolfram Klingsch and Giuseppe Vizzari, Wolfram Klingsch and Sara Manzoni, Wolfram Klingsch and Lorenza Manenti, Wolfram Klingsch and Armin Seyfried, Wolfram Klingsch and Tobias Kretz, Giuseppe Vizzari and Danny Weyns, Giuseppe Vizzari and Stefania Bandini, Giuseppe Vizzari and Jarosław Wąs, Giuseppe Vizzari and Marco Mamei, Giuseppe Vizzari and Sara Manzoni, Giuseppe Vizzari and Katsuhiro Nishinari, Giuseppe Vizzari and Lorenza Manenti, Giuseppe Vizzari and Armin Seyfried, Giuseppe Vizzari and Tobias Kretz, Giuseppe Vizzari and Christian Rogsch, Armin Seyfried and Stefania Bandini, Armin Seyfried and Jarosław Wąs, Armin Seyfried and Sara Manzoni, Armin Seyfried and Katsuhiro Nishinari, Armin Seyfried and Lorenza Manenti, Armin Seyfried and Tobias Kretz, Armin Seyfried and Christian Rogsch, Tobias Kretz and Stefania Bandini, Tobias Kretz and Sara Manzoni, Tobias Kretz and Lorenza Manenti, Tobias Kretz and Christian Rogsch, Christian Rogsch and Stefania Bandini, Christian Rogsch and Sara Manzoni, Christian Rogsch and Lorenza Manenti, Jarosław Wąs and Stefania Bandini, Jarosław Wąs and Lorenza Manenti, Stefania Bandini and Danny Weyns, Stefania Bandini and Marco Mamei, Stefania Bandini and Sara Manzoni, Stefania Bandini and Katsuhiro Nishinari, Stefania Bandini and Lorenza Manenti, Sara Manzoni and Danny Weyns, Sara Manzoni and Marco Mamei, Sara Manzoni and Katsuhiro Nishinari, Sara Manzoni and Lorenza Manenti, Danny Weyns and Marco Mamei, Lorenza Manenti and Katsuhiro Nishinari.\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: Ben Leong, Yuwang Yang, Ralf Koetter, Shaowei Wang, Yonghong Zhang, Xiaofei Zhang, Baochun Li, Michelle Effros, Rudolf Ahlswede, Mengyao Ge, Cyril Leung, Qianmu Li, Raymond W. Yeung, Yaping Li\n- Research collaborations between these authors: Ben Leong and Baochun Li, Ben Leong and Ralf Koetter, Ben Leong and Michelle Effros, Ben Leong and Yuwang Yang, Yuwang Yang and Xiaofei Zhang, Yuwang Yang and Qianmu Li, Yuwang Yang and Yaping Li, Yuwang Yang and Raymond W. Yeung, Yuwang Yang and Baochun Li, Yuwang Yang and Rudolf Ahlswede, Yuwang Yang and Shaowei Wang, Yuwang Yang and Cyril Leung, Yuwang Yang and Michelle Effros, Yuwang Yang and Yonghong Zhang, Yuwang Yang and Ralf Koetter, Yuwang Yang and Mengyao Ge, Ralf Koetter and Raymond W. Yeung, Ralf Koetter and Baochun Li, Ralf Koetter and Rudolf Ahlswede, Ralf Koetter and Michelle Effros, Shaowei Wang and Cyril Leung, Shaowei Wang and Yonghong Zhang, Shaowei Wang and Mengyao Ge, Shaowei Wang and Xiaofei Zhang, Shaowei Wang and Qianmu Li, Shaowei Wang and Yaping Li, Yonghong Zhang and Xiaofei Zhang, Yonghong Zhang and Qianmu Li, Yonghong Zhang and Yaping Li, Yonghong Zhang and Mengyao Ge, Xiaofei Zhang and Cyril Leung, Xiaofei Zhang and Yaping Li, Xiaofei Zhang and Qianmu Li, Baochun Li and Raymond W. Yeung, Baochun Li and Rudolf Ahlswede, Baochun Li and Michelle Effros, Michelle Effros and Raymond W. Yeung, Michelle Effros and Rudolf Ahlswede, Rudolf Ahlswede and Raymond W. Yeung, Mengyao Ge and Qianmu Li, Mengyao Ge and Yaping Li, Mengyao Ge and Cyril Leung, Cyril Leung and Qianmu Li, Cyril Leung and Yaping Li, Qianmu Li and Yaping 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": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Ben Leong\", \"id\": 115524}, {\"name\": \"Yuwang Yang\", \"id\": 445733}, {\"name\": \"Ralf Koetter\", \"id\": 260937}, {\"name\": \"Shaowei Wang\", \"id\": 85931}, {\"name\": \"Yonghong Zhang\", \"id\": 131150}, {\"name\": \"Xiaofei Zhang\", \"id\": 132753}, {\"name\": \"Baochun Li\", \"id\": 44210}, {\"name\": \"Michelle Effros\", \"id\": 124308}, {\"name\": \"Rudolf Ahlswede\", \"id\": 52949}, {\"name\": \"Mengyao Ge\", \"id\": 569559}, {\"name\": \"Cyril Leung\", \"id\": 115961}, {\"name\": \"Qianmu Li\", \"id\": 157179}, {\"name\": \"Raymond W. Yeung\", \"id\": 31420}, {\"name\": \"Yaping Li\", \"id\": 161598}], \"links\": [{\"source\": 115524, \"target\": 44210}, {\"source\": 115524, \"target\": 260937}, {\"source\": 115524, \"target\": 124308}, {\"source\": 115524, \"target\": 445733}, {\"source\": 445733, \"target\": 132753}, {\"source\": 445733, \"target\": 157179}, {\"source\": 445733, \"target\": 161598}, {\"source\": 445733, \"target\": 31420}, {\"source\": 445733, \"target\": 44210}, {\"source\": 445733, \"target\": 52949}, {\"source\": 445733, \"target\": 85931}, {\"source\": 445733, \"target\": 115961}, {\"source\": 445733, \"target\": 124308}, {\"source\": 445733, \"target\": 131150}, {\"source\": 445733, \"target\": 260937}, {\"source\": 445733, \"target\": 569559}, {\"source\": 260937, \"target\": 31420}, {\"source\": 260937, \"target\": 44210}, {\"source\": 260937, \"target\": 52949}, {\"source\": 260937, \"target\": 124308}, {\"source\": 85931, \"target\": 115961}, {\"source\": 85931, \"target\": 131150}, {\"source\": 85931, \"target\": 569559}, {\"source\": 85931, \"target\": 132753}, {\"source\": 85931, \"target\": 157179}, {\"source\": 85931, \"target\": 161598}, {\"source\": 131150, \"target\": 132753}, {\"source\": 131150, \"target\": 157179}, {\"source\": 131150, \"target\": 161598}, {\"source\": 131150, \"target\": 569559}, {\"source\": 132753, \"target\": 115961}, {\"source\": 132753, \"target\": 161598}, {\"source\": 132753, \"target\": 157179}, {\"source\": 44210, \"target\": 31420}, {\"source\": 44210, \"target\": 52949}, {\"source\": 44210, \"target\": 124308}, {\"source\": 124308, \"target\": 31420}, {\"source\": 124308, \"target\": 52949}, {\"source\": 52949, \"target\": 31420}, {\"source\": 569559, \"target\": 157179}, {\"source\": 569559, \"target\": 161598}, {\"source\": 569559, \"target\": 115961}, {\"source\": 115961, \"target\": 157179}, {\"source\": 115961, \"target\": 161598}, {\"source\": 157179, \"target\": 161598}]}",
"id": 2455,
"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: Ben Leong, Yuwang Yang, Ralf Koetter, Shaowei Wang, Yonghong Zhang, Xiaofei Zhang, Baochun Li, Michelle Effros, Rudolf Ahlswede, Mengyao Ge, Cyril Leung, Qianmu Li, Raymond W. Yeung, Yaping Li\n- Research collaborations between these authors: Ben Leong and Baochun Li, Ben Leong and Ralf Koetter, Ben Leong and Michelle Effros, Ben Leong and Yuwang Yang, Yuwang Yang and Xiaofei Zhang, Yuwang Yang and Qianmu Li, Yuwang Yang and Yaping Li, Yuwang Yang and Raymond W. Yeung, Yuwang Yang and Baochun Li, Yuwang Yang and Rudolf Ahlswede, Yuwang Yang and Shaowei Wang, Yuwang Yang and Cyril Leung, Yuwang Yang and Michelle Effros, Yuwang Yang and Yonghong Zhang, Yuwang Yang and Ralf Koetter, Yuwang Yang and Mengyao Ge, Ralf Koetter and Raymond W. Yeung, Ralf Koetter and Baochun Li, Ralf Koetter and Rudolf Ahlswede, Ralf Koetter and Michelle Effros, Shaowei Wang and Cyril Leung, Shaowei Wang and Yonghong Zhang, Shaowei Wang and Mengyao Ge, Shaowei Wang and Xiaofei Zhang, Shaowei Wang and Qianmu Li, Shaowei Wang and Yaping Li, Yonghong Zhang and Xiaofei Zhang, Yonghong Zhang and Qianmu Li, Yonghong Zhang and Yaping Li, Yonghong Zhang and Mengyao Ge, Xiaofei Zhang and Cyril Leung, Xiaofei Zhang and Yaping Li, Xiaofei Zhang and Qianmu Li, Baochun Li and Raymond W. Yeung, Baochun Li and Rudolf Ahlswede, Baochun Li and Michelle Effros, Michelle Effros and Raymond W. Yeung, Michelle Effros and Rudolf Ahlswede, Rudolf Ahlswede and Raymond W. Yeung, Mengyao Ge and Qianmu Li, Mengyao Ge and Yaping Li, Mengyao Ge and Cyril Leung, Cyril Leung and Qianmu Li, Cyril Leung and Yaping Li, Qianmu Li and Yaping 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: 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": 2028,
"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: Hong Zhang, Jae Young Choi, Bill Triggs, Sharath Pankanti, Donald M. Monro, Arun Ross, Anil K. Jain, Gérard G. Medioni, Takeo Kanade, Vishal M. Patel, Salil Prabhakar, Will N. Browne, Miroslav Bača, Yevgeni Koucheryavy\n- Research collaborations between these authors: Hong Zhang and Takeo Kanade, Hong Zhang and Bill Triggs, Hong Zhang and Anil K. Jain, Jae Young Choi and Arun Ross, Jae Young Choi and Anil K. Jain, Jae Young Choi and Salil Prabhakar, Bill Triggs and Vishal M. Patel, Bill Triggs and Takeo Kanade, Bill Triggs and Arun Ross, Bill Triggs and Anil K. Jain, Bill Triggs and Gérard G. Medioni, Bill Triggs and Sharath Pankanti, Sharath Pankanti and Vishal M. Patel, Sharath Pankanti and Arun Ross, Sharath Pankanti and Anil K. Jain, Sharath Pankanti and Salil Prabhakar, Donald M. Monro and Arun Ross, Donald M. Monro and Anil K. Jain, Donald M. Monro and Salil Prabhakar, Arun Ross and Vishal M. Patel, Arun Ross and Anil K. Jain, Arun Ross and Salil Prabhakar, Anil K. Jain and Vishal M. Patel, Anil K. Jain and Takeo Kanade, Anil K. Jain and Gérard G. Medioni, Anil K. Jain and Salil Prabhakar, Anil K. Jain and Miroslav Bača, Gérard G. Medioni and Takeo Kanade, Gérard G. Medioni and Vishal M. Patel, Takeo Kanade and Vishal M. Patel, Salil Prabhakar and Miroslav Bača.\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\": \"Hong Zhang\", \"id\": 13857}, {\"name\": \"Jae Young Choi\", \"id\": 42021}, {\"name\": \"Bill Triggs\", \"id\": 21767}, {\"name\": \"Donald M. Monro\", \"id\": 344623}, {\"name\": \"Vishal M. Patel\", \"id\": 6936}, {\"name\": \"Arun Ross\", \"id\": 28180}, {\"name\": \"Anil K. Jain\", \"id\": 28181}, {\"name\": \"G\\u00e9rard G. Medioni\", \"id\": 43958}, {\"name\": \"Takeo Kanade\", \"id\": 14007}, {\"name\": \"Sharath Pankanti\", \"id\": 95704}, {\"name\": \"Salil Prabhakar\", \"id\": 95705}, {\"name\": \"Will N. Browne\", \"id\": 5274}, {\"name\": \"Miroslav Ba\\u010da\", \"id\": 347675}, {\"name\": \"Yevgeni Koucheryavy\", \"id\": 12159}], \"links\": [{\"source\": 13857, \"target\": 14007}, {\"source\": 13857, \"target\": 21767}, {\"source\": 13857, \"target\": 28181}, {\"source\": 42021, \"target\": 28180}, {\"source\": 42021, \"target\": 28181}, {\"source\": 42021, \"target\": 95705}, {\"source\": 21767, \"target\": 6936}, {\"source\": 21767, \"target\": 14007}, {\"source\": 21767, \"target\": 28180}, {\"source\": 21767, \"target\": 28181}, {\"source\": 21767, \"target\": 43958}, {\"source\": 21767, \"target\": 95704}, {\"source\": 344623, \"target\": 28180}, {\"source\": 344623, \"target\": 28181}, {\"source\": 344623, \"target\": 95705}, {\"source\": 6936, \"target\": 14007}, {\"source\": 6936, \"target\": 28180}, {\"source\": 6936, \"target\": 28181}, {\"source\": 6936, \"target\": 95704}, {\"source\": 6936, \"target\": 43958}, {\"source\": 28180, \"target\": 28181}, {\"source\": 28180, \"target\": 95704}, {\"source\": 28180, \"target\": 95705}, {\"source\": 28181, \"target\": 14007}, {\"source\": 28181, \"target\": 43958}, {\"source\": 28181, \"target\": 95704}, {\"source\": 28181, \"target\": 95705}, {\"source\": 28181, \"target\": 347675}, {\"source\": 43958, \"target\": 14007}, {\"source\": 95704, \"target\": 95705}, {\"source\": 95705, \"target\": 347675}]}",
"id": 388,
"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, Jae Young Choi, Bill Triggs, Sharath Pankanti, Donald M. Monro, Arun Ross, Anil K. Jain, Gérard G. Medioni, Takeo Kanade, Vishal M. Patel, Salil Prabhakar, Will N. Browne, Miroslav Bača, Yevgeni Koucheryavy\n- Research collaborations between these authors: Hong Zhang and Takeo Kanade, Hong Zhang and Bill Triggs, Hong Zhang and Anil K. Jain, Jae Young Choi and Arun Ross, Jae Young Choi and Anil K. Jain, Jae Young Choi and Salil Prabhakar, Bill Triggs and Vishal M. Patel, Bill Triggs and Takeo Kanade, Bill Triggs and Arun Ross, Bill Triggs and Anil K. Jain, Bill Triggs and Gérard G. Medioni, Bill Triggs and Sharath Pankanti, Sharath Pankanti and Vishal M. Patel, Sharath Pankanti and Arun Ross, Sharath Pankanti and Anil K. Jain, Sharath Pankanti and Salil Prabhakar, Donald M. Monro and Arun Ross, Donald M. Monro and Anil K. Jain, Donald M. Monro and Salil Prabhakar, Arun Ross and Vishal M. Patel, Arun Ross and Anil K. Jain, Arun Ross and Salil Prabhakar, Anil K. Jain and Vishal M. Patel, Anil K. Jain and Takeo Kanade, Anil K. Jain and Gérard G. Medioni, Anil K. Jain and Salil Prabhakar, Anil K. Jain and Miroslav Bača, Gérard G. Medioni and Takeo Kanade, Gérard G. Medioni and Vishal M. Patel, Takeo Kanade and Vishal M. Patel, Salil Prabhakar and Miroslav Bača.\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, Wynne W. Chin, Kar Yan Tam, Matthew L. Jensen, Viswanath Venkatesh, Liliana Ardissono, Shuk Ying Ho, Michael G. Morris, James Y. L. Thong, Sriram Thirumalai, Izak Benbasat, Gordon B. Davis, Yi-Cheng Ku, D. Harrison McKnight\n- Research collaborations between these authors: Hong Zhang and Izak Benbasat, Hong Zhang and Shuk Ying Ho, Hong Zhang and Kar Yan Tam, Wynne W. Chin and Izak Benbasat, Wynne W. Chin and Viswanath Venkatesh, Kar Yan Tam and Matthew L. Jensen, Kar Yan Tam and Izak Benbasat, Kar Yan Tam and Shuk Ying Ho, Kar Yan Tam and Viswanath Venkatesh, Kar Yan Tam and Michael G. Morris, Kar Yan Tam and Gordon B. Davis, Kar Yan Tam and James Y. L. Thong, Kar Yan Tam and Sriram Thirumalai, Matthew L. Jensen and Izak Benbasat, Matthew L. Jensen and Shuk Ying Ho, Viswanath Venkatesh and D. Harrison McKnight, Viswanath Venkatesh and Izak Benbasat, Viswanath Venkatesh and Shuk Ying Ho, Viswanath Venkatesh and Michael G. Morris, Viswanath Venkatesh and Gordon B. Davis, Viswanath Venkatesh and James Y. L. Thong, Liliana Ardissono and Shuk Ying Ho, Shuk Ying Ho and Izak Benbasat, Shuk Ying Ho and Yi-Cheng Ku, Shuk Ying Ho and Michael G. Morris, Shuk Ying Ho and Gordon B. Davis, Shuk Ying Ho and Sriram Thirumalai, Michael G. Morris and D. Harrison McKnight, Michael G. Morris and Izak Benbasat, Michael G. Morris and Gordon B. Davis, Michael G. Morris and James Y. L. Thong, James Y. L. Thong and D. Harrison McKnight, James Y. L. Thong and Izak Benbasat, James Y. L. Thong and Gordon B. Davis, Sriram Thirumalai and Izak Benbasat, Izak Benbasat and D. Harrison McKnight, Izak Benbasat and Gordon B. Davis, Izak Benbasat and Yi-Cheng Ku, Gordon B. Davis and D. Harrison McKnight.\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\": \"Hong Zhang\", \"id\": 13857}, {\"name\": \"Wynne W. Chin\", \"id\": 84996}, {\"name\": \"Kar Yan Tam\", \"id\": 67464}, {\"name\": \"Matthew L. Jensen\", \"id\": 2856}, {\"name\": \"Viswanath Venkatesh\", \"id\": 74763}, {\"name\": \"Liliana Ardissono\", \"id\": 9616}, {\"name\": \"Shuk Ying Ho\", \"id\": 63153}, {\"name\": \"Michael G. Morris\", \"id\": 99953}, {\"name\": \"James Y. L. Thong\", \"id\": 241936}, {\"name\": \"Sriram Thirumalai\", \"id\": 1071733}, {\"name\": \"Izak Benbasat\", \"id\": 42614}, {\"name\": \"Gordon B. Davis\", \"id\": 238679}, {\"name\": \"Yi-Cheng Ku\", \"id\": 71353}, {\"name\": \"D. Harrison McKnight\", \"id\": 27453}], \"links\": [{\"source\": 13857, \"target\": 42614}, {\"source\": 13857, \"target\": 63153}, {\"source\": 13857, \"target\": 67464}, {\"source\": 84996, \"target\": 42614}, {\"source\": 84996, \"target\": 74763}, {\"source\": 67464, \"target\": 2856}, {\"source\": 67464, \"target\": 42614}, {\"source\": 67464, \"target\": 63153}, {\"source\": 67464, \"target\": 74763}, {\"source\": 67464, \"target\": 99953}, {\"source\": 67464, \"target\": 238679}, {\"source\": 67464, \"target\": 241936}, {\"source\": 67464, \"target\": 1071733}, {\"source\": 2856, \"target\": 42614}, {\"source\": 2856, \"target\": 63153}, {\"source\": 74763, \"target\": 27453}, {\"source\": 74763, \"target\": 42614}, {\"source\": 74763, \"target\": 63153}, {\"source\": 74763, \"target\": 99953}, {\"source\": 74763, \"target\": 238679}, {\"source\": 74763, \"target\": 241936}, {\"source\": 9616, \"target\": 63153}, {\"source\": 63153, \"target\": 42614}, {\"source\": 63153, \"target\": 71353}, {\"source\": 63153, \"target\": 99953}, {\"source\": 63153, \"target\": 238679}, {\"source\": 63153, \"target\": 1071733}, {\"source\": 99953, \"target\": 27453}, {\"source\": 99953, \"target\": 42614}, {\"source\": 99953, \"target\": 238679}, {\"source\": 99953, \"target\": 241936}, {\"source\": 241936, \"target\": 27453}, {\"source\": 241936, \"target\": 42614}, {\"source\": 241936, \"target\": 238679}, {\"source\": 1071733, \"target\": 42614}, {\"source\": 42614, \"target\": 27453}, {\"source\": 42614, \"target\": 238679}, {\"source\": 42614, \"target\": 71353}, {\"source\": 238679, \"target\": 27453}]}",
"id": 250,
"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, Wynne W. Chin, Kar Yan Tam, Matthew L. Jensen, Viswanath Venkatesh, Liliana Ardissono, Shuk Ying Ho, Michael G. Morris, James Y. L. Thong, Sriram Thirumalai, Izak Benbasat, Gordon B. Davis, Yi-Cheng Ku, D. Harrison McKnight\n- Research collaborations between these authors: Hong Zhang and Izak Benbasat, Hong Zhang and Shuk Ying Ho, Hong Zhang and Kar Yan Tam, Wynne W. Chin and Izak Benbasat, Wynne W. Chin and Viswanath Venkatesh, Kar Yan Tam and Matthew L. Jensen, Kar Yan Tam and Izak Benbasat, Kar Yan Tam and Shuk Ying Ho, Kar Yan Tam and Viswanath Venkatesh, Kar Yan Tam and Michael G. Morris, Kar Yan Tam and Gordon B. Davis, Kar Yan Tam and James Y. L. Thong, Kar Yan Tam and Sriram Thirumalai, Matthew L. Jensen and Izak Benbasat, Matthew L. Jensen and Shuk Ying Ho, Viswanath Venkatesh and D. Harrison McKnight, Viswanath Venkatesh and Izak Benbasat, Viswanath Venkatesh and Shuk Ying Ho, Viswanath Venkatesh and Michael G. Morris, Viswanath Venkatesh and Gordon B. Davis, Viswanath Venkatesh and James Y. L. Thong, Liliana Ardissono and Shuk Ying Ho, Shuk Ying Ho and Izak Benbasat, Shuk Ying Ho and Yi-Cheng Ku, Shuk Ying Ho and Michael G. Morris, Shuk Ying Ho and Gordon B. Davis, Shuk Ying Ho and Sriram Thirumalai, Michael G. Morris and D. Harrison McKnight, Michael G. Morris and Izak Benbasat, Michael G. Morris and Gordon B. Davis, Michael G. Morris and James Y. L. Thong, James Y. L. Thong and D. Harrison McKnight, James Y. L. Thong and Izak Benbasat, James Y. L. Thong and Gordon B. Davis, Sriram Thirumalai and Izak Benbasat, Izak Benbasat and D. Harrison McKnight, Izak Benbasat and Gordon B. Davis, Izak Benbasat and Yi-Cheng Ku, Gordon B. Davis and D. Harrison McKnight.\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-Yen Yang, Sonia A. Hashish, Rui Zhang, Feng Zhao, Li Ma, Leonidas J. Guibas, Anxiao Jiang, Adam Eck, Minglu Li, Wei Hong, Jeongkeun Lee, Stefan Funke, Jie Gao, Qing Fang\n- Research collaborations between these authors: Hong-Yen Yang and Jie Gao, Hong-Yen Yang and Leonidas J. Guibas, Hong-Yen Yang and Anxiao Jiang, Hong-Yen Yang and Qing Fang, Sonia A. Hashish and Jie Gao, Sonia A. Hashish and Leonidas J. Guibas, Sonia A. Hashish and Wei Hong, Sonia A. Hashish and Qing Fang, Rui Zhang and Jie Gao, Rui Zhang and Leonidas J. Guibas, Rui Zhang and Wei Hong, Rui Zhang and Feng Zhao, Feng Zhao and Jie Gao, Feng Zhao and Leonidas J. Guibas, Feng Zhao and Wei Hong, Feng Zhao and Jeongkeun Lee, Leonidas J. Guibas and Jie Gao, Leonidas J. Guibas and Wei Hong, Leonidas J. Guibas and Qing Fang, Leonidas J. Guibas and Stefan Funke, Leonidas J. Guibas and Anxiao Jiang, Anxiao Jiang and Jie Gao, Anxiao Jiang and Stefan Funke, Anxiao Jiang and Qing Fang, Minglu Li and Wei Hong, Wei Hong and Jie Gao, Stefan Funke and Jie Gao, Stefan Funke and Qing Fang, Jie Gao and Qing Fang.\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\": \"Hong-Yen Yang\", \"id\": 977030}, {\"name\": \"Sonia A. Hashish\", \"id\": 119943}, {\"name\": \"Rui Zhang\", \"id\": 8681}, {\"name\": \"Feng Zhao\", \"id\": 34991}, {\"name\": \"Li Ma\", \"id\": 2415}, {\"name\": \"Leonidas J. Guibas\", \"id\": 72849}, {\"name\": \"Anxiao Jiang\", \"id\": 251348}, {\"name\": \"Minglu Li\", \"id\": 2645}, {\"name\": \"Jeongkeun Lee\", \"id\": 133844}, {\"name\": \"Adam Eck\", \"id\": 18647}, {\"name\": \"Stefan Funke\", \"id\": 91737}, {\"name\": \"Jie Gao\", \"id\": 49402}, {\"name\": \"Wei Hong\", \"id\": 240442}, {\"name\": \"Qing Fang\", \"id\": 534652}], \"links\": [{\"source\": 977030, \"target\": 49402}, {\"source\": 977030, \"target\": 72849}, {\"source\": 977030, \"target\": 251348}, {\"source\": 977030, \"target\": 534652}, {\"source\": 119943, \"target\": 49402}, {\"source\": 119943, \"target\": 72849}, {\"source\": 119943, \"target\": 240442}, {\"source\": 119943, \"target\": 534652}, {\"source\": 8681, \"target\": 49402}, {\"source\": 8681, \"target\": 72849}, {\"source\": 8681, \"target\": 240442}, {\"source\": 8681, \"target\": 34991}, {\"source\": 34991, \"target\": 49402}, {\"source\": 34991, \"target\": 72849}, {\"source\": 34991, \"target\": 240442}, {\"source\": 34991, \"target\": 133844}, {\"source\": 72849, \"target\": 49402}, {\"source\": 72849, \"target\": 240442}, {\"source\": 72849, \"target\": 534652}, {\"source\": 72849, \"target\": 91737}, {\"source\": 72849, \"target\": 251348}, {\"source\": 251348, \"target\": 49402}, {\"source\": 251348, \"target\": 91737}, {\"source\": 251348, \"target\": 534652}, {\"source\": 2645, \"target\": 240442}, {\"source\": 91737, \"target\": 49402}, {\"source\": 91737, \"target\": 534652}, {\"source\": 49402, \"target\": 240442}, {\"source\": 49402, \"target\": 534652}]}",
"id": 1735,
"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-Yen Yang, Sonia A. Hashish, Rui Zhang, Feng Zhao, Li Ma, Leonidas J. Guibas, Anxiao Jiang, Adam Eck, Minglu Li, Wei Hong, Jeongkeun Lee, Stefan Funke, Jie Gao, Qing Fang\n- Research collaborations between these authors: Hong-Yen Yang and Jie Gao, Hong-Yen Yang and Leonidas J. Guibas, Hong-Yen Yang and Anxiao Jiang, Hong-Yen Yang and Qing Fang, Sonia A. Hashish and Jie Gao, Sonia A. Hashish and Leonidas J. Guibas, Sonia A. Hashish and Wei Hong, Sonia A. Hashish and Qing Fang, Rui Zhang and Jie Gao, Rui Zhang and Leonidas J. Guibas, Rui Zhang and Wei Hong, Rui Zhang and Feng Zhao, Feng Zhao and Jie Gao, Feng Zhao and Leonidas J. Guibas, Feng Zhao and Wei Hong, Feng Zhao and Jeongkeun Lee, Leonidas J. Guibas and Jie Gao, Leonidas J. Guibas and Wei Hong, Leonidas J. Guibas and Qing Fang, Leonidas J. Guibas and Stefan Funke, Leonidas J. Guibas and Anxiao Jiang, Anxiao Jiang and Jie Gao, Anxiao Jiang and Stefan Funke, Anxiao Jiang and Qing Fang, Minglu Li and Wei Hong, Wei Hong and Jie Gao, Stefan Funke and Jie Gao, Stefan Funke and Qing Fang, Jie Gao and Qing Fang.\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: Behnaam Aazhang, David D. Falconer, Samir Saoudi, Helmut Bölcskei, Giuseppe Caire, Tadashi Matsumoto, Michael Tüchler, Tarik Ait-Idir, Harvind Samra, Rohit U. Nabar, Houda Chafnaji, Sami Chtourou, Murat Uysal, Andrew Sendonaris\n- Research collaborations between these authors: Behnaam Aazhang and Samir Saoudi, Behnaam Aazhang and Giuseppe Caire, Behnaam Aazhang and Andrew Sendonaris, Behnaam Aazhang and Rohit U. Nabar, Behnaam Aazhang and Murat Uysal, Behnaam Aazhang and Tarik Ait-Idir, Behnaam Aazhang and David D. Falconer, David D. Falconer and Samir Saoudi, David D. Falconer and Tarik Ait-Idir, David D. Falconer and Michael Tüchler, David D. Falconer and Andrew Sendonaris, Samir Saoudi and Giuseppe Caire, Samir Saoudi and Helmut Bölcskei, Samir Saoudi and Rohit U. Nabar, Samir Saoudi and Murat Uysal, Samir Saoudi and Michael Tüchler, Samir Saoudi and Tarik Ait-Idir, Samir Saoudi and Tadashi Matsumoto, Samir Saoudi and Sami Chtourou, Samir Saoudi and Houda Chafnaji, Samir Saoudi and Harvind Samra, Samir Saoudi and Andrew Sendonaris, Helmut Bölcskei and Giuseppe Caire, Helmut Bölcskei and Rohit U. Nabar, Helmut Bölcskei and Murat Uysal, Helmut Bölcskei and Tarik Ait-Idir, Helmut Bölcskei and Houda Chafnaji, Giuseppe Caire and Rohit U. Nabar, Giuseppe Caire and Andrew Sendonaris, Giuseppe Caire and Murat Uysal, Giuseppe Caire and Tarik Ait-Idir, Giuseppe Caire and Houda Chafnaji, Tadashi Matsumoto and Tarik Ait-Idir, Tadashi Matsumoto and Michael Tüchler, Tadashi Matsumoto and Sami Chtourou, Michael Tüchler and Tarik Ait-Idir, Tarik Ait-Idir and Rohit U. Nabar, Tarik Ait-Idir and Murat Uysal, Tarik Ait-Idir and Sami Chtourou, Tarik Ait-Idir and Houda Chafnaji, Tarik Ait-Idir and Harvind Samra, Tarik Ait-Idir and Andrew Sendonaris, Harvind Samra and Houda Chafnaji, Rohit U. Nabar and Andrew Sendonaris, Rohit U. Nabar and Murat Uysal, Houda Chafnaji and Murat Uysal, Houda Chafnaji and Sami Chtourou, Murat Uysal and Andrew Sendonaris.\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\": \"Behnaam Aazhang\", \"id\": 232897}, {\"name\": \"David D. Falconer\", \"id\": 314659}, {\"name\": \"Samir Saoudi\", \"id\": 171556}, {\"name\": \"Giuseppe Caire\", \"id\": 180553}, {\"name\": \"Helmut B\\u00f6lcskei\", \"id\": 246953}, {\"name\": \"Tadashi Matsumoto\", \"id\": 309229}, {\"name\": \"Michael T\\u00fcchler\", \"id\": 293006}, {\"name\": \"Tarik Ait-Idir\", \"id\": 306546}, {\"name\": \"Harvind Samra\", \"id\": 710738}, {\"name\": \"Rohit U. Nabar\", \"id\": 253749}, {\"name\": \"Houda Chafnaji\", \"id\": 399927}, {\"name\": \"Sami Chtourou\", \"id\": 314040}, {\"name\": \"Murat Uysal\", \"id\": 257017}, {\"name\": \"Andrew Sendonaris\", \"id\": 1065275}], \"links\": [{\"source\": 232897, \"target\": 171556}, {\"source\": 232897, \"target\": 180553}, {\"source\": 232897, \"target\": 1065275}, {\"source\": 232897, \"target\": 253749}, {\"source\": 232897, \"target\": 257017}, {\"source\": 232897, \"target\": 306546}, {\"source\": 232897, \"target\": 314659}, {\"source\": 314659, \"target\": 171556}, {\"source\": 314659, \"target\": 306546}, {\"source\": 314659, \"target\": 293006}, {\"source\": 314659, \"target\": 1065275}, {\"source\": 171556, \"target\": 180553}, {\"source\": 171556, \"target\": 246953}, {\"source\": 171556, \"target\": 253749}, {\"source\": 171556, \"target\": 257017}, {\"source\": 171556, \"target\": 293006}, {\"source\": 171556, \"target\": 306546}, {\"source\": 171556, \"target\": 309229}, {\"source\": 171556, \"target\": 314040}, {\"source\": 171556, \"target\": 399927}, {\"source\": 171556, \"target\": 710738}, {\"source\": 171556, \"target\": 1065275}, {\"source\": 180553, \"target\": 246953}, {\"source\": 180553, \"target\": 253749}, {\"source\": 180553, \"target\": 1065275}, {\"source\": 180553, \"target\": 257017}, {\"source\": 180553, \"target\": 306546}, {\"source\": 180553, \"target\": 399927}, {\"source\": 246953, \"target\": 253749}, {\"source\": 246953, \"target\": 257017}, {\"source\": 246953, \"target\": 306546}, {\"source\": 246953, \"target\": 399927}, {\"source\": 309229, \"target\": 306546}, {\"source\": 309229, \"target\": 293006}, {\"source\": 309229, \"target\": 314040}, {\"source\": 293006, \"target\": 306546}, {\"source\": 306546, \"target\": 253749}, {\"source\": 306546, \"target\": 257017}, {\"source\": 306546, \"target\": 314040}, {\"source\": 306546, \"target\": 399927}, {\"source\": 306546, \"target\": 710738}, {\"source\": 306546, \"target\": 1065275}, {\"source\": 710738, \"target\": 399927}, {\"source\": 253749, \"target\": 1065275}, {\"source\": 253749, \"target\": 257017}, {\"source\": 399927, \"target\": 257017}, {\"source\": 399927, \"target\": 314040}, {\"source\": 257017, \"target\": 1065275}]}",
"id": 2935,
"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: Behnaam Aazhang, David D. Falconer, Samir Saoudi, Helmut Bölcskei, Giuseppe Caire, Tadashi Matsumoto, Michael Tüchler, Tarik Ait-Idir, Harvind Samra, Rohit U. Nabar, Houda Chafnaji, Sami Chtourou, Murat Uysal, Andrew Sendonaris\n- Research collaborations between these authors: Behnaam Aazhang and Samir Saoudi, Behnaam Aazhang and Giuseppe Caire, Behnaam Aazhang and Andrew Sendonaris, Behnaam Aazhang and Rohit U. Nabar, Behnaam Aazhang and Murat Uysal, Behnaam Aazhang and Tarik Ait-Idir, Behnaam Aazhang and David D. Falconer, David D. Falconer and Samir Saoudi, David D. Falconer and Tarik Ait-Idir, David D. Falconer and Michael Tüchler, David D. Falconer and Andrew Sendonaris, Samir Saoudi and Giuseppe Caire, Samir Saoudi and Helmut Bölcskei, Samir Saoudi and Rohit U. Nabar, Samir Saoudi and Murat Uysal, Samir Saoudi and Michael Tüchler, Samir Saoudi and Tarik Ait-Idir, Samir Saoudi and Tadashi Matsumoto, Samir Saoudi and Sami Chtourou, Samir Saoudi and Houda Chafnaji, Samir Saoudi and Harvind Samra, Samir Saoudi and Andrew Sendonaris, Helmut Bölcskei and Giuseppe Caire, Helmut Bölcskei and Rohit U. Nabar, Helmut Bölcskei and Murat Uysal, Helmut Bölcskei and Tarik Ait-Idir, Helmut Bölcskei and Houda Chafnaji, Giuseppe Caire and Rohit U. Nabar, Giuseppe Caire and Andrew Sendonaris, Giuseppe Caire and Murat Uysal, Giuseppe Caire and Tarik Ait-Idir, Giuseppe Caire and Houda Chafnaji, Tadashi Matsumoto and Tarik Ait-Idir, Tadashi Matsumoto and Michael Tüchler, Tadashi Matsumoto and Sami Chtourou, Michael Tüchler and Tarik Ait-Idir, Tarik Ait-Idir and Rohit U. Nabar, Tarik Ait-Idir and Murat Uysal, Tarik Ait-Idir and Sami Chtourou, Tarik Ait-Idir and Houda Chafnaji, Tarik Ait-Idir and Harvind Samra, Tarik Ait-Idir and Andrew Sendonaris, Harvind Samra and Houda Chafnaji, Rohit U. Nabar and Andrew Sendonaris, Rohit U. Nabar and Murat Uysal, Houda Chafnaji and Murat Uysal, Houda Chafnaji and Sami Chtourou, Murat Uysal and Andrew Sendonaris.\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: Shashidhar Gandham, S. Venkatesan, A. J. Dinusha Rathnayaka, Tommaso Melodia, Kaushik R. Chowdhury, Hari Balakrishnan, Andrew T. Campbell, Vehbi Cagri Gungor, Hongwei Zhang, Yogesh Sankarasubramaniam, Lakshman Krishnamurthy, Raghupathy Sivakumar, Ian F. Akyildiz, Atif Sharif\n- Research collaborations between these authors: Shashidhar Gandham and S. Venkatesan, Shashidhar Gandham and Atif Sharif, Shashidhar Gandham and Hari Balakrishnan, S. Venkatesan and Hari Balakrishnan, S. Venkatesan and Ian F. Akyildiz, S. Venkatesan and Atif Sharif, A. J. Dinusha Rathnayaka and Vehbi Cagri Gungor, A. J. Dinusha Rathnayaka and Andrew T. Campbell, A. J. Dinusha Rathnayaka and Ian F. Akyildiz, A. J. Dinusha Rathnayaka and Atif Sharif, Tommaso Melodia and Vehbi Cagri Gungor, Tommaso Melodia and Ian F. Akyildiz, Tommaso Melodia and Hari Balakrishnan, Tommaso Melodia and Andrew T. Campbell, Tommaso Melodia and Raghupathy Sivakumar, Tommaso Melodia and Kaushik R. Chowdhury, Tommaso Melodia and Yogesh Sankarasubramaniam, Tommaso Melodia and Atif Sharif, Kaushik R. Chowdhury and Vehbi Cagri Gungor, Kaushik R. Chowdhury and Ian F. Akyildiz, Kaushik R. Chowdhury and Atif Sharif, Kaushik R. Chowdhury and Hari Balakrishnan, Hari Balakrishnan and Andrew T. Campbell, Hari Balakrishnan and Vehbi Cagri Gungor, Hari Balakrishnan and Hongwei Zhang, Hari Balakrishnan and Ian F. Akyildiz, Hari Balakrishnan and Raghupathy Sivakumar, Hari Balakrishnan and Atif Sharif, Andrew T. Campbell and Vehbi Cagri Gungor, Andrew T. Campbell and Ian F. Akyildiz, Andrew T. Campbell and Yogesh Sankarasubramaniam, Andrew T. Campbell and Lakshman Krishnamurthy, Andrew T. Campbell and Raghupathy Sivakumar, Andrew T. Campbell and Atif Sharif, Vehbi Cagri Gungor and Ian F. Akyildiz, Vehbi Cagri Gungor and Raghupathy Sivakumar, Vehbi Cagri Gungor and Yogesh Sankarasubramaniam, Vehbi Cagri Gungor and Atif Sharif, Hongwei Zhang and Ian F. Akyildiz, Hongwei Zhang and Atif Sharif, Yogesh Sankarasubramaniam and Ian F. Akyildiz, Yogesh Sankarasubramaniam and Raghupathy Sivakumar, Yogesh Sankarasubramaniam and Atif Sharif, Lakshman Krishnamurthy and Ian F. Akyildiz, Lakshman Krishnamurthy and Raghupathy Sivakumar, Lakshman Krishnamurthy and Atif Sharif, Raghupathy Sivakumar and Ian F. Akyildiz, Raghupathy Sivakumar and Atif Sharif, Ian F. Akyildiz and Atif Sharif.\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\": \"Shashidhar Gandham\", \"id\": 405153}, {\"name\": \"S. Venkatesan\", \"id\": 69699}, {\"name\": \"A. J. Dinusha Rathnayaka\", \"id\": 497573}, {\"name\": \"Tommaso Melodia\", \"id\": 225478}, {\"name\": \"Kaushik R. Chowdhury\", \"id\": 300647}, {\"name\": \"Hari Balakrishnan\", \"id\": 54761}, {\"name\": \"Andrew T. Campbell\", \"id\": 73228}, {\"name\": \"Vehbi Cagri Gungor\", \"id\": 71184}, {\"name\": \"Hongwei Zhang\", \"id\": 79856}, {\"name\": \"Yogesh Sankarasubramaniam\", \"id\": 390962}, {\"name\": \"Lakshman Krishnamurthy\", \"id\": 796243}, {\"name\": \"Raghupathy Sivakumar\", \"id\": 222419}, {\"name\": \"Ian F. Akyildiz\", \"id\": 180218}, {\"name\": \"Atif Sharif\", \"id\": 250236}], \"links\": [{\"source\": 405153, \"target\": 69699}, {\"source\": 405153, \"target\": 250236}, {\"source\": 405153, \"target\": 54761}, {\"source\": 69699, \"target\": 54761}, {\"source\": 69699, \"target\": 180218}, {\"source\": 69699, \"target\": 250236}, {\"source\": 497573, \"target\": 71184}, {\"source\": 497573, \"target\": 73228}, {\"source\": 497573, \"target\": 180218}, {\"source\": 497573, \"target\": 250236}, {\"source\": 225478, \"target\": 71184}, {\"source\": 225478, \"target\": 180218}, {\"source\": 225478, \"target\": 54761}, {\"source\": 225478, \"target\": 73228}, {\"source\": 225478, \"target\": 222419}, {\"source\": 225478, \"target\": 300647}, {\"source\": 225478, \"target\": 390962}, {\"source\": 225478, \"target\": 250236}, {\"source\": 300647, \"target\": 71184}, {\"source\": 300647, \"target\": 180218}, {\"source\": 300647, \"target\": 250236}, {\"source\": 300647, \"target\": 54761}, {\"source\": 54761, \"target\": 73228}, {\"source\": 54761, \"target\": 71184}, {\"source\": 54761, \"target\": 79856}, {\"source\": 54761, \"target\": 180218}, {\"source\": 54761, \"target\": 222419}, {\"source\": 54761, \"target\": 250236}, {\"source\": 73228, \"target\": 71184}, {\"source\": 73228, \"target\": 180218}, {\"source\": 73228, \"target\": 390962}, {\"source\": 73228, \"target\": 796243}, {\"source\": 73228, \"target\": 222419}, {\"source\": 73228, \"target\": 250236}, {\"source\": 71184, \"target\": 180218}, {\"source\": 71184, \"target\": 222419}, {\"source\": 71184, \"target\": 390962}, {\"source\": 71184, \"target\": 250236}, {\"source\": 79856, \"target\": 180218}, {\"source\": 79856, \"target\": 250236}, {\"source\": 390962, \"target\": 180218}, {\"source\": 390962, \"target\": 222419}, {\"source\": 390962, \"target\": 250236}, {\"source\": 796243, \"target\": 180218}, {\"source\": 796243, \"target\": 222419}, {\"source\": 796243, \"target\": 250236}, {\"source\": 222419, \"target\": 180218}, {\"source\": 222419, \"target\": 250236}, {\"source\": 180218, \"target\": 250236}]}",
"id": 1357,
"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: Shashidhar Gandham, S. Venkatesan, A. J. Dinusha Rathnayaka, Tommaso Melodia, Kaushik R. Chowdhury, Hari Balakrishnan, Andrew T. Campbell, Vehbi Cagri Gungor, Hongwei Zhang, Yogesh Sankarasubramaniam, Lakshman Krishnamurthy, Raghupathy Sivakumar, Ian F. Akyildiz, Atif Sharif\n- Research collaborations between these authors: Shashidhar Gandham and S. Venkatesan, Shashidhar Gandham and Atif Sharif, Shashidhar Gandham and Hari Balakrishnan, S. Venkatesan and Hari Balakrishnan, S. Venkatesan and Ian F. Akyildiz, S. Venkatesan and Atif Sharif, A. J. Dinusha Rathnayaka and Vehbi Cagri Gungor, A. J. Dinusha Rathnayaka and Andrew T. Campbell, A. J. Dinusha Rathnayaka and Ian F. Akyildiz, A. J. Dinusha Rathnayaka and Atif Sharif, Tommaso Melodia and Vehbi Cagri Gungor, Tommaso Melodia and Ian F. Akyildiz, Tommaso Melodia and Hari Balakrishnan, Tommaso Melodia and Andrew T. Campbell, Tommaso Melodia and Raghupathy Sivakumar, Tommaso Melodia and Kaushik R. Chowdhury, Tommaso Melodia and Yogesh Sankarasubramaniam, Tommaso Melodia and Atif Sharif, Kaushik R. Chowdhury and Vehbi Cagri Gungor, Kaushik R. Chowdhury and Ian F. Akyildiz, Kaushik R. Chowdhury and Atif Sharif, Kaushik R. Chowdhury and Hari Balakrishnan, Hari Balakrishnan and Andrew T. Campbell, Hari Balakrishnan and Vehbi Cagri Gungor, Hari Balakrishnan and Hongwei Zhang, Hari Balakrishnan and Ian F. Akyildiz, Hari Balakrishnan and Raghupathy Sivakumar, Hari Balakrishnan and Atif Sharif, Andrew T. Campbell and Vehbi Cagri Gungor, Andrew T. Campbell and Ian F. Akyildiz, Andrew T. Campbell and Yogesh Sankarasubramaniam, Andrew T. Campbell and Lakshman Krishnamurthy, Andrew T. Campbell and Raghupathy Sivakumar, Andrew T. Campbell and Atif Sharif, Vehbi Cagri Gungor and Ian F. Akyildiz, Vehbi Cagri Gungor and Raghupathy Sivakumar, Vehbi Cagri Gungor and Yogesh Sankarasubramaniam, Vehbi Cagri Gungor and Atif Sharif, Hongwei Zhang and Ian F. Akyildiz, Hongwei Zhang and Atif Sharif, Yogesh Sankarasubramaniam and Ian F. Akyildiz, Yogesh Sankarasubramaniam and Raghupathy Sivakumar, Yogesh Sankarasubramaniam and Atif Sharif, Lakshman Krishnamurthy and Ian F. Akyildiz, Lakshman Krishnamurthy and Raghupathy Sivakumar, Lakshman Krishnamurthy and Atif Sharif, Raghupathy Sivakumar and Ian F. Akyildiz, Raghupathy Sivakumar and Atif Sharif, Ian F. Akyildiz and Atif Sharif.\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: Biswanath Mukherjee, Fernando A. Kuipers, Nasir Ghani, Gil Zussman, Aradhana Narula-Tam, Ferhat Dikbiyik, Arunabha Sen, Massimo Tornatore, My T. Thai, Piet Van Mieghem, Yufei Cheng, Sebastian Neumayer, Eytan Modiano, James P. G. Sterbenz\n- Research collaborations between these authors: Biswanath Mukherjee and Eytan Modiano, Biswanath Mukherjee and Nasir Ghani, Biswanath Mukherjee and Gil Zussman, Biswanath Mukherjee and Massimo Tornatore, Biswanath Mukherjee and Ferhat Dikbiyik, Biswanath Mukherjee and Aradhana Narula-Tam, Biswanath Mukherjee and Sebastian Neumayer, Biswanath Mukherjee and Fernando A. Kuipers, Fernando A. Kuipers and Piet Van Mieghem, Fernando A. Kuipers and Eytan Modiano, Fernando A. Kuipers and James P. G. Sterbenz, Fernando A. Kuipers and Massimo Tornatore, Fernando A. Kuipers and Arunabha Sen, Fernando A. Kuipers and Sebastian Neumayer, Nasir Ghani and Eytan Modiano, Nasir Ghani and Gil Zussman, Nasir Ghani and Arunabha Sen, Nasir Ghani and Sebastian Neumayer, Nasir Ghani and Massimo Tornatore, Gil Zussman and Eytan Modiano, Gil Zussman and James P. G. Sterbenz, Gil Zussman and My T. Thai, Gil Zussman and Arunabha Sen, Gil Zussman and Massimo Tornatore, Gil Zussman and Ferhat Dikbiyik, Gil Zussman and Yufei Cheng, Gil Zussman and Sebastian Neumayer, Aradhana Narula-Tam and Eytan Modiano, Aradhana Narula-Tam and Massimo Tornatore, Aradhana Narula-Tam and Sebastian Neumayer, Ferhat Dikbiyik and Massimo Tornatore, Ferhat Dikbiyik and Eytan Modiano, Ferhat Dikbiyik and Sebastian Neumayer, Arunabha Sen and Piet Van Mieghem, Arunabha Sen and Eytan Modiano, Arunabha Sen and My T. Thai, Arunabha Sen and Sebastian Neumayer, Massimo Tornatore and Eytan Modiano, Massimo Tornatore and James P. G. Sterbenz, Massimo Tornatore and Sebastian Neumayer, My T. Thai and Eytan Modiano, My T. Thai and Sebastian Neumayer, Piet Van Mieghem and Eytan Modiano, Piet Van Mieghem and Sebastian Neumayer, Yufei Cheng and James P. G. Sterbenz, Yufei Cheng and Eytan Modiano, Yufei Cheng and Sebastian Neumayer, Sebastian Neumayer and Eytan Modiano, Sebastian Neumayer and James P. G. Sterbenz, Eytan Modiano 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": 6,
"style": "rule"
}
|
{
"exact_answer": 6,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Biswanath Mukherjee\", \"id\": 130466}, {\"name\": \"Fernando A. Kuipers\", \"id\": 160997}, {\"name\": \"Nasir Ghani\", \"id\": 66086}, {\"name\": \"Gil Zussman\", \"id\": 191914}, {\"name\": \"Aradhana Narula-Tam\", \"id\": 569647}, {\"name\": \"Eytan Modiano\", \"id\": 27581}, {\"name\": \"Ferhat Dikbiyik\", \"id\": 294450}, {\"name\": \"Arunabha Sen\", \"id\": 249107}, {\"name\": \"Massimo Tornatore\", \"id\": 207506}, {\"name\": \"Piet Van Mieghem\", \"id\": 26040}, {\"name\": \"Yufei Cheng\", \"id\": 432922}, {\"name\": \"Sebastian Neumayer\", \"id\": 721276}, {\"name\": \"My T. Thai\", \"id\": 132157}, {\"name\": \"James P. G. Sterbenz\", \"id\": 93919}], \"links\": [{\"source\": 130466, \"target\": 27581}, {\"source\": 130466, \"target\": 66086}, {\"source\": 130466, \"target\": 191914}, {\"source\": 130466, \"target\": 207506}, {\"source\": 130466, \"target\": 294450}, {\"source\": 130466, \"target\": 569647}, {\"source\": 130466, \"target\": 721276}, {\"source\": 130466, \"target\": 160997}, {\"source\": 160997, \"target\": 26040}, {\"source\": 160997, \"target\": 27581}, {\"source\": 160997, \"target\": 93919}, {\"source\": 160997, \"target\": 207506}, {\"source\": 160997, \"target\": 249107}, {\"source\": 160997, \"target\": 721276}, {\"source\": 66086, \"target\": 27581}, {\"source\": 66086, \"target\": 191914}, {\"source\": 66086, \"target\": 249107}, {\"source\": 66086, \"target\": 721276}, {\"source\": 66086, \"target\": 207506}, {\"source\": 191914, \"target\": 27581}, {\"source\": 191914, \"target\": 93919}, {\"source\": 191914, \"target\": 132157}, {\"source\": 191914, \"target\": 249107}, {\"source\": 191914, \"target\": 207506}, {\"source\": 191914, \"target\": 294450}, {\"source\": 191914, \"target\": 432922}, {\"source\": 191914, \"target\": 721276}, {\"source\": 569647, \"target\": 27581}, {\"source\": 569647, \"target\": 207506}, {\"source\": 569647, \"target\": 721276}, {\"source\": 27581, \"target\": 26040}, {\"source\": 27581, \"target\": 249107}, {\"source\": 27581, \"target\": 721276}, {\"source\": 27581, \"target\": 93919}, {\"source\": 27581, \"target\": 132157}, {\"source\": 27581, \"target\": 207506}, {\"source\": 27581, \"target\": 294450}, {\"source\": 27581, \"target\": 432922}, {\"source\": 294450, \"target\": 207506}, {\"source\": 294450, \"target\": 721276}, {\"source\": 249107, \"target\": 26040}, {\"source\": 249107, \"target\": 132157}, {\"source\": 249107, \"target\": 721276}, {\"source\": 207506, \"target\": 93919}, {\"source\": 207506, \"target\": 721276}, {\"source\": 26040, \"target\": 721276}, {\"source\": 432922, \"target\": 93919}, {\"source\": 432922, \"target\": 721276}, {\"source\": 721276, \"target\": 93919}, {\"source\": 721276, \"target\": 132157}]}",
"id": 434,
"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: Biswanath Mukherjee, Fernando A. Kuipers, Nasir Ghani, Gil Zussman, Aradhana Narula-Tam, Ferhat Dikbiyik, Arunabha Sen, Massimo Tornatore, My T. Thai, Piet Van Mieghem, Yufei Cheng, Sebastian Neumayer, Eytan Modiano, James P. G. Sterbenz\n- Research collaborations between these authors: Biswanath Mukherjee and Eytan Modiano, Biswanath Mukherjee and Nasir Ghani, Biswanath Mukherjee and Gil Zussman, Biswanath Mukherjee and Massimo Tornatore, Biswanath Mukherjee and Ferhat Dikbiyik, Biswanath Mukherjee and Aradhana Narula-Tam, Biswanath Mukherjee and Sebastian Neumayer, Biswanath Mukherjee and Fernando A. Kuipers, Fernando A. Kuipers and Piet Van Mieghem, Fernando A. Kuipers and Eytan Modiano, Fernando A. Kuipers and James P. G. Sterbenz, Fernando A. Kuipers and Massimo Tornatore, Fernando A. Kuipers and Arunabha Sen, Fernando A. Kuipers and Sebastian Neumayer, Nasir Ghani and Eytan Modiano, Nasir Ghani and Gil Zussman, Nasir Ghani and Arunabha Sen, Nasir Ghani and Sebastian Neumayer, Nasir Ghani and Massimo Tornatore, Gil Zussman and Eytan Modiano, Gil Zussman and James P. G. Sterbenz, Gil Zussman and My T. Thai, Gil Zussman and Arunabha Sen, Gil Zussman and Massimo Tornatore, Gil Zussman and Ferhat Dikbiyik, Gil Zussman and Yufei Cheng, Gil Zussman and Sebastian Neumayer, Aradhana Narula-Tam and Eytan Modiano, Aradhana Narula-Tam and Massimo Tornatore, Aradhana Narula-Tam and Sebastian Neumayer, Ferhat Dikbiyik and Massimo Tornatore, Ferhat Dikbiyik and Eytan Modiano, Ferhat Dikbiyik and Sebastian Neumayer, Arunabha Sen and Piet Van Mieghem, Arunabha Sen and Eytan Modiano, Arunabha Sen and My T. Thai, Arunabha Sen and Sebastian Neumayer, Massimo Tornatore and Eytan Modiano, Massimo Tornatore and James P. G. Sterbenz, Massimo Tornatore and Sebastian Neumayer, My T. Thai and Eytan Modiano, My T. Thai and Sebastian Neumayer, Piet Van Mieghem and Eytan Modiano, Piet Van Mieghem and Sebastian Neumayer, Yufei Cheng and James P. G. Sterbenz, Yufei Cheng and Eytan Modiano, Yufei Cheng and Sebastian Neumayer, Sebastian Neumayer and Eytan Modiano, Sebastian Neumayer and James P. G. Sterbenz, Eytan Modiano 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: Pawel Blasiak, A. Horzela, K. A. Penson, Hoang Ngoc Minh, Jean-Marc Champarnaud, Gérard Duchamp, Rawan Ghnemat, Jean-Christophe Novelli, Marianne Flouret, Éric Laugerotte, Gérard Henry Edmond Duchamp, Allan I. Solomon, Cyrille Bertelle, Jean-Yves Thibon\n- Research collaborations between these authors: Pawel Blasiak and Gérard Henry Edmond Duchamp, Pawel Blasiak and K. A. Penson, A. Horzela and Gérard Henry Edmond Duchamp, A. Horzela and K. A. Penson, K. A. Penson and Gérard Henry Edmond Duchamp, K. A. Penson and Allan I. Solomon, Hoang Ngoc Minh and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Éric Laugerotte, Gérard Duchamp and Gérard Henry Edmond Duchamp, Rawan Ghnemat and Cyrille Bertelle, Rawan Ghnemat and Gérard Henry Edmond Duchamp, Jean-Christophe Novelli and Jean-Yves Thibon, Jean-Christophe Novelli and Gérard Henry Edmond Duchamp, Marianne Flouret and Gérard Henry Edmond Duchamp, Marianne Flouret and Éric Laugerotte, Éric Laugerotte and Gérard Henry Edmond Duchamp, Gérard Henry Edmond Duchamp and Allan I. Solomon, Gérard Henry Edmond Duchamp and Cyrille Bertelle, Gérard Henry Edmond Duchamp and Jean-Yves Thibon.\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\": \"Pawel Blasiak\", \"id\": 413312}, {\"name\": \"A. Horzela\", \"id\": 413313}, {\"name\": \"Hoang Ngoc Minh\", \"id\": 147079}, {\"name\": \"Allan I. Solomon\", \"id\": 385687}, {\"name\": \"Jean-Marc Champarnaud\", \"id\": 47850}, {\"name\": \"G\\u00e9rard Duchamp\", \"id\": 112971}, {\"name\": \"Rawan Ghnemat\", \"id\": 386061}, {\"name\": \"Jean-Christophe Novelli\", \"id\": 424912}, {\"name\": \"Marianne Flouret\", \"id\": 61233}, {\"name\": \"\\u00c9ric Laugerotte\", \"id\": 198993}, {\"name\": \"G\\u00e9rard Henry Edmond Duchamp\", \"id\": 11732}, {\"name\": \"K. A. Penson\", \"id\": 11735}, {\"name\": \"Cyrille Bertelle\", \"id\": 94013}, {\"name\": \"Jean-Yves Thibon\", \"id\": 238367}], \"links\": [{\"source\": 413312, \"target\": 11732}, {\"source\": 413312, \"target\": 11735}, {\"source\": 413313, \"target\": 11732}, {\"source\": 413313, \"target\": 11735}, {\"source\": 147079, \"target\": 11732}, {\"source\": 385687, \"target\": 11732}, {\"source\": 385687, \"target\": 11735}, {\"source\": 47850, \"target\": 11732}, {\"source\": 47850, \"target\": 198993}, {\"source\": 112971, \"target\": 11732}, {\"source\": 386061, \"target\": 94013}, {\"source\": 386061, \"target\": 11732}, {\"source\": 424912, \"target\": 238367}, {\"source\": 424912, \"target\": 11732}, {\"source\": 61233, \"target\": 11732}, {\"source\": 61233, \"target\": 198993}, {\"source\": 198993, \"target\": 11732}, {\"source\": 11732, \"target\": 11735}, {\"source\": 11732, \"target\": 94013}, {\"source\": 11732, \"target\": 238367}]}",
"id": 1314,
"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: Pawel Blasiak, A. Horzela, K. A. Penson, Hoang Ngoc Minh, Jean-Marc Champarnaud, Gérard Duchamp, Rawan Ghnemat, Jean-Christophe Novelli, Marianne Flouret, Éric Laugerotte, Gérard Henry Edmond Duchamp, Allan I. Solomon, Cyrille Bertelle, Jean-Yves Thibon\n- Research collaborations between these authors: Pawel Blasiak and Gérard Henry Edmond Duchamp, Pawel Blasiak and K. A. Penson, A. Horzela and Gérard Henry Edmond Duchamp, A. Horzela and K. A. Penson, K. A. Penson and Gérard Henry Edmond Duchamp, K. A. Penson and Allan I. Solomon, Hoang Ngoc Minh and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Éric Laugerotte, Gérard Duchamp and Gérard Henry Edmond Duchamp, Rawan Ghnemat and Cyrille Bertelle, Rawan Ghnemat and Gérard Henry Edmond Duchamp, Jean-Christophe Novelli and Jean-Yves Thibon, Jean-Christophe Novelli and Gérard Henry Edmond Duchamp, Marianne Flouret and Gérard Henry Edmond Duchamp, Marianne Flouret and Éric Laugerotte, Éric Laugerotte and Gérard Henry Edmond Duchamp, Gérard Henry Edmond Duchamp and Allan I. Solomon, Gérard Henry Edmond Duchamp and Cyrille Bertelle, Gérard Henry Edmond Duchamp and Jean-Yves Thibon.\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: Hyun-Ki Hong, Jonathan Cook, Hong-Jiang Zhang, Meng Wang, Daniel Oram, Jin-Woo Jeong, Toby Howard, Hans-Peter Seidel, Wei-Ying Ma, Dong-Ho Lee, Simon Gibson, Shuicheng Yan, Tomas Pajdla, Roger J. Hubbold\n- Research collaborations between these authors: Hyun-Ki Hong and Dong-Ho Lee, Hyun-Ki Hong and Shuicheng Yan, Hyun-Ki Hong and Hans-Peter Seidel, Hyun-Ki Hong and Meng Wang, Hyun-Ki Hong and Hong-Jiang Zhang, Hyun-Ki Hong and Wei-Ying Ma, Hyun-Ki Hong and Tomas Pajdla, Hyun-Ki Hong and Jin-Woo Jeong, Hyun-Ki Hong and Roger J. Hubbold, Hyun-Ki Hong and Simon Gibson, Hyun-Ki Hong and Toby Howard, Hyun-Ki Hong and Jonathan Cook, Hyun-Ki Hong and Daniel Oram, Jonathan Cook and Roger J. Hubbold, Jonathan Cook and Simon Gibson, Jonathan Cook and Toby Howard, Hong-Jiang Zhang and Shuicheng Yan, Hong-Jiang Zhang and Meng Wang, Hong-Jiang Zhang and Wei-Ying Ma, Hong-Jiang Zhang and Jin-Woo Jeong, Hong-Jiang Zhang and Dong-Ho Lee, Meng Wang and Shuicheng Yan, Meng Wang and Wei-Ying Ma, Meng Wang and Jin-Woo Jeong, Meng Wang and Dong-Ho Lee, Jin-Woo Jeong and Shuicheng Yan, Jin-Woo Jeong and Wei-Ying Ma, Jin-Woo Jeong and Dong-Ho Lee, Toby Howard and Hans-Peter Seidel, Toby Howard and Roger J. Hubbold, Toby Howard and Simon Gibson, Hans-Peter Seidel and Roger J. Hubbold, Hans-Peter Seidel and Simon Gibson, Wei-Ying Ma and Shuicheng Yan, Wei-Ying Ma and Dong-Ho Lee, Dong-Ho Lee and Shuicheng Yan, Simon Gibson and Roger J. Hubbold.\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\": \"Hyun-Ki Hong\", \"id\": 230723}, {\"name\": \"Jonathan Cook\", \"id\": 517030}, {\"name\": \"Hong-Jiang Zhang\", \"id\": 32362}, {\"name\": \"Meng Wang\", \"id\": 29900}, {\"name\": \"Daniel Oram\", \"id\": 1051472}, {\"name\": \"Jin-Woo Jeong\", \"id\": 115507}, {\"name\": \"Toby Howard\", \"id\": 314133}, {\"name\": \"Dong-Ho Lee\", \"id\": 115510}, {\"name\": \"Wei-Ying Ma\", \"id\": 81431}, {\"name\": \"Hans-Peter Seidel\", \"id\": 3127}, {\"name\": \"Simon Gibson\", \"id\": 311194}, {\"name\": \"Shuicheng Yan\", \"id\": 379}, {\"name\": \"Tomas Pajdla\", \"id\": 110429}, {\"name\": \"Roger J. Hubbold\", \"id\": 281823}], \"links\": [{\"source\": 230723, \"target\": 115510}, {\"source\": 230723, \"target\": 379}, {\"source\": 230723, \"target\": 3127}, {\"source\": 230723, \"target\": 29900}, {\"source\": 230723, \"target\": 32362}, {\"source\": 230723, \"target\": 81431}, {\"source\": 230723, \"target\": 110429}, {\"source\": 230723, \"target\": 115507}, {\"source\": 230723, \"target\": 281823}, {\"source\": 230723, \"target\": 311194}, {\"source\": 230723, \"target\": 314133}, {\"source\": 230723, \"target\": 517030}, {\"source\": 230723, \"target\": 1051472}, {\"source\": 517030, \"target\": 281823}, {\"source\": 517030, \"target\": 311194}, {\"source\": 517030, \"target\": 314133}, {\"source\": 32362, \"target\": 379}, {\"source\": 32362, \"target\": 29900}, {\"source\": 32362, \"target\": 81431}, {\"source\": 32362, \"target\": 115507}, {\"source\": 32362, \"target\": 115510}, {\"source\": 29900, \"target\": 379}, {\"source\": 29900, \"target\": 81431}, {\"source\": 29900, \"target\": 115507}, {\"source\": 29900, \"target\": 115510}, {\"source\": 115507, \"target\": 379}, {\"source\": 115507, \"target\": 81431}, {\"source\": 115507, \"target\": 115510}, {\"source\": 314133, \"target\": 3127}, {\"source\": 314133, \"target\": 281823}, {\"source\": 314133, \"target\": 311194}, {\"source\": 115510, \"target\": 379}, {\"source\": 115510, \"target\": 81431}, {\"source\": 81431, \"target\": 379}, {\"source\": 3127, \"target\": 281823}, {\"source\": 3127, \"target\": 311194}, {\"source\": 311194, \"target\": 281823}]}",
"id": 2401,
"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: Hyun-Ki Hong, Jonathan Cook, Hong-Jiang Zhang, Meng Wang, Daniel Oram, Jin-Woo Jeong, Toby Howard, Hans-Peter Seidel, Wei-Ying Ma, Dong-Ho Lee, Simon Gibson, Shuicheng Yan, Tomas Pajdla, Roger J. Hubbold\n- Research collaborations between these authors: Hyun-Ki Hong and Dong-Ho Lee, Hyun-Ki Hong and Shuicheng Yan, Hyun-Ki Hong and Hans-Peter Seidel, Hyun-Ki Hong and Meng Wang, Hyun-Ki Hong and Hong-Jiang Zhang, Hyun-Ki Hong and Wei-Ying Ma, Hyun-Ki Hong and Tomas Pajdla, Hyun-Ki Hong and Jin-Woo Jeong, Hyun-Ki Hong and Roger J. Hubbold, Hyun-Ki Hong and Simon Gibson, Hyun-Ki Hong and Toby Howard, Hyun-Ki Hong and Jonathan Cook, Hyun-Ki Hong and Daniel Oram, Jonathan Cook and Roger J. Hubbold, Jonathan Cook and Simon Gibson, Jonathan Cook and Toby Howard, Hong-Jiang Zhang and Shuicheng Yan, Hong-Jiang Zhang and Meng Wang, Hong-Jiang Zhang and Wei-Ying Ma, Hong-Jiang Zhang and Jin-Woo Jeong, Hong-Jiang Zhang and Dong-Ho Lee, Meng Wang and Shuicheng Yan, Meng Wang and Wei-Ying Ma, Meng Wang and Jin-Woo Jeong, Meng Wang and Dong-Ho Lee, Jin-Woo Jeong and Shuicheng Yan, Jin-Woo Jeong and Wei-Ying Ma, Jin-Woo Jeong and Dong-Ho Lee, Toby Howard and Hans-Peter Seidel, Toby Howard and Roger J. Hubbold, Toby Howard and Simon Gibson, Hans-Peter Seidel and Roger J. Hubbold, Hans-Peter Seidel and Simon Gibson, Wei-Ying Ma and Shuicheng Yan, Wei-Ying Ma and Dong-Ho Lee, Dong-Ho Lee and Shuicheng Yan, Simon Gibson and Roger J. Hubbold.\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: Marvin Tom, Ali Akoglu, Katarina Paulsson, Julien Lamoureux, Ian Kuon, Peter Y. K. Cheung, Miron Abramovici, Wu-chun Feng, Deming Chen, Joydip Das, Charles E. Stroud, Steven J. E. Wilton, Gregory M. Striemer, Adarsha Sreeramareddy\n- Research collaborations between these authors: Marvin Tom and Peter Y. K. Cheung, Marvin Tom and Steven J. E. Wilton, Marvin Tom and Ian Kuon, Marvin Tom and Ali Akoglu, Ali Akoglu and Wu-chun Feng, Ali Akoglu and Charles E. Stroud, Ali Akoglu and Steven J. E. Wilton, Ali Akoglu and Katarina Paulsson, Ali Akoglu and Miron Abramovici, Ali Akoglu and Ian Kuon, Ali Akoglu and Deming Chen, Ali Akoglu and Julien Lamoureux, Ali Akoglu and Adarsha Sreeramareddy, Ali Akoglu and Joydip Das, Ali Akoglu and Gregory M. Striemer, Katarina Paulsson and Adarsha Sreeramareddy, Julien Lamoureux and Peter Y. K. Cheung, Julien Lamoureux and Steven J. E. Wilton, Julien Lamoureux and Deming Chen, Ian Kuon and Peter Y. K. Cheung, Ian Kuon and Steven J. E. Wilton, Peter Y. K. Cheung and Charles E. Stroud, Peter Y. K. Cheung and Steven J. E. Wilton, Peter Y. K. Cheung and Miron Abramovici, Miron Abramovici and Charles E. Stroud, Miron Abramovici and Steven J. E. Wilton, Wu-chun Feng and Gregory M. Striemer, Deming Chen and Steven J. E. Wilton, Joydip Das and Steven J. E. Wilton.\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\": \"Marvin Tom\", \"id\": 479490}, {\"name\": \"Ali Akoglu\", \"id\": 501539}, {\"name\": \"Katarina Paulsson\", \"id\": 178182}, {\"name\": \"Julien Lamoureux\", \"id\": 403815}, {\"name\": \"Ian Kuon\", \"id\": 280937}, {\"name\": \"Peter Y. K. Cheung\", \"id\": 114122}, {\"name\": \"Miron Abramovici\", \"id\": 236204}, {\"name\": \"Wu-chun Feng\", \"id\": 134704}, {\"name\": \"Deming Chen\", \"id\": 336272}, {\"name\": \"Joydip Das\", \"id\": 748400}, {\"name\": \"Charles E. Stroud\", \"id\": 40535}, {\"name\": \"Steven J. E. Wilton\", \"id\": 150234}, {\"name\": \"Gregory M. Striemer\", \"id\": 690429}, {\"name\": \"Adarsha Sreeramareddy\", \"id\": 683358}], \"links\": [{\"source\": 479490, \"target\": 114122}, {\"source\": 479490, \"target\": 150234}, {\"source\": 479490, \"target\": 280937}, {\"source\": 479490, \"target\": 501539}, {\"source\": 501539, \"target\": 134704}, {\"source\": 501539, \"target\": 40535}, {\"source\": 501539, \"target\": 150234}, {\"source\": 501539, \"target\": 178182}, {\"source\": 501539, \"target\": 236204}, {\"source\": 501539, \"target\": 280937}, {\"source\": 501539, \"target\": 336272}, {\"source\": 501539, \"target\": 403815}, {\"source\": 501539, \"target\": 683358}, {\"source\": 501539, \"target\": 748400}, {\"source\": 501539, \"target\": 690429}, {\"source\": 178182, \"target\": 683358}, {\"source\": 403815, \"target\": 114122}, {\"source\": 403815, \"target\": 150234}, {\"source\": 403815, \"target\": 336272}, {\"source\": 280937, \"target\": 114122}, {\"source\": 280937, \"target\": 150234}, {\"source\": 114122, \"target\": 40535}, {\"source\": 114122, \"target\": 150234}, {\"source\": 114122, \"target\": 236204}, {\"source\": 236204, \"target\": 40535}, {\"source\": 236204, \"target\": 150234}, {\"source\": 134704, \"target\": 690429}, {\"source\": 336272, \"target\": 150234}, {\"source\": 748400, \"target\": 150234}]}",
"id": 2829,
"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: Marvin Tom, Ali Akoglu, Katarina Paulsson, Julien Lamoureux, Ian Kuon, Peter Y. K. Cheung, Miron Abramovici, Wu-chun Feng, Deming Chen, Joydip Das, Charles E. Stroud, Steven J. E. Wilton, Gregory M. Striemer, Adarsha Sreeramareddy\n- Research collaborations between these authors: Marvin Tom and Peter Y. K. Cheung, Marvin Tom and Steven J. E. Wilton, Marvin Tom and Ian Kuon, Marvin Tom and Ali Akoglu, Ali Akoglu and Wu-chun Feng, Ali Akoglu and Charles E. Stroud, Ali Akoglu and Steven J. E. Wilton, Ali Akoglu and Katarina Paulsson, Ali Akoglu and Miron Abramovici, Ali Akoglu and Ian Kuon, Ali Akoglu and Deming Chen, Ali Akoglu and Julien Lamoureux, Ali Akoglu and Adarsha Sreeramareddy, Ali Akoglu and Joydip Das, Ali Akoglu and Gregory M. Striemer, Katarina Paulsson and Adarsha Sreeramareddy, Julien Lamoureux and Peter Y. K. Cheung, Julien Lamoureux and Steven J. E. Wilton, Julien Lamoureux and Deming Chen, Ian Kuon and Peter Y. K. Cheung, Ian Kuon and Steven J. E. Wilton, Peter Y. K. Cheung and Charles E. Stroud, Peter Y. K. Cheung and Steven J. E. Wilton, Peter Y. K. Cheung and Miron Abramovici, Miron Abramovici and Charles E. Stroud, Miron Abramovici and Steven J. E. Wilton, Wu-chun Feng and Gregory M. Striemer, Deming Chen and Steven J. E. Wilton, Joydip Das and Steven J. E. Wilton.\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: Yasmeen Akhtar, Alan Hartman, Virgil D. Gligor, Soumen Maity, S. Ramsundar, Charles J. Colbourn, Leonid Raskin, Pramod K. Varshney, Amiya Nayak, Ramesh Govindan, Dijiang Huang, Myra B. Cohen, Renée C. Bryce, Bimal K. Roy\n- Research collaborations between these authors: Yasmeen Akhtar and Soumen Maity, Alan Hartman and Charles J. Colbourn, Alan Hartman and Myra B. Cohen, Alan Hartman and Renée C. Bryce, Alan Hartman and Soumen Maity, Virgil D. Gligor and Amiya Nayak, Virgil D. Gligor and Dijiang Huang, Virgil D. Gligor and Pramod K. Varshney, Virgil D. Gligor and Bimal K. Roy, Soumen Maity and Amiya Nayak, Soumen Maity and Charles J. Colbourn, Soumen Maity and Myra B. Cohen, Soumen Maity and Bimal K. Roy, Soumen Maity and Leonid Raskin, Soumen Maity and S. Ramsundar, S. Ramsundar and Amiya Nayak, S. Ramsundar and Bimal K. Roy, Charles J. Colbourn and Myra B. Cohen, Charles J. Colbourn and Renée C. Bryce, Charles J. Colbourn and Leonid Raskin, Leonid Raskin and Myra B. Cohen, Leonid Raskin and Renée C. Bryce, Pramod K. Varshney and Amiya Nayak, Pramod K. Varshney and Dijiang Huang, Pramod K. Varshney and Ramesh Govindan, Pramod K. Varshney and Bimal K. Roy, Amiya Nayak and Dijiang Huang, Amiya Nayak and Ramesh Govindan, Amiya Nayak and Bimal K. Roy, Ramesh Govindan and Bimal K. Roy, Dijiang Huang and Bimal K. Roy, Myra B. Cohen and Renée C. Bryce.\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\": \"Alan Hartman\", \"id\": 218272}, {\"name\": \"Virgil D. Gligor\", \"id\": 84385}, {\"name\": \"Charles J. Colbourn\", \"id\": 6884}, {\"name\": \"Soumen Maity\", \"id\": 317188}, {\"name\": \"S. Ramsundar\", \"id\": 317189}, {\"name\": \"Leonid Raskin\", \"id\": 956548}, {\"name\": \"Pramod K. Varshney\", \"id\": 80840}, {\"name\": \"Bimal K. Roy\", \"id\": 103864}, {\"name\": \"Amiya Nayak\", \"id\": 1354}, {\"name\": \"Ramesh Govindan\", \"id\": 52940}, {\"name\": \"Dijiang Huang\", \"id\": 51064}, {\"name\": \"Myra B. Cohen\", \"id\": 61077}, {\"name\": \"Ren\\u00e9e C. Bryce\", \"id\": 133653}, {\"name\": \"Yasmeen Akhtar\", \"id\": 1182968}], \"links\": [{\"source\": 218272, \"target\": 6884}, {\"source\": 218272, \"target\": 61077}, {\"source\": 218272, \"target\": 133653}, {\"source\": 218272, \"target\": 317188}, {\"source\": 84385, \"target\": 1354}, {\"source\": 84385, \"target\": 51064}, {\"source\": 84385, \"target\": 80840}, {\"source\": 84385, \"target\": 103864}, {\"source\": 6884, \"target\": 61077}, {\"source\": 6884, \"target\": 133653}, {\"source\": 6884, \"target\": 956548}, {\"source\": 6884, \"target\": 317188}, {\"source\": 317188, \"target\": 1354}, {\"source\": 317188, \"target\": 61077}, {\"source\": 317188, \"target\": 103864}, {\"source\": 317188, \"target\": 956548}, {\"source\": 317188, \"target\": 317189}, {\"source\": 317188, \"target\": 1182968}, {\"source\": 317189, \"target\": 1354}, {\"source\": 317189, \"target\": 103864}, {\"source\": 956548, \"target\": 61077}, {\"source\": 956548, \"target\": 133653}, {\"source\": 80840, \"target\": 1354}, {\"source\": 80840, \"target\": 51064}, {\"source\": 80840, \"target\": 52940}, {\"source\": 80840, \"target\": 103864}, {\"source\": 103864, \"target\": 1354}, {\"source\": 103864, \"target\": 51064}, {\"source\": 103864, \"target\": 52940}, {\"source\": 1354, \"target\": 51064}, {\"source\": 1354, \"target\": 52940}, {\"source\": 61077, \"target\": 133653}]}",
"id": 43,
"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: Yasmeen Akhtar, Alan Hartman, Virgil D. Gligor, Soumen Maity, S. Ramsundar, Charles J. Colbourn, Leonid Raskin, Pramod K. Varshney, Amiya Nayak, Ramesh Govindan, Dijiang Huang, Myra B. Cohen, Renée C. Bryce, Bimal K. Roy\n- Research collaborations between these authors: Yasmeen Akhtar and Soumen Maity, Alan Hartman and Charles J. Colbourn, Alan Hartman and Myra B. Cohen, Alan Hartman and Renée C. Bryce, Alan Hartman and Soumen Maity, Virgil D. Gligor and Amiya Nayak, Virgil D. Gligor and Dijiang Huang, Virgil D. Gligor and Pramod K. Varshney, Virgil D. Gligor and Bimal K. Roy, Soumen Maity and Amiya Nayak, Soumen Maity and Charles J. Colbourn, Soumen Maity and Myra B. Cohen, Soumen Maity and Bimal K. Roy, Soumen Maity and Leonid Raskin, Soumen Maity and S. Ramsundar, S. Ramsundar and Amiya Nayak, S. Ramsundar and Bimal K. Roy, Charles J. Colbourn and Myra B. Cohen, Charles J. Colbourn and Renée C. Bryce, Charles J. Colbourn and Leonid Raskin, Leonid Raskin and Myra B. Cohen, Leonid Raskin and Renée C. Bryce, Pramod K. Varshney and Amiya Nayak, Pramod K. Varshney and Dijiang Huang, Pramod K. Varshney and Ramesh Govindan, Pramod K. Varshney and Bimal K. Roy, Amiya Nayak and Dijiang Huang, Amiya Nayak and Ramesh Govindan, Amiya Nayak and Bimal K. Roy, Ramesh Govindan and Bimal K. Roy, Dijiang Huang and Bimal K. Roy, Myra B. Cohen and Renée C. Bryce.\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: Graham Kendall, Yuhui Shi, Ruibin Bai, Teodor Gabriel Crainic, Quande Qin, Uwe Aickelin, Michel Gendreau, Sanja Petrovic, Edmund K. Burke, Rong Qu, Cynthia Barnhart, John R. Woodward, Nasser R. Sabar, Ender Özcan\n- Research collaborations between these authors: Graham Kendall and Ender Özcan, Graham Kendall and Sanja Petrovic, Graham Kendall and John R. Woodward, Graham Kendall and Rong Qu, Graham Kendall and Uwe Aickelin, Graham Kendall and Michel Gendreau, Graham Kendall and Nasser R. Sabar, Graham Kendall and Edmund K. Burke, Graham Kendall and Teodor Gabriel Crainic, Graham Kendall and Ruibin Bai, Yuhui Shi and Quande Qin, Yuhui Shi and Ruibin Bai, Ruibin Bai and Ender Özcan, Ruibin Bai and John R. Woodward, Ruibin Bai and Rong Qu, Ruibin Bai and Nasser R. Sabar, Ruibin Bai and Edmund K. Burke, Ruibin Bai and Sanja Petrovic, Ruibin Bai and Quande Qin, Ruibin Bai and Uwe Aickelin, Ruibin Bai and Michel Gendreau, Ruibin Bai and Teodor Gabriel Crainic, Ruibin Bai and Cynthia Barnhart, Teodor Gabriel Crainic and Ender Özcan, Teodor Gabriel Crainic and John R. Woodward, Teodor Gabriel Crainic and Rong Qu, Teodor Gabriel Crainic and Michel Gendreau, Teodor Gabriel Crainic and Edmund K. Burke, Teodor Gabriel Crainic and Cynthia Barnhart, Uwe Aickelin and Ender Özcan, Uwe Aickelin and Sanja Petrovic, Uwe Aickelin and Rong Qu, Uwe Aickelin and Edmund K. Burke, Michel Gendreau and Ender Özcan, Michel Gendreau and Sanja Petrovic, Michel Gendreau and John R. Woodward, Michel Gendreau and Rong Qu, Michel Gendreau and Edmund K. Burke, Michel Gendreau and Cynthia Barnhart, Michel Gendreau and Nasser R. Sabar, Sanja Petrovic and Ender Özcan, Sanja Petrovic and Rong Qu, Sanja Petrovic and Edmund K. Burke, Sanja Petrovic and John R. Woodward, Sanja Petrovic and Nasser R. Sabar, Edmund K. Burke and Ender Özcan, Edmund K. Burke and John R. Woodward, Edmund K. Burke and Rong Qu, Edmund K. Burke and Nasser R. Sabar, Edmund K. Burke and Cynthia Barnhart, Rong Qu and Ender Özcan, Rong Qu and John R. Woodward, Rong Qu and Nasser R. Sabar, John R. Woodward and Ender Özcan, John R. Woodward and Nasser R. Sabar, Nasser R. Sabar and Ender Özcan.\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\": \"Graham Kendall\", \"id\": 55042}, {\"name\": \"Yuhui Shi\", \"id\": 3619}, {\"name\": \"Ruibin Bai\", \"id\": 207812}, {\"name\": \"Quande Qin\", \"id\": 83909}, {\"name\": \"Ender \\u00d6zcan\", \"id\": 27999}, {\"name\": \"Uwe Aickelin\", \"id\": 97799}, {\"name\": \"Michel Gendreau\", \"id\": 148688}, {\"name\": \"Sanja Petrovic\", \"id\": 28208}, {\"name\": \"Edmund K. Burke\", \"id\": 162067}, {\"name\": \"Rong Qu\", \"id\": 64820}, {\"name\": \"Cynthia Barnhart\", \"id\": 302524}, {\"name\": \"John R. Woodward\", \"id\": 54813}, {\"name\": \"Nasser R. Sabar\", \"id\": 150398}, {\"name\": \"Teodor Gabriel Crainic\", \"id\": 190687}], \"links\": [{\"source\": 55042, \"target\": 27999}, {\"source\": 55042, \"target\": 28208}, {\"source\": 55042, \"target\": 54813}, {\"source\": 55042, \"target\": 64820}, {\"source\": 55042, \"target\": 97799}, {\"source\": 55042, \"target\": 148688}, {\"source\": 55042, \"target\": 150398}, {\"source\": 55042, \"target\": 162067}, {\"source\": 55042, \"target\": 190687}, {\"source\": 55042, \"target\": 207812}, {\"source\": 3619, \"target\": 83909}, {\"source\": 3619, \"target\": 207812}, {\"source\": 207812, \"target\": 27999}, {\"source\": 207812, \"target\": 54813}, {\"source\": 207812, \"target\": 64820}, {\"source\": 207812, \"target\": 150398}, {\"source\": 207812, \"target\": 162067}, {\"source\": 207812, \"target\": 28208}, {\"source\": 207812, \"target\": 83909}, {\"source\": 207812, \"target\": 97799}, {\"source\": 207812, \"target\": 148688}, {\"source\": 207812, \"target\": 190687}, {\"source\": 207812, \"target\": 302524}, {\"source\": 27999, \"target\": 28208}, {\"source\": 27999, \"target\": 54813}, {\"source\": 27999, \"target\": 64820}, {\"source\": 27999, \"target\": 97799}, {\"source\": 27999, \"target\": 148688}, {\"source\": 27999, \"target\": 150398}, {\"source\": 27999, \"target\": 162067}, {\"source\": 27999, \"target\": 190687}, {\"source\": 97799, \"target\": 28208}, {\"source\": 97799, \"target\": 64820}, {\"source\": 97799, \"target\": 162067}, {\"source\": 148688, \"target\": 28208}, {\"source\": 148688, \"target\": 54813}, {\"source\": 148688, \"target\": 64820}, {\"source\": 148688, \"target\": 162067}, {\"source\": 148688, \"target\": 190687}, {\"source\": 148688, \"target\": 302524}, {\"source\": 148688, \"target\": 150398}, {\"source\": 28208, \"target\": 64820}, {\"source\": 28208, \"target\": 162067}, {\"source\": 28208, \"target\": 54813}, {\"source\": 28208, \"target\": 150398}, {\"source\": 162067, \"target\": 54813}, {\"source\": 162067, \"target\": 64820}, {\"source\": 162067, \"target\": 150398}, {\"source\": 162067, \"target\": 190687}, {\"source\": 162067, \"target\": 302524}, {\"source\": 64820, \"target\": 54813}, {\"source\": 64820, \"target\": 150398}, {\"source\": 64820, \"target\": 190687}, {\"source\": 302524, \"target\": 190687}, {\"source\": 54813, \"target\": 190687}, {\"source\": 54813, \"target\": 150398}]}",
"id": 103,
"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: Graham Kendall, Yuhui Shi, Ruibin Bai, Teodor Gabriel Crainic, Quande Qin, Uwe Aickelin, Michel Gendreau, Sanja Petrovic, Edmund K. Burke, Rong Qu, Cynthia Barnhart, John R. Woodward, Nasser R. Sabar, Ender Özcan\n- Research collaborations between these authors: Graham Kendall and Ender Özcan, Graham Kendall and Sanja Petrovic, Graham Kendall and John R. Woodward, Graham Kendall and Rong Qu, Graham Kendall and Uwe Aickelin, Graham Kendall and Michel Gendreau, Graham Kendall and Nasser R. Sabar, Graham Kendall and Edmund K. Burke, Graham Kendall and Teodor Gabriel Crainic, Graham Kendall and Ruibin Bai, Yuhui Shi and Quande Qin, Yuhui Shi and Ruibin Bai, Ruibin Bai and Ender Özcan, Ruibin Bai and John R. Woodward, Ruibin Bai and Rong Qu, Ruibin Bai and Nasser R. Sabar, Ruibin Bai and Edmund K. Burke, Ruibin Bai and Sanja Petrovic, Ruibin Bai and Quande Qin, Ruibin Bai and Uwe Aickelin, Ruibin Bai and Michel Gendreau, Ruibin Bai and Teodor Gabriel Crainic, Ruibin Bai and Cynthia Barnhart, Teodor Gabriel Crainic and Ender Özcan, Teodor Gabriel Crainic and John R. Woodward, Teodor Gabriel Crainic and Rong Qu, Teodor Gabriel Crainic and Michel Gendreau, Teodor Gabriel Crainic and Edmund K. Burke, Teodor Gabriel Crainic and Cynthia Barnhart, Uwe Aickelin and Ender Özcan, Uwe Aickelin and Sanja Petrovic, Uwe Aickelin and Rong Qu, Uwe Aickelin and Edmund K. Burke, Michel Gendreau and Ender Özcan, Michel Gendreau and Sanja Petrovic, Michel Gendreau and John R. Woodward, Michel Gendreau and Rong Qu, Michel Gendreau and Edmund K. Burke, Michel Gendreau and Cynthia Barnhart, Michel Gendreau and Nasser R. Sabar, Sanja Petrovic and Ender Özcan, Sanja Petrovic and Rong Qu, Sanja Petrovic and Edmund K. Burke, Sanja Petrovic and John R. Woodward, Sanja Petrovic and Nasser R. Sabar, Edmund K. Burke and Ender Özcan, Edmund K. Burke and John R. Woodward, Edmund K. Burke and Rong Qu, Edmund K. Burke and Nasser R. Sabar, Edmund K. Burke and Cynthia Barnhart, Rong Qu and Ender Özcan, Rong Qu and John R. Woodward, Rong Qu and Nasser R. Sabar, John R. Woodward and Ender Özcan, John R. Woodward and Nasser R. Sabar, Nasser R. Sabar and Ender Özcan.\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: Geňa Hahn, Thomas A. Henzinger, Sebastian Thrun, Anthony Bonato, Alexander Kleiner, Stefano Carpin, Rafael Murrieta-Cid, Andreas Krause, Paweł Prałat, Theodore P. Pachidis, Vassilis G. Kaburlasos, Georgios Konstantinidis, Lali Barrière, Athanasios Kehagias\n- Research collaborations between these authors: Geňa Hahn and Paweł Prałat, Geňa Hahn and Anthony Bonato, Geňa Hahn and Athanasios Kehagias, Thomas A. Henzinger and Athanasios Kehagias, Thomas A. Henzinger and Georgios Konstantinidis, Sebastian Thrun and Andreas Krause, Sebastian Thrun and Stefano Carpin, Sebastian Thrun and Alexander Kleiner, Sebastian Thrun and Rafael Murrieta-Cid, Sebastian Thrun and Athanasios Kehagias, Anthony Bonato and Paweł Prałat, Anthony Bonato and Athanasios Kehagias, Alexander Kleiner and Stefano Carpin, Alexander Kleiner and Athanasios Kehagias, Stefano Carpin and Athanasios Kehagias, Rafael Murrieta-Cid and Athanasios Kehagias, Andreas Krause and Athanasios Kehagias, Paweł Prałat and Athanasios Kehagias, Theodore P. Pachidis and Vassilis G. Kaburlasos, Theodore P. Pachidis and Athanasios Kehagias, Vassilis G. Kaburlasos and Athanasios Kehagias, Georgios Konstantinidis and Athanasios Kehagias, Lali Barrière and Athanasios Kehagias.\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\": \"Ge\\u0148a Hahn\", \"id\": 639042}, {\"name\": \"Thomas A. Henzinger\", \"id\": 12452}, {\"name\": \"Sebastian Thrun\", \"id\": 54500}, {\"name\": \"Anthony Bonato\", \"id\": 92870}, {\"name\": \"Alexander Kleiner\", \"id\": 141732}, {\"name\": \"Stefano Carpin\", \"id\": 112457}, {\"name\": \"Andreas Krause\", \"id\": 31021}, {\"name\": \"Pawe\\u0142 Pra\\u0142at\", \"id\": 46222}, {\"name\": \"Athanasios Kehagias\", \"id\": 167736}, {\"name\": \"Theodore P. Pachidis\", \"id\": 564024}, {\"name\": \"Vassilis G. Kaburlasos\", \"id\": 147221}, {\"name\": \"Georgios Konstantinidis\", \"id\": 211093}, {\"name\": \"Lali Barri\\u00e8re\", \"id\": 231797}, {\"name\": \"Rafael Murrieta-Cid\", \"id\": 149496}], \"links\": [{\"source\": 639042, \"target\": 46222}, {\"source\": 639042, \"target\": 92870}, {\"source\": 639042, \"target\": 167736}, {\"source\": 12452, \"target\": 167736}, {\"source\": 12452, \"target\": 211093}, {\"source\": 54500, \"target\": 31021}, {\"source\": 54500, \"target\": 112457}, {\"source\": 54500, \"target\": 141732}, {\"source\": 54500, \"target\": 149496}, {\"source\": 54500, \"target\": 167736}, {\"source\": 92870, \"target\": 46222}, {\"source\": 92870, \"target\": 167736}, {\"source\": 141732, \"target\": 112457}, {\"source\": 141732, \"target\": 167736}, {\"source\": 112457, \"target\": 167736}, {\"source\": 31021, \"target\": 167736}, {\"source\": 46222, \"target\": 167736}, {\"source\": 167736, \"target\": 147221}, {\"source\": 167736, \"target\": 149496}, {\"source\": 167736, \"target\": 231797}, {\"source\": 167736, \"target\": 211093}, {\"source\": 167736, \"target\": 564024}, {\"source\": 564024, \"target\": 147221}]}",
"id": 1611,
"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: Geňa Hahn, Thomas A. Henzinger, Sebastian Thrun, Anthony Bonato, Alexander Kleiner, Stefano Carpin, Rafael Murrieta-Cid, Andreas Krause, Paweł Prałat, Theodore P. Pachidis, Vassilis G. Kaburlasos, Georgios Konstantinidis, Lali Barrière, Athanasios Kehagias\n- Research collaborations between these authors: Geňa Hahn and Paweł Prałat, Geňa Hahn and Anthony Bonato, Geňa Hahn and Athanasios Kehagias, Thomas A. Henzinger and Athanasios Kehagias, Thomas A. Henzinger and Georgios Konstantinidis, Sebastian Thrun and Andreas Krause, Sebastian Thrun and Stefano Carpin, Sebastian Thrun and Alexander Kleiner, Sebastian Thrun and Rafael Murrieta-Cid, Sebastian Thrun and Athanasios Kehagias, Anthony Bonato and Paweł Prałat, Anthony Bonato and Athanasios Kehagias, Alexander Kleiner and Stefano Carpin, Alexander Kleiner and Athanasios Kehagias, Stefano Carpin and Athanasios Kehagias, Rafael Murrieta-Cid and Athanasios Kehagias, Andreas Krause and Athanasios Kehagias, Paweł Prałat and Athanasios Kehagias, Theodore P. Pachidis and Vassilis G. Kaburlasos, Theodore P. Pachidis and Athanasios Kehagias, Vassilis G. Kaburlasos and Athanasios Kehagias, Georgios Konstantinidis and Athanasios Kehagias, Lali Barrière and Athanasios Kehagias.\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: Allen D. Malony, Sameer Shende, Jean-Thomas Acquaviva, Pablo de Oliveira Castro, Mary W. Hall, Emmanuel Oseret, Denis Barthou, Jean Christophe Beyler, Cédric Valensi, William Jalby, Vincent W. Freeh, José Noudohouenou, William Thies, Souad Koliai\n- Research collaborations between these authors: Allen D. Malony and Sameer Shende, Allen D. Malony and William Jalby, Allen D. Malony and Mary W. Hall, Allen D. Malony and Emmanuel Oseret, Sameer Shende and William Jalby, Sameer Shende and Mary W. Hall, Sameer Shende and Emmanuel Oseret, Jean-Thomas Acquaviva and William Jalby, Jean-Thomas Acquaviva and José Noudohouenou, Pablo de Oliveira Castro and William Jalby, Pablo de Oliveira Castro and William Thies, Pablo de Oliveira Castro and Jean Christophe Beyler, Pablo de Oliveira Castro and Emmanuel Oseret, Mary W. Hall and William Jalby, Mary W. Hall and Denis Barthou, Emmanuel Oseret and William Jalby, Emmanuel Oseret and Souad Koliai, Emmanuel Oseret and Cédric Valensi, Emmanuel Oseret and José Noudohouenou, Denis Barthou and William Jalby, Denis Barthou and William Thies, Denis Barthou and Souad Koliai, Denis Barthou and José Noudohouenou, Jean Christophe Beyler and William Jalby, Jean Christophe Beyler and Vincent W. Freeh, Jean Christophe Beyler and José Noudohouenou, Cédric Valensi and William Jalby, Cédric Valensi and José Noudohouenou, William Jalby and Vincent W. Freeh, William Jalby and Souad Koliai, William Jalby and José Noudohouenou, José Noudohouenou and Souad Koliai.\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\": \"Allen D. Malony\", \"id\": 13728}, {\"name\": \"Sameer Shende\", \"id\": 13729}, {\"name\": \"Jean-Thomas Acquaviva\", \"id\": 158722}, {\"name\": \"Pablo de Oliveira Castro\", \"id\": 377027}, {\"name\": \"Mary W. Hall\", \"id\": 157250}, {\"name\": \"Souad Koliai\", \"id\": 151967}, {\"name\": \"Denis Barthou\", \"id\": 37904}, {\"name\": \"Jean Christophe Beyler\", \"id\": 166321}, {\"name\": \"C\\u00e9dric Valensi\", \"id\": 257618}, {\"name\": \"William Jalby\", \"id\": 48883}, {\"name\": \"Vincent W. Freeh\", \"id\": 40468}, {\"name\": \"Jos\\u00e9 Noudohouenou\", \"id\": 286069}, {\"name\": \"William Thies\", \"id\": 119451}, {\"name\": \"Emmanuel Oseret\", \"id\": 218687}], \"links\": [{\"source\": 13728, \"target\": 13729}, {\"source\": 13728, \"target\": 48883}, {\"source\": 13728, \"target\": 157250}, {\"source\": 13728, \"target\": 218687}, {\"source\": 13729, \"target\": 48883}, {\"source\": 13729, \"target\": 157250}, {\"source\": 13729, \"target\": 218687}, {\"source\": 158722, \"target\": 48883}, {\"source\": 158722, \"target\": 286069}, {\"source\": 377027, \"target\": 48883}, {\"source\": 377027, \"target\": 119451}, {\"source\": 377027, \"target\": 166321}, {\"source\": 377027, \"target\": 218687}, {\"source\": 157250, \"target\": 48883}, {\"source\": 157250, \"target\": 37904}, {\"source\": 151967, \"target\": 37904}, {\"source\": 151967, \"target\": 48883}, {\"source\": 151967, \"target\": 218687}, {\"source\": 151967, \"target\": 286069}, {\"source\": 37904, \"target\": 48883}, {\"source\": 37904, \"target\": 119451}, {\"source\": 37904, \"target\": 286069}, {\"source\": 166321, \"target\": 48883}, {\"source\": 166321, \"target\": 40468}, {\"source\": 166321, \"target\": 286069}, {\"source\": 257618, \"target\": 48883}, {\"source\": 257618, \"target\": 218687}, {\"source\": 257618, \"target\": 286069}, {\"source\": 48883, \"target\": 40468}, {\"source\": 48883, \"target\": 218687}, {\"source\": 48883, \"target\": 286069}, {\"source\": 286069, \"target\": 218687}]}",
"id": 683,
"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: Allen D. Malony, Sameer Shende, Jean-Thomas Acquaviva, Pablo de Oliveira Castro, Mary W. Hall, Emmanuel Oseret, Denis Barthou, Jean Christophe Beyler, Cédric Valensi, William Jalby, Vincent W. Freeh, José Noudohouenou, William Thies, Souad Koliai\n- Research collaborations between these authors: Allen D. Malony and Sameer Shende, Allen D. Malony and William Jalby, Allen D. Malony and Mary W. Hall, Allen D. Malony and Emmanuel Oseret, Sameer Shende and William Jalby, Sameer Shende and Mary W. Hall, Sameer Shende and Emmanuel Oseret, Jean-Thomas Acquaviva and William Jalby, Jean-Thomas Acquaviva and José Noudohouenou, Pablo de Oliveira Castro and William Jalby, Pablo de Oliveira Castro and William Thies, Pablo de Oliveira Castro and Jean Christophe Beyler, Pablo de Oliveira Castro and Emmanuel Oseret, Mary W. Hall and William Jalby, Mary W. Hall and Denis Barthou, Emmanuel Oseret and William Jalby, Emmanuel Oseret and Souad Koliai, Emmanuel Oseret and Cédric Valensi, Emmanuel Oseret and José Noudohouenou, Denis Barthou and William Jalby, Denis Barthou and William Thies, Denis Barthou and Souad Koliai, Denis Barthou and José Noudohouenou, Jean Christophe Beyler and William Jalby, Jean Christophe Beyler and Vincent W. Freeh, Jean Christophe Beyler and José Noudohouenou, Cédric Valensi and William Jalby, Cédric Valensi and José Noudohouenou, William Jalby and Vincent W. Freeh, William Jalby and Souad Koliai, William Jalby and José Noudohouenou, José Noudohouenou and Souad Koliai.\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: Slavisa Sarafijanovic, Sven Schaust, Helena Szczerbicka, Boris Sokolov, D.C. Engelhart, Andrzej Bargiela, Stephen Hailes, Martin Drozda, Madhav V. Marathe, Witold Pedrycz, Edmund K. Burke, Sebastian Bohlmann, Matthias Becker, Ender Özcan\n- Research collaborations between these authors: Slavisa Sarafijanovic and Sven Schaust, Slavisa Sarafijanovic and Helena Szczerbicka, Slavisa Sarafijanovic and Martin Drozda, Sven Schaust and Matthias Becker, Sven Schaust and Helena Szczerbicka, Sven Schaust and Madhav V. Marathe, Sven Schaust and Stephen Hailes, Sven Schaust and Martin Drozda, Sven Schaust and D.C. Engelhart, Helena Szczerbicka and Matthias Becker, Helena Szczerbicka and Madhav V. Marathe, Helena Szczerbicka and Stephen Hailes, Helena Szczerbicka and Andrzej Bargiela, Helena Szczerbicka and Martin Drozda, Helena Szczerbicka and D.C. Engelhart, Helena Szczerbicka and Sebastian Bohlmann, Boris Sokolov and Witold Pedrycz, Boris Sokolov and Andrzej Bargiela, D.C. Engelhart and Martin Drozda, D.C. Engelhart and Madhav V. Marathe, Andrzej Bargiela and Witold Pedrycz, Andrzej Bargiela and Ender Özcan, Andrzej Bargiela and Edmund K. Burke, Andrzej Bargiela and Sebastian Bohlmann, Stephen Hailes and Martin Drozda, Martin Drozda and Matthias Becker, Martin Drozda and Madhav V. Marathe, Edmund K. Burke and Ender Özcan.\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\": \"Slavisa Sarafijanovic\", \"id\": 225185}, {\"name\": \"Sven Schaust\", \"id\": 55879}, {\"name\": \"Helena Szczerbicka\", \"id\": 55880}, {\"name\": \"Boris Sokolov\", \"id\": 85800}, {\"name\": \"D.C. Engelhart\", \"id\": 394826}, {\"name\": \"Andrzej Bargiela\", \"id\": 182379}, {\"name\": \"Stephen Hailes\", \"id\": 111819}, {\"name\": \"Martin Drozda\", \"id\": 239021}, {\"name\": \"Madhav V. Marathe\", \"id\": 78385}, {\"name\": \"Witold Pedrycz\", \"id\": 10035}, {\"name\": \"Edmund K. Burke\", \"id\": 162067}, {\"name\": \"Sebastian Bohlmann\", \"id\": 694906}, {\"name\": \"Matthias Becker\", \"id\": 22748}, {\"name\": \"Ender \\u00d6zcan\", \"id\": 27999}], \"links\": [{\"source\": 225185, \"target\": 55879}, {\"source\": 225185, \"target\": 55880}, {\"source\": 225185, \"target\": 239021}, {\"source\": 55879, \"target\": 22748}, {\"source\": 55879, \"target\": 55880}, {\"source\": 55879, \"target\": 78385}, {\"source\": 55879, \"target\": 111819}, {\"source\": 55879, \"target\": 239021}, {\"source\": 55879, \"target\": 394826}, {\"source\": 55880, \"target\": 22748}, {\"source\": 55880, \"target\": 78385}, {\"source\": 55880, \"target\": 111819}, {\"source\": 55880, \"target\": 182379}, {\"source\": 55880, \"target\": 239021}, {\"source\": 55880, \"target\": 394826}, {\"source\": 55880, \"target\": 694906}, {\"source\": 85800, \"target\": 10035}, {\"source\": 85800, \"target\": 182379}, {\"source\": 394826, \"target\": 239021}, {\"source\": 394826, \"target\": 78385}, {\"source\": 182379, \"target\": 10035}, {\"source\": 182379, \"target\": 27999}, {\"source\": 182379, \"target\": 162067}, {\"source\": 182379, \"target\": 694906}, {\"source\": 111819, \"target\": 239021}, {\"source\": 239021, \"target\": 22748}, {\"source\": 239021, \"target\": 78385}, {\"source\": 162067, \"target\": 27999}]}",
"id": 498,
"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: Slavisa Sarafijanovic, Sven Schaust, Helena Szczerbicka, Boris Sokolov, D.C. Engelhart, Andrzej Bargiela, Stephen Hailes, Martin Drozda, Madhav V. Marathe, Witold Pedrycz, Edmund K. Burke, Sebastian Bohlmann, Matthias Becker, Ender Özcan\n- Research collaborations between these authors: Slavisa Sarafijanovic and Sven Schaust, Slavisa Sarafijanovic and Helena Szczerbicka, Slavisa Sarafijanovic and Martin Drozda, Sven Schaust and Matthias Becker, Sven Schaust and Helena Szczerbicka, Sven Schaust and Madhav V. Marathe, Sven Schaust and Stephen Hailes, Sven Schaust and Martin Drozda, Sven Schaust and D.C. Engelhart, Helena Szczerbicka and Matthias Becker, Helena Szczerbicka and Madhav V. Marathe, Helena Szczerbicka and Stephen Hailes, Helena Szczerbicka and Andrzej Bargiela, Helena Szczerbicka and Martin Drozda, Helena Szczerbicka and D.C. Engelhart, Helena Szczerbicka and Sebastian Bohlmann, Boris Sokolov and Witold Pedrycz, Boris Sokolov and Andrzej Bargiela, D.C. Engelhart and Martin Drozda, D.C. Engelhart and Madhav V. Marathe, Andrzej Bargiela and Witold Pedrycz, Andrzej Bargiela and Ender Özcan, Andrzej Bargiela and Edmund K. Burke, Andrzej Bargiela and Sebastian Bohlmann, Stephen Hailes and Martin Drozda, Martin Drozda and Matthias Becker, Martin Drozda and Madhav V. Marathe, Edmund K. Burke and Ender Özcan.\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: Hassan Basri, Anjun Su, Xiaohui Yuan, Garima Mittal, Shuming Wang, Mukesh Kumar Mehlawat, You Li, Baoding Liu, Shushang Zhu, Aini Hussain, Pankaj Gupta, Ikno Kim, Zalili Binti Musa, Junzo Watada\n- Research collaborations between these authors: Hassan Basri and Aini Hussain, Hassan Basri and Junzo Watada, Anjun Su and Junzo Watada, Xiaohui Yuan and Junzo Watada, Garima Mittal and Pankaj Gupta, Garima Mittal and Mukesh Kumar Mehlawat, Garima Mittal and Baoding Liu, Garima Mittal and Junzo Watada, Shuming Wang and Junzo Watada, Shuming Wang and You Li, Shuming Wang and Baoding Liu, Mukesh Kumar Mehlawat and Pankaj Gupta, Mukesh Kumar Mehlawat and Baoding Liu, Mukesh Kumar Mehlawat and Junzo Watada, Mukesh Kumar Mehlawat and Shushang Zhu, You Li and Junzo Watada, You Li and Baoding Liu, Baoding Liu and Junzo Watada, Baoding Liu and Pankaj Gupta, Shushang Zhu and Junzo Watada, Shushang Zhu and Pankaj Gupta, Aini Hussain and Junzo Watada, Pankaj Gupta and Junzo Watada, Ikno Kim and Junzo Watada, Zalili Binti Musa and Junzo Watada.\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\": \"Hassan Basri\", \"id\": 154368}, {\"name\": \"Anjun Su\", \"id\": 630818}, {\"name\": \"Xiaohui Yuan\", \"id\": 35747}, {\"name\": \"Garima Mittal\", \"id\": 202052}, {\"name\": \"Shuming Wang\", \"id\": 149829}, {\"name\": \"Mukesh Kumar Mehlawat\", \"id\": 134034}, {\"name\": \"You Li\", \"id\": 18195}, {\"name\": \"Baoding Liu\", \"id\": 6996}, {\"name\": \"Shushang Zhu\", \"id\": 360149}, {\"name\": \"Aini Hussain\", \"id\": 66870}, {\"name\": \"Pankaj Gupta\", \"id\": 25654}, {\"name\": \"Ikno Kim\", \"id\": 252083}, {\"name\": \"Zalili Binti Musa\", \"id\": 232060}, {\"name\": \"Junzo Watada\", \"id\": 9151}], \"links\": [{\"source\": 154368, \"target\": 66870}, {\"source\": 154368, \"target\": 9151}, {\"source\": 630818, \"target\": 9151}, {\"source\": 35747, \"target\": 9151}, {\"source\": 202052, \"target\": 25654}, {\"source\": 202052, \"target\": 134034}, {\"source\": 202052, \"target\": 6996}, {\"source\": 202052, \"target\": 9151}, {\"source\": 149829, \"target\": 9151}, {\"source\": 149829, \"target\": 18195}, {\"source\": 149829, \"target\": 6996}, {\"source\": 134034, \"target\": 25654}, {\"source\": 134034, \"target\": 6996}, {\"source\": 134034, \"target\": 9151}, {\"source\": 134034, \"target\": 360149}, {\"source\": 18195, \"target\": 9151}, {\"source\": 18195, \"target\": 6996}, {\"source\": 6996, \"target\": 9151}, {\"source\": 6996, \"target\": 25654}, {\"source\": 360149, \"target\": 9151}, {\"source\": 360149, \"target\": 25654}, {\"source\": 66870, \"target\": 9151}, {\"source\": 25654, \"target\": 9151}, {\"source\": 252083, \"target\": 9151}, {\"source\": 232060, \"target\": 9151}]}",
"id": 257,
"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: Hassan Basri, Anjun Su, Xiaohui Yuan, Garima Mittal, Shuming Wang, Mukesh Kumar Mehlawat, You Li, Baoding Liu, Shushang Zhu, Aini Hussain, Pankaj Gupta, Ikno Kim, Zalili Binti Musa, Junzo Watada\n- Research collaborations between these authors: Hassan Basri and Aini Hussain, Hassan Basri and Junzo Watada, Anjun Su and Junzo Watada, Xiaohui Yuan and Junzo Watada, Garima Mittal and Pankaj Gupta, Garima Mittal and Mukesh Kumar Mehlawat, Garima Mittal and Baoding Liu, Garima Mittal and Junzo Watada, Shuming Wang and Junzo Watada, Shuming Wang and You Li, Shuming Wang and Baoding Liu, Mukesh Kumar Mehlawat and Pankaj Gupta, Mukesh Kumar Mehlawat and Baoding Liu, Mukesh Kumar Mehlawat and Junzo Watada, Mukesh Kumar Mehlawat and Shushang Zhu, You Li and Junzo Watada, You Li and Baoding Liu, Baoding Liu and Junzo Watada, Baoding Liu and Pankaj Gupta, Shushang Zhu and Junzo Watada, Shushang Zhu and Pankaj Gupta, Aini Hussain and Junzo Watada, Pankaj Gupta and Junzo Watada, Ikno Kim and Junzo Watada, Zalili Binti Musa and Junzo Watada.\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: Hongliang Gu, Guangyou Xu, Yuanchun Shi, Yue Suo, Brad Johanson, Enyi Chen, Degan Zhang, Toru Ishida, N.H.J. Oostdijk, Runting Shi, Yanhua Mao, Fang Liu, Xin Xiao, Weikai Xie\n- Research collaborations between these authors: Hongliang Gu and Yuanchun Shi, Hongliang Gu and Fang Liu, Hongliang Gu and Guangyou Xu, Hongliang Gu and Enyi Chen, Hongliang Gu and Weikai Xie, Hongliang Gu and Runting Shi, Hongliang Gu and Yanhua Mao, Guangyou Xu and Yuanchun Shi, Guangyou Xu and Toru Ishida, Guangyou Xu and Fang Liu, Guangyou Xu and Yue Suo, Guangyou Xu and Weikai Xie, Guangyou Xu and Yanhua Mao, Guangyou Xu and Xin Xiao, Guangyou Xu and Degan Zhang, Guangyou Xu and Enyi Chen, Guangyou Xu and Runting Shi, Yuanchun Shi and Toru Ishida, Yuanchun Shi and Fang Liu, Yuanchun Shi and Yue Suo, Yuanchun Shi and Xin Xiao, Yuanchun Shi and Enyi Chen, Yuanchun Shi and Weikai Xie, Yuanchun Shi and Brad Johanson, Yuanchun Shi and Runting Shi, Yuanchun Shi and Yanhua Mao, Yuanchun Shi and Degan Zhang, Yue Suo and Toru Ishida, Yue Suo and Fang Liu, Yue Suo and Enyi Chen, Yue Suo and Weikai Xie, Yue Suo and Brad Johanson, Yue Suo and Runting Shi, Yue Suo and Yanhua Mao, Enyi Chen and Degan Zhang, Degan Zhang and Weikai Xie, Toru Ishida and Weikai Xie, Toru Ishida and Runting Shi, Toru Ishida and Yanhua Mao, Runting Shi and Xin Xiao, Yanhua Mao and Xin Xiao, Xin Xiao and Weikai Xie.\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\": \"Hongliang Gu\", \"id\": 244453}, {\"name\": \"Guangyou Xu\", \"id\": 27721}, {\"name\": \"Yuanchun Shi\", \"id\": 10571}, {\"name\": \"Yue Suo\", \"id\": 26028}, {\"name\": \"Brad Johanson\", \"id\": 358733}, {\"name\": \"Enyi Chen\", \"id\": 136238}, {\"name\": \"Degan Zhang\", \"id\": 136237}, {\"name\": \"Toru Ishida\", \"id\": 15472}, {\"name\": \"N.H.J. Oostdijk\", \"id\": 37772}, {\"name\": \"Runting Shi\", \"id\": 370706}, {\"name\": \"Yanhua Mao\", \"id\": 969717}, {\"name\": \"Fang Liu\", \"id\": 18935}, {\"name\": \"Xin Xiao\", \"id\": 70010}, {\"name\": \"Weikai Xie\", \"id\": 222109}], \"links\": [{\"source\": 244453, \"target\": 10571}, {\"source\": 244453, \"target\": 18935}, {\"source\": 244453, \"target\": 27721}, {\"source\": 244453, \"target\": 136238}, {\"source\": 244453, \"target\": 222109}, {\"source\": 244453, \"target\": 370706}, {\"source\": 244453, \"target\": 969717}, {\"source\": 27721, \"target\": 10571}, {\"source\": 27721, \"target\": 15472}, {\"source\": 27721, \"target\": 18935}, {\"source\": 27721, \"target\": 26028}, {\"source\": 27721, \"target\": 222109}, {\"source\": 27721, \"target\": 969717}, {\"source\": 27721, \"target\": 70010}, {\"source\": 27721, \"target\": 136237}, {\"source\": 27721, \"target\": 136238}, {\"source\": 27721, \"target\": 370706}, {\"source\": 10571, \"target\": 15472}, {\"source\": 10571, \"target\": 18935}, {\"source\": 10571, \"target\": 26028}, {\"source\": 10571, \"target\": 70010}, {\"source\": 10571, \"target\": 136238}, {\"source\": 10571, \"target\": 222109}, {\"source\": 10571, \"target\": 358733}, {\"source\": 10571, \"target\": 370706}, {\"source\": 10571, \"target\": 969717}, {\"source\": 10571, \"target\": 136237}, {\"source\": 26028, \"target\": 15472}, {\"source\": 26028, \"target\": 18935}, {\"source\": 26028, \"target\": 136238}, {\"source\": 26028, \"target\": 222109}, {\"source\": 26028, \"target\": 358733}, {\"source\": 26028, \"target\": 370706}, {\"source\": 26028, \"target\": 969717}, {\"source\": 136238, \"target\": 136237}, {\"source\": 136237, \"target\": 222109}, {\"source\": 15472, \"target\": 222109}, {\"source\": 15472, \"target\": 370706}, {\"source\": 15472, \"target\": 969717}, {\"source\": 370706, \"target\": 70010}, {\"source\": 969717, \"target\": 70010}, {\"source\": 70010, \"target\": 222109}]}",
"id": 2860,
"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: Hongliang Gu, Guangyou Xu, Yuanchun Shi, Yue Suo, Brad Johanson, Enyi Chen, Degan Zhang, Toru Ishida, N.H.J. Oostdijk, Runting Shi, Yanhua Mao, Fang Liu, Xin Xiao, Weikai Xie\n- Research collaborations between these authors: Hongliang Gu and Yuanchun Shi, Hongliang Gu and Fang Liu, Hongliang Gu and Guangyou Xu, Hongliang Gu and Enyi Chen, Hongliang Gu and Weikai Xie, Hongliang Gu and Runting Shi, Hongliang Gu and Yanhua Mao, Guangyou Xu and Yuanchun Shi, Guangyou Xu and Toru Ishida, Guangyou Xu and Fang Liu, Guangyou Xu and Yue Suo, Guangyou Xu and Weikai Xie, Guangyou Xu and Yanhua Mao, Guangyou Xu and Xin Xiao, Guangyou Xu and Degan Zhang, Guangyou Xu and Enyi Chen, Guangyou Xu and Runting Shi, Yuanchun Shi and Toru Ishida, Yuanchun Shi and Fang Liu, Yuanchun Shi and Yue Suo, Yuanchun Shi and Xin Xiao, Yuanchun Shi and Enyi Chen, Yuanchun Shi and Weikai Xie, Yuanchun Shi and Brad Johanson, Yuanchun Shi and Runting Shi, Yuanchun Shi and Yanhua Mao, Yuanchun Shi and Degan Zhang, Yue Suo and Toru Ishida, Yue Suo and Fang Liu, Yue Suo and Enyi Chen, Yue Suo and Weikai Xie, Yue Suo and Brad Johanson, Yue Suo and Runting Shi, Yue Suo and Yanhua Mao, Enyi Chen and Degan Zhang, Degan Zhang and Weikai Xie, Toru Ishida and Weikai Xie, Toru Ishida and Runting Shi, Toru Ishida and Yanhua Mao, Runting Shi and Xin Xiao, Yanhua Mao and Xin Xiao, Xin Xiao and Weikai Xie.\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: Pawel Blasiak, A. Horzela, K. A. Penson, Hoang Ngoc Minh, Jean-Marc Champarnaud, Gérard Duchamp, Rawan Ghnemat, Jean-Christophe Novelli, Marianne Flouret, Éric Laugerotte, Gérard Henry Edmond Duchamp, Allan I. Solomon, Cyrille Bertelle, Jean-Yves Thibon\n- Research collaborations between these authors: Pawel Blasiak and Gérard Henry Edmond Duchamp, Pawel Blasiak and K. A. Penson, A. Horzela and Gérard Henry Edmond Duchamp, A. Horzela and K. A. Penson, K. A. Penson and Gérard Henry Edmond Duchamp, K. A. Penson and Allan I. Solomon, Hoang Ngoc Minh and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Éric Laugerotte, Gérard Duchamp and Gérard Henry Edmond Duchamp, Rawan Ghnemat and Cyrille Bertelle, Rawan Ghnemat and Gérard Henry Edmond Duchamp, Jean-Christophe Novelli and Jean-Yves Thibon, Jean-Christophe Novelli and Gérard Henry Edmond Duchamp, Marianne Flouret and Gérard Henry Edmond Duchamp, Marianne Flouret and Éric Laugerotte, Éric Laugerotte and Gérard Henry Edmond Duchamp, Gérard Henry Edmond Duchamp and Allan I. Solomon, Gérard Henry Edmond Duchamp and Cyrille Bertelle, Gérard Henry Edmond Duchamp and Jean-Yves Thibon.\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\": \"Pawel Blasiak\", \"id\": 413312}, {\"name\": \"A. Horzela\", \"id\": 413313}, {\"name\": \"Hoang Ngoc Minh\", \"id\": 147079}, {\"name\": \"Allan I. Solomon\", \"id\": 385687}, {\"name\": \"Jean-Marc Champarnaud\", \"id\": 47850}, {\"name\": \"G\\u00e9rard Duchamp\", \"id\": 112971}, {\"name\": \"Rawan Ghnemat\", \"id\": 386061}, {\"name\": \"Jean-Christophe Novelli\", \"id\": 424912}, {\"name\": \"Marianne Flouret\", \"id\": 61233}, {\"name\": \"\\u00c9ric Laugerotte\", \"id\": 198993}, {\"name\": \"G\\u00e9rard Henry Edmond Duchamp\", \"id\": 11732}, {\"name\": \"K. A. Penson\", \"id\": 11735}, {\"name\": \"Cyrille Bertelle\", \"id\": 94013}, {\"name\": \"Jean-Yves Thibon\", \"id\": 238367}], \"links\": [{\"source\": 413312, \"target\": 11732}, {\"source\": 413312, \"target\": 11735}, {\"source\": 413313, \"target\": 11732}, {\"source\": 413313, \"target\": 11735}, {\"source\": 147079, \"target\": 11732}, {\"source\": 385687, \"target\": 11732}, {\"source\": 385687, \"target\": 11735}, {\"source\": 47850, \"target\": 11732}, {\"source\": 47850, \"target\": 198993}, {\"source\": 112971, \"target\": 11732}, {\"source\": 386061, \"target\": 94013}, {\"source\": 386061, \"target\": 11732}, {\"source\": 424912, \"target\": 238367}, {\"source\": 424912, \"target\": 11732}, {\"source\": 61233, \"target\": 11732}, {\"source\": 61233, \"target\": 198993}, {\"source\": 198993, \"target\": 11732}, {\"source\": 11732, \"target\": 11735}, {\"source\": 11732, \"target\": 94013}, {\"source\": 11732, \"target\": 238367}]}",
"id": 1156,
"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: Pawel Blasiak, A. Horzela, K. A. Penson, Hoang Ngoc Minh, Jean-Marc Champarnaud, Gérard Duchamp, Rawan Ghnemat, Jean-Christophe Novelli, Marianne Flouret, Éric Laugerotte, Gérard Henry Edmond Duchamp, Allan I. Solomon, Cyrille Bertelle, Jean-Yves Thibon\n- Research collaborations between these authors: Pawel Blasiak and Gérard Henry Edmond Duchamp, Pawel Blasiak and K. A. Penson, A. Horzela and Gérard Henry Edmond Duchamp, A. Horzela and K. A. Penson, K. A. Penson and Gérard Henry Edmond Duchamp, K. A. Penson and Allan I. Solomon, Hoang Ngoc Minh and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Gérard Henry Edmond Duchamp, Jean-Marc Champarnaud and Éric Laugerotte, Gérard Duchamp and Gérard Henry Edmond Duchamp, Rawan Ghnemat and Cyrille Bertelle, Rawan Ghnemat and Gérard Henry Edmond Duchamp, Jean-Christophe Novelli and Jean-Yves Thibon, Jean-Christophe Novelli and Gérard Henry Edmond Duchamp, Marianne Flouret and Gérard Henry Edmond Duchamp, Marianne Flouret and Éric Laugerotte, Éric Laugerotte and Gérard Henry Edmond Duchamp, Gérard Henry Edmond Duchamp and Allan I. Solomon, Gérard Henry Edmond Duchamp and Cyrille Bertelle, Gérard Henry Edmond Duchamp and Jean-Yves Thibon.\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: Matthew C. Turner, J.L. Lazaro, Naomi Ehrich Leonard, Carlos Sagüés, François Chaumette, Shihua Li, Hassan K. Khalil, Liu Hsu, Jean-Paul Laumond, Jouni Mattila, Miroslav Krstic, Guoqiang Ye, Carlos Vazquez, Leonid Fridman\n- Research collaborations between these authors: J.L. Lazaro and Carlos Vazquez, Naomi Ehrich Leonard and Miroslav Krstic, Naomi Ehrich Leonard and Carlos Sagüés, Naomi Ehrich Leonard and Hassan K. Khalil, Carlos Sagüés and François Chaumette, François Chaumette and Jean-Paul Laumond, François Chaumette and Jouni Mattila, François Chaumette and Guoqiang Ye, Shihua Li and Hassan K. Khalil, Shihua Li and Leonid Fridman, Hassan K. Khalil and Miroslav Krstic, Hassan K. Khalil and Carlos Vazquez, Hassan K. Khalil and Leonid Fridman, Hassan K. Khalil and Guoqiang Ye, Liu Hsu and Leonid Fridman, Liu Hsu and Miroslav Krstic, Carlos Vazquez and Leonid Fridman.\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\": \"Matthew C. Turner\", \"id\": 253536}, {\"name\": \"J.L. Lazaro\", \"id\": 330149}, {\"name\": \"Naomi Ehrich Leonard\", \"id\": 96167}, {\"name\": \"Carlos Sag\\u00fc\\u00e9s\", \"id\": 161514}, {\"name\": \"Fran\\u00e7ois Chaumette\", \"id\": 254218}, {\"name\": \"Shihua Li\", \"id\": 143179}, {\"name\": \"Hassan K. Khalil\", \"id\": 333005}, {\"name\": \"Liu Hsu\", \"id\": 512142}, {\"name\": \"Jean-Paul Laumond\", \"id\": 115885}, {\"name\": \"Jouni Mattila\", \"id\": 276593}, {\"name\": \"Miroslav Krstic\", \"id\": 108917}, {\"name\": \"Guoqiang Ye\", \"id\": 940695}, {\"name\": \"Carlos Vazquez\", \"id\": 346813}, {\"name\": \"Leonid Fridman\", \"id\": 346814}], \"links\": [{\"source\": 330149, \"target\": 346813}, {\"source\": 96167, \"target\": 108917}, {\"source\": 96167, \"target\": 161514}, {\"source\": 96167, \"target\": 333005}, {\"source\": 161514, \"target\": 254218}, {\"source\": 254218, \"target\": 115885}, {\"source\": 254218, \"target\": 276593}, {\"source\": 254218, \"target\": 940695}, {\"source\": 143179, \"target\": 333005}, {\"source\": 143179, \"target\": 346814}, {\"source\": 333005, \"target\": 108917}, {\"source\": 333005, \"target\": 346813}, {\"source\": 333005, \"target\": 346814}, {\"source\": 333005, \"target\": 940695}, {\"source\": 512142, \"target\": 346814}, {\"source\": 512142, \"target\": 108917}, {\"source\": 346813, \"target\": 346814}]}",
"id": 2218,
"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: Matthew C. Turner, J.L. Lazaro, Naomi Ehrich Leonard, Carlos Sagüés, François Chaumette, Shihua Li, Hassan K. Khalil, Liu Hsu, Jean-Paul Laumond, Jouni Mattila, Miroslav Krstic, Guoqiang Ye, Carlos Vazquez, Leonid Fridman\n- Research collaborations between these authors: J.L. Lazaro and Carlos Vazquez, Naomi Ehrich Leonard and Miroslav Krstic, Naomi Ehrich Leonard and Carlos Sagüés, Naomi Ehrich Leonard and Hassan K. Khalil, Carlos Sagüés and François Chaumette, François Chaumette and Jean-Paul Laumond, François Chaumette and Jouni Mattila, François Chaumette and Guoqiang Ye, Shihua Li and Hassan K. Khalil, Shihua Li and Leonid Fridman, Hassan K. Khalil and Miroslav Krstic, Hassan K. Khalil and Carlos Vazquez, Hassan K. Khalil and Leonid Fridman, Hassan K. Khalil and Guoqiang Ye, Liu Hsu and Leonid Fridman, Liu Hsu and Miroslav Krstic, Carlos Vazquez and Leonid Fridman.\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: Yi-Luang Chang, Panagiotis Papadimitriou, Kun Tan, Y. Thomas Hou, Leonardo Militano, Antonio Liotta, John Riedl, Dapeng Oliver Wu, Yuanyuan Yang, Muntasir Raihan Rahman, Zhenyu Yang, Yang Wang, Zhu Han, Mischa Dohler\n- Research collaborations between these authors: Yi-Luang Chang and Yuanyuan Yang, Panagiotis Papadimitriou and Muntasir Raihan Rahman, Kun Tan and Yuanyuan Yang, Y. Thomas Hou and Zhu Han, Y. Thomas Hou and Yuanyuan Yang, Leonardo Militano and Zhu Han, Leonardo Militano and Yuanyuan Yang, Leonardo Militano and Mischa Dohler, John Riedl and Yang Wang, Dapeng Oliver Wu and Zhu Han, Dapeng Oliver Wu and Yuanyuan Yang, Yuanyuan Yang and Yang Wang, Yuanyuan Yang and Zhu Han, Yuanyuan Yang and Zhenyu Yang, Yuanyuan Yang and Muntasir Raihan Rahman, Muntasir Raihan Rahman and Yang Wang, Zhenyu Yang and Zhu Han, Zhu Han and Mischa Dohler.\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\": \"Kun Tan\", \"id\": 266272}, {\"name\": \"Panagiotis Papadimitriou\", \"id\": 286657}, {\"name\": \"Y. Thomas Hou\", \"id\": 241095}, {\"name\": \"Mischa Dohler\", \"id\": 245759}, {\"name\": \"Leonardo Militano\", \"id\": 199849}, {\"name\": \"Antonio Liotta\", \"id\": 88457}, {\"name\": \"John Riedl\", \"id\": 100972}, {\"name\": \"Dapeng Oliver Wu\", \"id\": 257839}, {\"name\": \"Yuanyuan Yang\", \"id\": 180278}, {\"name\": \"Muntasir Raihan Rahman\", \"id\": 180095}, {\"name\": \"Zhenyu Yang\", \"id\": 113430}, {\"name\": \"Yang Wang\", \"id\": 8025}, {\"name\": \"Zhu Han\", \"id\": 51707}, {\"name\": \"Yi-Luang Chang\", \"id\": 1094815}], \"links\": [{\"source\": 266272, \"target\": 180278}, {\"source\": 286657, \"target\": 180095}, {\"source\": 241095, \"target\": 51707}, {\"source\": 241095, \"target\": 180278}, {\"source\": 245759, \"target\": 51707}, {\"source\": 245759, \"target\": 199849}, {\"source\": 199849, \"target\": 51707}, {\"source\": 199849, \"target\": 180278}, {\"source\": 100972, \"target\": 8025}, {\"source\": 257839, \"target\": 51707}, {\"source\": 257839, \"target\": 180278}, {\"source\": 180278, \"target\": 8025}, {\"source\": 180278, \"target\": 51707}, {\"source\": 180278, \"target\": 113430}, {\"source\": 180278, \"target\": 180095}, {\"source\": 180278, \"target\": 1094815}, {\"source\": 180095, \"target\": 8025}, {\"source\": 113430, \"target\": 51707}]}",
"id": 1921,
"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: Yi-Luang Chang, Panagiotis Papadimitriou, Kun Tan, Y. Thomas Hou, Leonardo Militano, Antonio Liotta, John Riedl, Dapeng Oliver Wu, Yuanyuan Yang, Muntasir Raihan Rahman, Zhenyu Yang, Yang Wang, Zhu Han, Mischa Dohler\n- Research collaborations between these authors: Yi-Luang Chang and Yuanyuan Yang, Panagiotis Papadimitriou and Muntasir Raihan Rahman, Kun Tan and Yuanyuan Yang, Y. Thomas Hou and Zhu Han, Y. Thomas Hou and Yuanyuan Yang, Leonardo Militano and Zhu Han, Leonardo Militano and Yuanyuan Yang, Leonardo Militano and Mischa Dohler, John Riedl and Yang Wang, Dapeng Oliver Wu and Zhu Han, Dapeng Oliver Wu and Yuanyuan Yang, Yuanyuan Yang and Yang Wang, Yuanyuan Yang and Zhu Han, Yuanyuan Yang and Zhenyu Yang, Yuanyuan Yang and Muntasir Raihan Rahman, Muntasir Raihan Rahman and Yang Wang, Zhenyu Yang and Zhu Han, Zhu Han and Mischa Dohler.\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: Boyce E. Griffith, Peter R. Kramer, Karl K. Sabelfeld, Thomas G. Fai, Paul J. Atzberger, Boris Gershgorin, Petros Drineas, Orazgeldi Kurbanmuradov, Joseph Teran, Andrew J. Majda, Charles S. Peskin, Yoonsang Lee, Bin Yu, Jeffrey K. Wiens\n- Research collaborations between these authors: Boyce E. Griffith and Charles S. Peskin, Boyce E. Griffith and Thomas G. Fai, Peter R. Kramer and Charles S. Peskin, Peter R. Kramer and Paul J. Atzberger, Peter R. Kramer and Karl K. Sabelfeld, Karl K. Sabelfeld and Petros Drineas, Karl K. Sabelfeld and Orazgeldi Kurbanmuradov, Thomas G. Fai and Charles S. Peskin, Thomas G. Fai and Paul J. Atzberger, Paul J. Atzberger and Charles S. Peskin, Paul J. Atzberger and Andrew J. Majda, Boris Gershgorin and Andrew J. Majda, Petros Drineas and Bin Yu, Joseph Teran and Charles S. Peskin, Andrew J. Majda and Yoonsang Lee, Charles S. Peskin and Jeffrey K. Wiens.\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\": \"Boyce E. Griffith\", \"id\": 136579}, {\"name\": \"Peter R. Kramer\", \"id\": 495268}, {\"name\": \"Karl K. Sabelfeld\", \"id\": 216197}, {\"name\": \"Thomas G. Fai\", \"id\": 101990}, {\"name\": \"Paul J. Atzberger\", \"id\": 210183}, {\"name\": \"Boris Gershgorin\", \"id\": 932006}, {\"name\": \"Petros Drineas\", \"id\": 160876}, {\"name\": \"Orazgeldi Kurbanmuradov\", \"id\": 708495}, {\"name\": \"Joseph Teran\", \"id\": 108305}, {\"name\": \"Andrew J. Majda\", \"id\": 550066}, {\"name\": \"Charles S. Peskin\", \"id\": 68915}, {\"name\": \"Yoonsang Lee\", \"id\": 671892}, {\"name\": \"Bin Yu\", \"id\": 60593}, {\"name\": \"Jeffrey K. Wiens\", \"id\": 871065}], \"links\": [{\"source\": 136579, \"target\": 68915}, {\"source\": 136579, \"target\": 101990}, {\"source\": 495268, \"target\": 68915}, {\"source\": 495268, \"target\": 210183}, {\"source\": 495268, \"target\": 216197}, {\"source\": 216197, \"target\": 160876}, {\"source\": 216197, \"target\": 708495}, {\"source\": 101990, \"target\": 68915}, {\"source\": 101990, \"target\": 210183}, {\"source\": 210183, \"target\": 68915}, {\"source\": 210183, \"target\": 550066}, {\"source\": 932006, \"target\": 550066}, {\"source\": 160876, \"target\": 60593}, {\"source\": 108305, \"target\": 68915}, {\"source\": 550066, \"target\": 671892}, {\"source\": 68915, \"target\": 871065}]}",
"id": 1567,
"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: Boyce E. Griffith, Peter R. Kramer, Karl K. Sabelfeld, Thomas G. Fai, Paul J. Atzberger, Boris Gershgorin, Petros Drineas, Orazgeldi Kurbanmuradov, Joseph Teran, Andrew J. Majda, Charles S. Peskin, Yoonsang Lee, Bin Yu, Jeffrey K. Wiens\n- Research collaborations between these authors: Boyce E. Griffith and Charles S. Peskin, Boyce E. Griffith and Thomas G. Fai, Peter R. Kramer and Charles S. Peskin, Peter R. Kramer and Paul J. Atzberger, Peter R. Kramer and Karl K. Sabelfeld, Karl K. Sabelfeld and Petros Drineas, Karl K. Sabelfeld and Orazgeldi Kurbanmuradov, Thomas G. Fai and Charles S. Peskin, Thomas G. Fai and Paul J. Atzberger, Paul J. Atzberger and Charles S. Peskin, Paul J. Atzberger and Andrew J. Majda, Boris Gershgorin and Andrew J. Majda, Petros Drineas and Bin Yu, Joseph Teran and Charles S. Peskin, Andrew J. Majda and Yoonsang Lee, Charles S. Peskin and Jeffrey K. Wiens.\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": 2412,
"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: Li Li, Ke Xu, Bow-Nan Cheng, Kyungsoo Kim, Muhammad Shafique, Are Hjorungnes, Rahul Amin, Jörg Henkel, Amr M. A. Hussien, Jim Martin, Lothar Thiele, Leonid Veytser, Ramachandran Ramjee, James Wheeler\n- Research collaborations between these authors: Li Li and Lothar Thiele, Li Li and Ke Xu, Li Li and Ramachandran Ramjee, Li Li and Rahul Amin, Li Li and Jim Martin, Ke Xu and Jim Martin, Ke Xu and Ramachandran Ramjee, Ke Xu and Are Hjorungnes, Ke Xu and Rahul Amin, Bow-Nan Cheng and Rahul Amin, Bow-Nan Cheng and James Wheeler, Bow-Nan Cheng and Leonid Veytser, Kyungsoo Kim and Rahul Amin, Kyungsoo Kim and Jim Martin, Kyungsoo Kim and Amr M. A. Hussien, Muhammad Shafique and Jörg Henkel, Muhammad Shafique and Lothar Thiele, Muhammad Shafique and Rahul Amin, Muhammad Shafique and Jim Martin, Muhammad Shafique and Amr M. A. Hussien, Are Hjorungnes and Rahul Amin, Are Hjorungnes and Jim Martin, Rahul Amin and Jörg Henkel, Rahul Amin and Lothar Thiele, Rahul Amin and Jim Martin, Rahul Amin and Ramachandran Ramjee, Rahul Amin and James Wheeler, Rahul Amin and Amr M. A. Hussien, Rahul Amin and Leonid Veytser, Jörg Henkel and Lothar Thiele, Jörg Henkel and Jim Martin, Jörg Henkel and Amr M. A. Hussien, Amr M. A. Hussien and Jim Martin, Amr M. A. Hussien and Lothar Thiele, Jim Martin and Lothar Thiele, Jim Martin and Ramachandran Ramjee, Leonid Veytser and James Wheeler.\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\": \"Li Li\", \"id\": 3328}, {\"name\": \"Ke Xu\", \"id\": 44865}, {\"name\": \"Bow-Nan Cheng\", \"id\": 441702}, {\"name\": \"Kyungsoo Kim\", \"id\": 301320}, {\"name\": \"Muhammad Shafique\", \"id\": 196233}, {\"name\": \"Are Hjorungnes\", \"id\": 319407}, {\"name\": \"Rahul Amin\", \"id\": 202609}, {\"name\": \"J\\u00f6rg Henkel\", \"id\": 12146}, {\"name\": \"Amr M. A. Hussien\", \"id\": 517525}, {\"name\": \"Jim Martin\", \"id\": 234549}, {\"name\": \"Lothar Thiele\", \"id\": 26327}, {\"name\": \"Leonid Veytser\", \"id\": 552699}, {\"name\": \"Ramachandran Ramjee\", \"id\": 264540}, {\"name\": \"James Wheeler\", \"id\": 501278}], \"links\": [{\"source\": 3328, \"target\": 26327}, {\"source\": 3328, \"target\": 44865}, {\"source\": 3328, \"target\": 264540}, {\"source\": 3328, \"target\": 202609}, {\"source\": 3328, \"target\": 234549}, {\"source\": 44865, \"target\": 234549}, {\"source\": 44865, \"target\": 264540}, {\"source\": 44865, \"target\": 319407}, {\"source\": 44865, \"target\": 202609}, {\"source\": 441702, \"target\": 202609}, {\"source\": 441702, \"target\": 501278}, {\"source\": 441702, \"target\": 552699}, {\"source\": 301320, \"target\": 202609}, {\"source\": 301320, \"target\": 234549}, {\"source\": 301320, \"target\": 517525}, {\"source\": 196233, \"target\": 12146}, {\"source\": 196233, \"target\": 26327}, {\"source\": 196233, \"target\": 202609}, {\"source\": 196233, \"target\": 234549}, {\"source\": 196233, \"target\": 517525}, {\"source\": 319407, \"target\": 202609}, {\"source\": 319407, \"target\": 234549}, {\"source\": 202609, \"target\": 12146}, {\"source\": 202609, \"target\": 26327}, {\"source\": 202609, \"target\": 234549}, {\"source\": 202609, \"target\": 264540}, {\"source\": 202609, \"target\": 501278}, {\"source\": 202609, \"target\": 517525}, {\"source\": 202609, \"target\": 552699}, {\"source\": 12146, \"target\": 26327}, {\"source\": 12146, \"target\": 234549}, {\"source\": 12146, \"target\": 517525}, {\"source\": 517525, \"target\": 234549}, {\"source\": 517525, \"target\": 26327}, {\"source\": 234549, \"target\": 26327}, {\"source\": 234549, \"target\": 264540}, {\"source\": 552699, \"target\": 501278}]}",
"id": 2828,
"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: Li Li, Ke Xu, Bow-Nan Cheng, Kyungsoo Kim, Muhammad Shafique, Are Hjorungnes, Rahul Amin, Jörg Henkel, Amr M. A. Hussien, Jim Martin, Lothar Thiele, Leonid Veytser, Ramachandran Ramjee, James Wheeler\n- Research collaborations between these authors: Li Li and Lothar Thiele, Li Li and Ke Xu, Li Li and Ramachandran Ramjee, Li Li and Rahul Amin, Li Li and Jim Martin, Ke Xu and Jim Martin, Ke Xu and Ramachandran Ramjee, Ke Xu and Are Hjorungnes, Ke Xu and Rahul Amin, Bow-Nan Cheng and Rahul Amin, Bow-Nan Cheng and James Wheeler, Bow-Nan Cheng and Leonid Veytser, Kyungsoo Kim and Rahul Amin, Kyungsoo Kim and Jim Martin, Kyungsoo Kim and Amr M. A. Hussien, Muhammad Shafique and Jörg Henkel, Muhammad Shafique and Lothar Thiele, Muhammad Shafique and Rahul Amin, Muhammad Shafique and Jim Martin, Muhammad Shafique and Amr M. A. Hussien, Are Hjorungnes and Rahul Amin, Are Hjorungnes and Jim Martin, Rahul Amin and Jörg Henkel, Rahul Amin and Lothar Thiele, Rahul Amin and Jim Martin, Rahul Amin and Ramachandran Ramjee, Rahul Amin and James Wheeler, Rahul Amin and Amr M. A. Hussien, Rahul Amin and Leonid Veytser, Jörg Henkel and Lothar Thiele, Jörg Henkel and Jim Martin, Jörg Henkel and Amr M. A. Hussien, Amr M. A. Hussien and Jim Martin, Amr M. A. Hussien and Lothar Thiele, Jim Martin and Lothar Thiele, Jim Martin and Ramachandran Ramjee, Leonid Veytser and James Wheeler.\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: Luisa Castagnoli, Carole Goble, Matthew Addis, Darren Marvin, Andrew C. Ah-Seng, Paul M. K. Gordon, Julie N. Stromer, Morgan L. Taschuk, Jung Soh, Antonio Mora, Ian M. Donaldson, Martin Senger, Andrei L. Turinsky, Christoph W. Sensen\n- Research collaborations between these authors: Luisa Castagnoli and Andrei L. Turinsky, Luisa Castagnoli and Antonio Mora, Luisa Castagnoli and Ian M. Donaldson, Carole Goble and Matthew Addis, Carole Goble and Martin Senger, Carole Goble and Darren Marvin, Carole Goble and Christoph W. Sensen, Carole Goble and Paul M. K. Gordon, Matthew Addis and Christoph W. Sensen, Matthew Addis and Paul M. K. Gordon, Darren Marvin and Christoph W. Sensen, Darren Marvin and Paul M. K. Gordon, Andrew C. Ah-Seng and Jung Soh, Andrew C. Ah-Seng and Christoph W. Sensen, Andrew C. Ah-Seng and Andrei L. Turinsky, Andrew C. Ah-Seng and Paul M. K. Gordon, Paul M. K. Gordon and Jung Soh, Paul M. K. Gordon and Christoph W. Sensen, Paul M. K. Gordon and Andrei L. Turinsky, Paul M. K. Gordon and Julie N. Stromer, Paul M. K. Gordon and Morgan L. Taschuk, Paul M. K. Gordon and Martin Senger, Julie N. Stromer and Christoph W. Sensen, Morgan L. Taschuk and Jung Soh, Morgan L. Taschuk and Christoph W. Sensen, Morgan L. Taschuk and Andrei L. Turinsky, Jung Soh and Christoph W. Sensen, Jung Soh and Andrei L. Turinsky, Antonio Mora and Andrei L. Turinsky, Antonio Mora and Ian M. Donaldson, Ian M. Donaldson and Andrei L. Turinsky, Martin Senger and Christoph W. Sensen, Andrei L. Turinsky and Christoph W. Sensen.\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\": \"Luisa Castagnoli\", \"id\": 454434}, {\"name\": \"Matthew Addis\", \"id\": 267690}, {\"name\": \"Carole Goble\", \"id\": 12106}, {\"name\": \"Darren Marvin\", \"id\": 514410}, {\"name\": \"Andrew C. Ah-Seng\", \"id\": 330286}, {\"name\": \"Paul M. K. Gordon\", \"id\": 330287}, {\"name\": \"Julie N. Stromer\", \"id\": 330288}, {\"name\": \"Morgan L. Taschuk\", \"id\": 330289}, {\"name\": \"Jung Soh\", \"id\": 167157}, {\"name\": \"Antonio Mora\", \"id\": 504823}, {\"name\": \"Ian M. Donaldson\", \"id\": 504824}, {\"name\": \"Martin Senger\", \"id\": 408186}, {\"name\": \"Andrei L. Turinsky\", \"id\": 299228}, {\"name\": \"Christoph W. Sensen\", \"id\": 167167}], \"links\": [{\"source\": 454434, \"target\": 299228}, {\"source\": 454434, \"target\": 504823}, {\"source\": 454434, \"target\": 504824}, {\"source\": 267690, \"target\": 12106}, {\"source\": 267690, \"target\": 167167}, {\"source\": 267690, \"target\": 330287}, {\"source\": 12106, \"target\": 408186}, {\"source\": 12106, \"target\": 514410}, {\"source\": 12106, \"target\": 167167}, {\"source\": 12106, \"target\": 330287}, {\"source\": 514410, \"target\": 167167}, {\"source\": 514410, \"target\": 330287}, {\"source\": 330286, \"target\": 167157}, {\"source\": 330286, \"target\": 167167}, {\"source\": 330286, \"target\": 299228}, {\"source\": 330286, \"target\": 330287}, {\"source\": 330287, \"target\": 167157}, {\"source\": 330287, \"target\": 167167}, {\"source\": 330287, \"target\": 299228}, {\"source\": 330287, \"target\": 330288}, {\"source\": 330287, \"target\": 330289}, {\"source\": 330287, \"target\": 408186}, {\"source\": 330288, \"target\": 167167}, {\"source\": 330289, \"target\": 167157}, {\"source\": 330289, \"target\": 167167}, {\"source\": 330289, \"target\": 299228}, {\"source\": 167157, \"target\": 167167}, {\"source\": 167157, \"target\": 299228}, {\"source\": 504823, \"target\": 299228}, {\"source\": 504823, \"target\": 504824}, {\"source\": 504824, \"target\": 299228}, {\"source\": 408186, \"target\": 167167}, {\"source\": 299228, \"target\": 167167}]}",
"id": 2943,
"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: Luisa Castagnoli, Carole Goble, Matthew Addis, Darren Marvin, Andrew C. Ah-Seng, Paul M. K. Gordon, Julie N. Stromer, Morgan L. Taschuk, Jung Soh, Antonio Mora, Ian M. Donaldson, Martin Senger, Andrei L. Turinsky, Christoph W. Sensen\n- Research collaborations between these authors: Luisa Castagnoli and Andrei L. Turinsky, Luisa Castagnoli and Antonio Mora, Luisa Castagnoli and Ian M. Donaldson, Carole Goble and Matthew Addis, Carole Goble and Martin Senger, Carole Goble and Darren Marvin, Carole Goble and Christoph W. Sensen, Carole Goble and Paul M. K. Gordon, Matthew Addis and Christoph W. Sensen, Matthew Addis and Paul M. K. Gordon, Darren Marvin and Christoph W. Sensen, Darren Marvin and Paul M. K. Gordon, Andrew C. Ah-Seng and Jung Soh, Andrew C. Ah-Seng and Christoph W. Sensen, Andrew C. Ah-Seng and Andrei L. Turinsky, Andrew C. Ah-Seng and Paul M. K. Gordon, Paul M. K. Gordon and Jung Soh, Paul M. K. Gordon and Christoph W. Sensen, Paul M. K. Gordon and Andrei L. Turinsky, Paul M. K. Gordon and Julie N. Stromer, Paul M. K. Gordon and Morgan L. Taschuk, Paul M. K. Gordon and Martin Senger, Julie N. Stromer and Christoph W. Sensen, Morgan L. Taschuk and Jung Soh, Morgan L. Taschuk and Christoph W. Sensen, Morgan L. Taschuk and Andrei L. Turinsky, Jung Soh and Christoph W. Sensen, Jung Soh and Andrei L. Turinsky, Antonio Mora and Andrei L. Turinsky, Antonio Mora and Ian M. Donaldson, Ian M. Donaldson and Andrei L. Turinsky, Martin Senger and Christoph W. Sensen, Andrei L. Turinsky and Christoph W. Sensen.\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: Jordi J. Mallorqui, Andreas Reigber, Helmut Schön, Irena Hajnsek, Konstantinos Papathanassiou, Gerhard Krieger, Tao Zeng, Ralf Horn, Carsten Montzka, Thomas Jagdhuber, Laurent Ferro-Famil, Jong-Sen Lee, Francesco Bandiera, Hongquan Wang\n- Research collaborations between these authors: Jordi J. Mallorqui and Gerhard Krieger, Jordi J. Mallorqui and Tao Zeng, Jordi J. Mallorqui and Andreas Reigber, Jordi J. Mallorqui and Irena Hajnsek, Jordi J. Mallorqui and Konstantinos Papathanassiou, Jordi J. Mallorqui and Jong-Sen Lee, Jordi J. Mallorqui and Laurent Ferro-Famil, Jordi J. Mallorqui and Ralf Horn, Jordi J. Mallorqui and Thomas Jagdhuber, Andreas Reigber and Gerhard Krieger, Andreas Reigber and Tao Zeng, Andreas Reigber and Irena Hajnsek, Andreas Reigber and Konstantinos Papathanassiou, Andreas Reigber and Jong-Sen Lee, Andreas Reigber and Ralf Horn, Andreas Reigber and Laurent Ferro-Famil, Andreas Reigber and Carsten Montzka, Andreas Reigber and Thomas Jagdhuber, Helmut Schön and Irena Hajnsek, Helmut Schön and Konstantinos Papathanassiou, Helmut Schön and Thomas Jagdhuber, Irena Hajnsek and Gerhard Krieger, Irena Hajnsek and Tao Zeng, Irena Hajnsek and Konstantinos Papathanassiou, Irena Hajnsek and Jong-Sen Lee, Irena Hajnsek and Ralf Horn, Irena Hajnsek and Laurent Ferro-Famil, Irena Hajnsek and Carsten Montzka, Irena Hajnsek and Thomas Jagdhuber, Irena Hajnsek and Hongquan Wang, Konstantinos Papathanassiou and Gerhard Krieger, Konstantinos Papathanassiou and Tao Zeng, Konstantinos Papathanassiou and Jong-Sen Lee, Konstantinos Papathanassiou and Ralf Horn, Konstantinos Papathanassiou and Laurent Ferro-Famil, Konstantinos Papathanassiou and Thomas Jagdhuber, Konstantinos Papathanassiou and Carsten Montzka, Konstantinos Papathanassiou and Hongquan Wang, Gerhard Krieger and Tao Zeng, Gerhard Krieger and Ralf Horn, Gerhard Krieger and Thomas Jagdhuber, Tao Zeng and Laurent Ferro-Famil, Ralf Horn and Carsten Montzka, Ralf Horn and Thomas Jagdhuber, Carsten Montzka and Thomas Jagdhuber, Thomas Jagdhuber and Jong-Sen Lee, Thomas Jagdhuber and Laurent Ferro-Famil, Thomas Jagdhuber and Hongquan Wang, Laurent Ferro-Famil and Jong-Sen Lee.\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\": \"Jordi J. Mallorqui\", \"id\": 343234}, {\"name\": \"Andreas Reigber\", \"id\": 186947}, {\"name\": \"Helmut Sch\\u00f6n\", \"id\": 1022342}, {\"name\": \"Irena Hajnsek\", \"id\": 210792}, {\"name\": \"Konstantinos Papathanassiou\", \"id\": 210793}, {\"name\": \"Gerhard Krieger\", \"id\": 77513}, {\"name\": \"Tao Zeng\", \"id\": 94187}, {\"name\": \"Ralf Horn\", \"id\": 418987}, {\"name\": \"Carsten Montzka\", \"id\": 469170}, {\"name\": \"Thomas Jagdhuber\", \"id\": 469171}, {\"name\": \"Laurent Ferro-Famil\", \"id\": 435285}, {\"name\": \"Jong-Sen Lee\", \"id\": 304661}, {\"name\": \"Francesco Bandiera\", \"id\": 319957}, {\"name\": \"Hongquan Wang\", \"id\": 700987}], \"links\": [{\"source\": 343234, \"target\": 77513}, {\"source\": 343234, \"target\": 94187}, {\"source\": 343234, \"target\": 186947}, {\"source\": 343234, \"target\": 210792}, {\"source\": 343234, \"target\": 210793}, {\"source\": 343234, \"target\": 304661}, {\"source\": 343234, \"target\": 435285}, {\"source\": 343234, \"target\": 418987}, {\"source\": 343234, \"target\": 469171}, {\"source\": 186947, \"target\": 77513}, {\"source\": 186947, \"target\": 94187}, {\"source\": 186947, \"target\": 210792}, {\"source\": 186947, \"target\": 210793}, {\"source\": 186947, \"target\": 304661}, {\"source\": 186947, \"target\": 418987}, {\"source\": 186947, \"target\": 435285}, {\"source\": 186947, \"target\": 469170}, {\"source\": 186947, \"target\": 469171}, {\"source\": 1022342, \"target\": 210792}, {\"source\": 1022342, \"target\": 210793}, {\"source\": 1022342, \"target\": 469171}, {\"source\": 210792, \"target\": 77513}, {\"source\": 210792, \"target\": 94187}, {\"source\": 210792, \"target\": 210793}, {\"source\": 210792, \"target\": 304661}, {\"source\": 210792, \"target\": 418987}, {\"source\": 210792, \"target\": 435285}, {\"source\": 210792, \"target\": 469170}, {\"source\": 210792, \"target\": 469171}, {\"source\": 210792, \"target\": 700987}, {\"source\": 210793, \"target\": 77513}, {\"source\": 210793, \"target\": 94187}, {\"source\": 210793, \"target\": 304661}, {\"source\": 210793, \"target\": 418987}, {\"source\": 210793, \"target\": 435285}, {\"source\": 210793, \"target\": 469171}, {\"source\": 210793, \"target\": 469170}, {\"source\": 210793, \"target\": 700987}, {\"source\": 77513, \"target\": 94187}, {\"source\": 77513, \"target\": 418987}, {\"source\": 77513, \"target\": 469171}, {\"source\": 94187, \"target\": 435285}, {\"source\": 418987, \"target\": 469170}, {\"source\": 418987, \"target\": 469171}, {\"source\": 469170, \"target\": 469171}, {\"source\": 469171, \"target\": 304661}, {\"source\": 469171, \"target\": 435285}, {\"source\": 469171, \"target\": 700987}, {\"source\": 435285, \"target\": 304661}]}",
"id": 2308,
"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: Jordi J. Mallorqui, Andreas Reigber, Helmut Schön, Irena Hajnsek, Konstantinos Papathanassiou, Gerhard Krieger, Tao Zeng, Ralf Horn, Carsten Montzka, Thomas Jagdhuber, Laurent Ferro-Famil, Jong-Sen Lee, Francesco Bandiera, Hongquan Wang\n- Research collaborations between these authors: Jordi J. Mallorqui and Gerhard Krieger, Jordi J. Mallorqui and Tao Zeng, Jordi J. Mallorqui and Andreas Reigber, Jordi J. Mallorqui and Irena Hajnsek, Jordi J. Mallorqui and Konstantinos Papathanassiou, Jordi J. Mallorqui and Jong-Sen Lee, Jordi J. Mallorqui and Laurent Ferro-Famil, Jordi J. Mallorqui and Ralf Horn, Jordi J. Mallorqui and Thomas Jagdhuber, Andreas Reigber and Gerhard Krieger, Andreas Reigber and Tao Zeng, Andreas Reigber and Irena Hajnsek, Andreas Reigber and Konstantinos Papathanassiou, Andreas Reigber and Jong-Sen Lee, Andreas Reigber and Ralf Horn, Andreas Reigber and Laurent Ferro-Famil, Andreas Reigber and Carsten Montzka, Andreas Reigber and Thomas Jagdhuber, Helmut Schön and Irena Hajnsek, Helmut Schön and Konstantinos Papathanassiou, Helmut Schön and Thomas Jagdhuber, Irena Hajnsek and Gerhard Krieger, Irena Hajnsek and Tao Zeng, Irena Hajnsek and Konstantinos Papathanassiou, Irena Hajnsek and Jong-Sen Lee, Irena Hajnsek and Ralf Horn, Irena Hajnsek and Laurent Ferro-Famil, Irena Hajnsek and Carsten Montzka, Irena Hajnsek and Thomas Jagdhuber, Irena Hajnsek and Hongquan Wang, Konstantinos Papathanassiou and Gerhard Krieger, Konstantinos Papathanassiou and Tao Zeng, Konstantinos Papathanassiou and Jong-Sen Lee, Konstantinos Papathanassiou and Ralf Horn, Konstantinos Papathanassiou and Laurent Ferro-Famil, Konstantinos Papathanassiou and Thomas Jagdhuber, Konstantinos Papathanassiou and Carsten Montzka, Konstantinos Papathanassiou and Hongquan Wang, Gerhard Krieger and Tao Zeng, Gerhard Krieger and Ralf Horn, Gerhard Krieger and Thomas Jagdhuber, Tao Zeng and Laurent Ferro-Famil, Ralf Horn and Carsten Montzka, Ralf Horn and Thomas Jagdhuber, Carsten Montzka and Thomas Jagdhuber, Thomas Jagdhuber and Jong-Sen Lee, Thomas Jagdhuber and Laurent Ferro-Famil, Thomas Jagdhuber and Hongquan Wang, Laurent Ferro-Famil and Jong-Sen Lee.\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: Noriki Uchida, Koji Hashimoto, Kaoru Sugita, Kazuo Takahata, Yuka Kato, Leonard Barolli, Masahiko Narita, Yoshitaka Shibata, Georg Gottlob, Akihiro Miyakawa, Yukiharu Kohsaka, Chuzo Akiguchi, Masao Yokota, Yuka Ito\n- Research collaborations between these authors: Noriki Uchida and Yoshitaka Shibata, Noriki Uchida and Kaoru Sugita, Noriki Uchida and Akihiro Miyakawa, Noriki Uchida and Koji Hashimoto, Noriki Uchida and Kazuo Takahata, Koji Hashimoto and Yoshitaka Shibata, Koji Hashimoto and Akihiro Miyakawa, Koji Hashimoto and Kaoru Sugita, Koji Hashimoto and Kazuo Takahata, Kaoru Sugita and Leonard Barolli, Kaoru Sugita and Yoshitaka Shibata, Kaoru Sugita and Akihiro Miyakawa, Kaoru Sugita and Yuka Kato, Kaoru Sugita and Masao Yokota, Kaoru Sugita and Yukiharu Kohsaka, Kazuo Takahata and Yoshitaka Shibata, Yuka Kato and Yuka Ito, Yuka Kato and Masahiko Narita, Leonard Barolli and Yoshitaka Shibata, Leonard Barolli and Akihiro Miyakawa, Masahiko Narita and Chuzo Akiguchi, Yoshitaka Shibata and Akihiro Miyakawa, Yoshitaka Shibata and Yukiharu Kohsaka, Georg Gottlob and Yuka Ito, Akihiro Miyakawa and Yukiharu Kohsaka, Akihiro Miyakawa and Masao Yokota.\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\": \"Noriki Uchida\", \"id\": 253216}, {\"name\": \"Koji Hashimoto\", \"id\": 253217}, {\"name\": \"Kaoru Sugita\", \"id\": 189347}, {\"name\": \"Kazuo Takahata\", \"id\": 270501}, {\"name\": \"Yuka Kato\", \"id\": 130858}, {\"name\": \"Leonard Barolli\", \"id\": 27821}, {\"name\": \"Masahiko Narita\", \"id\": 738383}, {\"name\": \"Yoshitaka Shibata\", \"id\": 72820}, {\"name\": \"Georg Gottlob\", \"id\": 1365}, {\"name\": \"Akihiro Miyakawa\", \"id\": 72821}, {\"name\": \"Yukiharu Kohsaka\", \"id\": 1159828}, {\"name\": \"Chuzo Akiguchi\", \"id\": 1107451}, {\"name\": \"Masao Yokota\", \"id\": 339261}, {\"name\": \"Yuka Ito\", \"id\": 260827}], \"links\": [{\"source\": 253216, \"target\": 72820}, {\"source\": 253216, \"target\": 189347}, {\"source\": 253216, \"target\": 72821}, {\"source\": 253216, \"target\": 253217}, {\"source\": 253216, \"target\": 270501}, {\"source\": 253217, \"target\": 72820}, {\"source\": 253217, \"target\": 72821}, {\"source\": 253217, \"target\": 189347}, {\"source\": 253217, \"target\": 270501}, {\"source\": 189347, \"target\": 27821}, {\"source\": 189347, \"target\": 72820}, {\"source\": 189347, \"target\": 72821}, {\"source\": 189347, \"target\": 130858}, {\"source\": 189347, \"target\": 339261}, {\"source\": 189347, \"target\": 1159828}, {\"source\": 270501, \"target\": 72820}, {\"source\": 130858, \"target\": 260827}, {\"source\": 130858, \"target\": 738383}, {\"source\": 27821, \"target\": 72820}, {\"source\": 27821, \"target\": 72821}, {\"source\": 738383, \"target\": 1107451}, {\"source\": 72820, \"target\": 72821}, {\"source\": 72820, \"target\": 1159828}, {\"source\": 1365, \"target\": 260827}, {\"source\": 72821, \"target\": 1159828}, {\"source\": 72821, \"target\": 339261}]}",
"id": 477,
"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: Noriki Uchida, Koji Hashimoto, Kaoru Sugita, Kazuo Takahata, Yuka Kato, Leonard Barolli, Masahiko Narita, Yoshitaka Shibata, Georg Gottlob, Akihiro Miyakawa, Yukiharu Kohsaka, Chuzo Akiguchi, Masao Yokota, Yuka Ito\n- Research collaborations between these authors: Noriki Uchida and Yoshitaka Shibata, Noriki Uchida and Kaoru Sugita, Noriki Uchida and Akihiro Miyakawa, Noriki Uchida and Koji Hashimoto, Noriki Uchida and Kazuo Takahata, Koji Hashimoto and Yoshitaka Shibata, Koji Hashimoto and Akihiro Miyakawa, Koji Hashimoto and Kaoru Sugita, Koji Hashimoto and Kazuo Takahata, Kaoru Sugita and Leonard Barolli, Kaoru Sugita and Yoshitaka Shibata, Kaoru Sugita and Akihiro Miyakawa, Kaoru Sugita and Yuka Kato, Kaoru Sugita and Masao Yokota, Kaoru Sugita and Yukiharu Kohsaka, Kazuo Takahata and Yoshitaka Shibata, Yuka Kato and Yuka Ito, Yuka Kato and Masahiko Narita, Leonard Barolli and Yoshitaka Shibata, Leonard Barolli and Akihiro Miyakawa, Masahiko Narita and Chuzo Akiguchi, Yoshitaka Shibata and Akihiro Miyakawa, Yoshitaka Shibata and Yukiharu Kohsaka, Georg Gottlob and Yuka Ito, Akihiro Miyakawa and Yukiharu Kohsaka, Akihiro Miyakawa and Masao Yokota.\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: Nassir Navab, Catherine Laporte, Laurence H. Berman, Jorge Alves Silva, Gregory D. Hager, Graham M. Treece, Andrew H. Gee, Richard W. Prager, Tal Arbel, Aurélio C. Campilho, Robert Rohling, Purang Abolmaesumi, Gabor Fichtinger, Septimiu E. Salcudean\n- Research collaborations between these authors: Nassir Navab and Robert Rohling, Nassir Navab and Purang Abolmaesumi, Nassir Navab and Septimiu E. Salcudean, Nassir Navab and Gabor Fichtinger, Nassir Navab and Tal Arbel, Nassir Navab and Gregory D. Hager, Nassir Navab and Graham M. Treece, Nassir Navab and Andrew H. Gee, Nassir Navab and Richard W. Prager, Nassir Navab and Laurence H. Berman, Catherine Laporte and Purang Abolmaesumi, Catherine Laporte and Tal Arbel, Catherine Laporte and Robert Rohling, Catherine Laporte and Gabor Fichtinger, Catherine Laporte and Graham M. Treece, Catherine Laporte and Andrew H. Gee, Catherine Laporte and Richard W. Prager, Catherine Laporte and Laurence H. Berman, Laurence H. Berman and Aurélio C. Campilho, Laurence H. Berman and Tal Arbel, Laurence H. Berman and Graham M. Treece, Laurence H. Berman and Andrew H. Gee, Laurence H. Berman and Richard W. Prager, Laurence H. Berman and Jorge Alves Silva, Jorge Alves Silva and Aurélio C. Campilho, Jorge Alves Silva and Graham M. Treece, Jorge Alves Silva and Andrew H. Gee, Jorge Alves Silva and Richard W. Prager, Gregory D. Hager and Robert Rohling, Gregory D. Hager and Septimiu E. Salcudean, Gregory D. Hager and Gabor Fichtinger, Gregory D. Hager and Purang Abolmaesumi, Gregory D. Hager and Graham M. Treece, Gregory D. Hager and Andrew H. Gee, Gregory D. Hager and Richard W. Prager, Graham M. Treece and Aurélio C. Campilho, Graham M. Treece and Robert Rohling, Graham M. Treece and Purang Abolmaesumi, Graham M. Treece and Septimiu E. Salcudean, Graham M. Treece and Gabor Fichtinger, Graham M. Treece and Tal Arbel, Graham M. Treece and Andrew H. Gee, Graham M. Treece and Richard W. Prager, Andrew H. Gee and Aurélio C. Campilho, Andrew H. Gee and Robert Rohling, Andrew H. Gee and Purang Abolmaesumi, Andrew H. Gee and Septimiu E. Salcudean, Andrew H. Gee and Gabor Fichtinger, Andrew H. Gee and Tal Arbel, Andrew H. Gee and Richard W. Prager, Richard W. Prager and Aurélio C. Campilho, Richard W. Prager and Robert Rohling, Richard W. Prager and Purang Abolmaesumi, Richard W. Prager and Septimiu E. Salcudean, Richard W. Prager and Gabor Fichtinger, Richard W. Prager and Tal Arbel, Tal Arbel and Purang Abolmaesumi, Tal Arbel and Gabor Fichtinger, Robert Rohling and Purang Abolmaesumi, Robert Rohling and Septimiu E. Salcudean, Robert Rohling and Gabor Fichtinger, Purang Abolmaesumi and Septimiu E. Salcudean, Purang Abolmaesumi and Gabor Fichtinger, Gabor Fichtinger and Septimiu E. Salcudean.\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\": \"Nassir Navab\", \"id\": 12480}, {\"name\": \"Catherine Laporte\", \"id\": 82402}, {\"name\": \"Laurence H. Berman\", \"id\": 676645}, {\"name\": \"Jorge Alves Silva\", \"id\": 241674}, {\"name\": \"Gregory D. Hager\", \"id\": 71307}, {\"name\": \"Graham M. Treece\", \"id\": 228210}, {\"name\": \"Andrew H. Gee\", \"id\": 228211}, {\"name\": \"Richard W. Prager\", \"id\": 228212}, {\"name\": \"Tal Arbel\", \"id\": 60563}, {\"name\": \"Aur\\u00e9lio C. Campilho\", \"id\": 7414}, {\"name\": \"Robert Rohling\", \"id\": 28632}, {\"name\": \"Purang Abolmaesumi\", \"id\": 28633}, {\"name\": \"Gabor Fichtinger\", \"id\": 53084}, {\"name\": \"Septimiu E. Salcudean\", \"id\": 47037}], \"links\": [{\"source\": 12480, \"target\": 28632}, {\"source\": 12480, \"target\": 28633}, {\"source\": 12480, \"target\": 47037}, {\"source\": 12480, \"target\": 53084}, {\"source\": 12480, \"target\": 60563}, {\"source\": 12480, \"target\": 71307}, {\"source\": 12480, \"target\": 228210}, {\"source\": 12480, \"target\": 228211}, {\"source\": 12480, \"target\": 228212}, {\"source\": 12480, \"target\": 676645}, {\"source\": 82402, \"target\": 28633}, {\"source\": 82402, \"target\": 60563}, {\"source\": 82402, \"target\": 28632}, {\"source\": 82402, \"target\": 53084}, {\"source\": 82402, \"target\": 228210}, {\"source\": 82402, \"target\": 228211}, {\"source\": 82402, \"target\": 228212}, {\"source\": 82402, \"target\": 676645}, {\"source\": 676645, \"target\": 7414}, {\"source\": 676645, \"target\": 60563}, {\"source\": 676645, \"target\": 228210}, {\"source\": 676645, \"target\": 228211}, {\"source\": 676645, \"target\": 228212}, {\"source\": 676645, \"target\": 241674}, {\"source\": 241674, \"target\": 7414}, {\"source\": 241674, \"target\": 228210}, {\"source\": 241674, \"target\": 228211}, {\"source\": 241674, \"target\": 228212}, {\"source\": 71307, \"target\": 28632}, {\"source\": 71307, \"target\": 47037}, {\"source\": 71307, \"target\": 53084}, {\"source\": 71307, \"target\": 28633}, {\"source\": 71307, \"target\": 228210}, {\"source\": 71307, \"target\": 228211}, {\"source\": 71307, \"target\": 228212}, {\"source\": 228210, \"target\": 7414}, {\"source\": 228210, \"target\": 28632}, {\"source\": 228210, \"target\": 28633}, {\"source\": 228210, \"target\": 47037}, {\"source\": 228210, \"target\": 53084}, {\"source\": 228210, \"target\": 60563}, {\"source\": 228210, \"target\": 228211}, {\"source\": 228210, \"target\": 228212}, {\"source\": 228211, \"target\": 7414}, {\"source\": 228211, \"target\": 28632}, {\"source\": 228211, \"target\": 28633}, {\"source\": 228211, \"target\": 47037}, {\"source\": 228211, \"target\": 53084}, {\"source\": 228211, \"target\": 60563}, {\"source\": 228211, \"target\": 228212}, {\"source\": 228212, \"target\": 7414}, {\"source\": 228212, \"target\": 28632}, {\"source\": 228212, \"target\": 28633}, {\"source\": 228212, \"target\": 47037}, {\"source\": 228212, \"target\": 53084}, {\"source\": 228212, \"target\": 60563}, {\"source\": 60563, \"target\": 28633}, {\"source\": 60563, \"target\": 53084}, {\"source\": 28632, \"target\": 28633}, {\"source\": 28632, \"target\": 47037}, {\"source\": 28632, \"target\": 53084}, {\"source\": 28633, \"target\": 47037}, {\"source\": 28633, \"target\": 53084}, {\"source\": 53084, \"target\": 47037}]}",
"id": 2749,
"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: Nassir Navab, Catherine Laporte, Laurence H. Berman, Jorge Alves Silva, Gregory D. Hager, Graham M. Treece, Andrew H. Gee, Richard W. Prager, Tal Arbel, Aurélio C. Campilho, Robert Rohling, Purang Abolmaesumi, Gabor Fichtinger, Septimiu E. Salcudean\n- Research collaborations between these authors: Nassir Navab and Robert Rohling, Nassir Navab and Purang Abolmaesumi, Nassir Navab and Septimiu E. Salcudean, Nassir Navab and Gabor Fichtinger, Nassir Navab and Tal Arbel, Nassir Navab and Gregory D. Hager, Nassir Navab and Graham M. Treece, Nassir Navab and Andrew H. Gee, Nassir Navab and Richard W. Prager, Nassir Navab and Laurence H. Berman, Catherine Laporte and Purang Abolmaesumi, Catherine Laporte and Tal Arbel, Catherine Laporte and Robert Rohling, Catherine Laporte and Gabor Fichtinger, Catherine Laporte and Graham M. Treece, Catherine Laporte and Andrew H. Gee, Catherine Laporte and Richard W. Prager, Catherine Laporte and Laurence H. Berman, Laurence H. Berman and Aurélio C. Campilho, Laurence H. Berman and Tal Arbel, Laurence H. Berman and Graham M. Treece, Laurence H. Berman and Andrew H. Gee, Laurence H. Berman and Richard W. Prager, Laurence H. Berman and Jorge Alves Silva, Jorge Alves Silva and Aurélio C. Campilho, Jorge Alves Silva and Graham M. Treece, Jorge Alves Silva and Andrew H. Gee, Jorge Alves Silva and Richard W. Prager, Gregory D. Hager and Robert Rohling, Gregory D. Hager and Septimiu E. Salcudean, Gregory D. Hager and Gabor Fichtinger, Gregory D. Hager and Purang Abolmaesumi, Gregory D. Hager and Graham M. Treece, Gregory D. Hager and Andrew H. Gee, Gregory D. Hager and Richard W. Prager, Graham M. Treece and Aurélio C. Campilho, Graham M. Treece and Robert Rohling, Graham M. Treece and Purang Abolmaesumi, Graham M. Treece and Septimiu E. Salcudean, Graham M. Treece and Gabor Fichtinger, Graham M. Treece and Tal Arbel, Graham M. Treece and Andrew H. Gee, Graham M. Treece and Richard W. Prager, Andrew H. Gee and Aurélio C. Campilho, Andrew H. Gee and Robert Rohling, Andrew H. Gee and Purang Abolmaesumi, Andrew H. Gee and Septimiu E. Salcudean, Andrew H. Gee and Gabor Fichtinger, Andrew H. Gee and Tal Arbel, Andrew H. Gee and Richard W. Prager, Richard W. Prager and Aurélio C. Campilho, Richard W. Prager and Robert Rohling, Richard W. Prager and Purang Abolmaesumi, Richard W. Prager and Septimiu E. Salcudean, Richard W. Prager and Gabor Fichtinger, Richard W. Prager and Tal Arbel, Tal Arbel and Purang Abolmaesumi, Tal Arbel and Gabor Fichtinger, Robert Rohling and Purang Abolmaesumi, Robert Rohling and Septimiu E. Salcudean, Robert Rohling and Gabor Fichtinger, Purang Abolmaesumi and Septimiu E. Salcudean, Purang Abolmaesumi and Gabor Fichtinger, Gabor Fichtinger and Septimiu E. Salcudean.\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: Damian M. Lyons, Enrique Vidal, Safwan Wshah, Alejandro Héctor Toselli, Mohamed Cheriet, Horst Bunke, Joan Puigcerver, Jesse de Does, Sabri A. Mahmoud, Florent Perronnin, Anil K. Jain, Andreas Fischer, Antonio L. Lagarda, Venu Govindaraju\n- Research collaborations between these authors: Enrique Vidal and Venu Govindaraju, Enrique Vidal and Horst Bunke, Enrique Vidal and Alejandro Héctor Toselli, Enrique Vidal and Florent Perronnin, Enrique Vidal and Antonio L. Lagarda, Enrique Vidal and Andreas Fischer, Enrique Vidal and Joan Puigcerver, Enrique Vidal and Safwan Wshah, Enrique Vidal and Jesse de Does, Safwan Wshah and Alejandro Héctor Toselli, Safwan Wshah and Mohamed Cheriet, Safwan Wshah and Joan Puigcerver, Safwan Wshah and Sabri A. Mahmoud, Safwan Wshah and Venu Govindaraju, Safwan Wshah and Horst Bunke, Safwan Wshah and Florent Perronnin, Alejandro Héctor Toselli and Horst Bunke, Alejandro Héctor Toselli and Venu Govindaraju, Alejandro Héctor Toselli and Florent Perronnin, Alejandro Héctor Toselli and Antonio L. Lagarda, Alejandro Héctor Toselli and Andreas Fischer, Alejandro Héctor Toselli and Joan Puigcerver, Alejandro Héctor Toselli and Jesse de Does, Mohamed Cheriet and Venu Govindaraju, Mohamed Cheriet and Horst Bunke, Mohamed Cheriet and Anil K. Jain, Mohamed Cheriet and Andreas Fischer, Mohamed Cheriet and Sabri A. Mahmoud, Horst Bunke and Venu Govindaraju, Horst Bunke and Anil K. Jain, Horst Bunke and Florent Perronnin, Horst Bunke and Andreas Fischer, Horst Bunke and Joan Puigcerver, Horst Bunke and Sabri A. Mahmoud, Joan Puigcerver and Venu Govindaraju, Joan Puigcerver and Florent Perronnin, Joan Puigcerver and Andreas Fischer, Sabri A. Mahmoud and Venu Govindaraju, Sabri A. Mahmoud and Anil K. Jain, Florent Perronnin and Venu Govindaraju, Florent Perronnin and Andreas Fischer, Anil K. Jain and Venu Govindaraju, Andreas Fischer and Venu Govindaraju.\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\": \"Antonio L. Lagarda\", \"id\": 72569}, {\"name\": \"Safwan Wshah\", \"id\": 458470}, {\"name\": \"Mohamed Cheriet\", \"id\": 24871}, {\"name\": \"Enrique Vidal\", \"id\": 10598}, {\"name\": \"Alejandro H\\u00e9ctor Toselli\", \"id\": 17351}, {\"name\": \"Horst Bunke\", \"id\": 11151}, {\"name\": \"Joan Puigcerver\", \"id\": 209424}, {\"name\": \"Jesse de Does\", \"id\": 548655}, {\"name\": \"Sabri A. Mahmoud\", \"id\": 305458}, {\"name\": \"Florent Perronnin\", \"id\": 57682}, {\"name\": \"Anil K. Jain\", \"id\": 28181}, {\"name\": \"Andreas Fischer\", \"id\": 81365}, {\"name\": \"Damian M. Lyons\", \"id\": 176377}, {\"name\": \"Venu Govindaraju\", \"id\": 7582}], \"links\": [{\"source\": 72569, \"target\": 10598}, {\"source\": 72569, \"target\": 17351}, {\"source\": 458470, \"target\": 10598}, {\"source\": 458470, \"target\": 17351}, {\"source\": 458470, \"target\": 24871}, {\"source\": 458470, \"target\": 209424}, {\"source\": 458470, \"target\": 305458}, {\"source\": 458470, \"target\": 7582}, {\"source\": 458470, \"target\": 11151}, {\"source\": 458470, \"target\": 57682}, {\"source\": 24871, \"target\": 7582}, {\"source\": 24871, \"target\": 11151}, {\"source\": 24871, \"target\": 28181}, {\"source\": 24871, \"target\": 81365}, {\"source\": 24871, \"target\": 305458}, {\"source\": 10598, \"target\": 7582}, {\"source\": 10598, \"target\": 11151}, {\"source\": 10598, \"target\": 17351}, {\"source\": 10598, \"target\": 57682}, {\"source\": 10598, \"target\": 81365}, {\"source\": 10598, \"target\": 209424}, {\"source\": 10598, \"target\": 548655}, {\"source\": 17351, \"target\": 11151}, {\"source\": 17351, \"target\": 7582}, {\"source\": 17351, \"target\": 57682}, {\"source\": 17351, \"target\": 81365}, {\"source\": 17351, \"target\": 209424}, {\"source\": 17351, \"target\": 548655}, {\"source\": 11151, \"target\": 7582}, {\"source\": 11151, \"target\": 28181}, {\"source\": 11151, \"target\": 57682}, {\"source\": 11151, \"target\": 81365}, {\"source\": 11151, \"target\": 209424}, {\"source\": 11151, \"target\": 305458}, {\"source\": 209424, \"target\": 7582}, {\"source\": 209424, \"target\": 57682}, {\"source\": 209424, \"target\": 81365}, {\"source\": 305458, \"target\": 7582}, {\"source\": 305458, \"target\": 28181}, {\"source\": 57682, \"target\": 7582}, {\"source\": 57682, \"target\": 81365}, {\"source\": 28181, \"target\": 7582}, {\"source\": 81365, \"target\": 7582}]}",
"id": 1585,
"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: Damian M. Lyons, Enrique Vidal, Safwan Wshah, Alejandro Héctor Toselli, Mohamed Cheriet, Horst Bunke, Joan Puigcerver, Jesse de Does, Sabri A. Mahmoud, Florent Perronnin, Anil K. Jain, Andreas Fischer, Antonio L. Lagarda, Venu Govindaraju\n- Research collaborations between these authors: Enrique Vidal and Venu Govindaraju, Enrique Vidal and Horst Bunke, Enrique Vidal and Alejandro Héctor Toselli, Enrique Vidal and Florent Perronnin, Enrique Vidal and Antonio L. Lagarda, Enrique Vidal and Andreas Fischer, Enrique Vidal and Joan Puigcerver, Enrique Vidal and Safwan Wshah, Enrique Vidal and Jesse de Does, Safwan Wshah and Alejandro Héctor Toselli, Safwan Wshah and Mohamed Cheriet, Safwan Wshah and Joan Puigcerver, Safwan Wshah and Sabri A. Mahmoud, Safwan Wshah and Venu Govindaraju, Safwan Wshah and Horst Bunke, Safwan Wshah and Florent Perronnin, Alejandro Héctor Toselli and Horst Bunke, Alejandro Héctor Toselli and Venu Govindaraju, Alejandro Héctor Toselli and Florent Perronnin, Alejandro Héctor Toselli and Antonio L. Lagarda, Alejandro Héctor Toselli and Andreas Fischer, Alejandro Héctor Toselli and Joan Puigcerver, Alejandro Héctor Toselli and Jesse de Does, Mohamed Cheriet and Venu Govindaraju, Mohamed Cheriet and Horst Bunke, Mohamed Cheriet and Anil K. Jain, Mohamed Cheriet and Andreas Fischer, Mohamed Cheriet and Sabri A. Mahmoud, Horst Bunke and Venu Govindaraju, Horst Bunke and Anil K. Jain, Horst Bunke and Florent Perronnin, Horst Bunke and Andreas Fischer, Horst Bunke and Joan Puigcerver, Horst Bunke and Sabri A. Mahmoud, Joan Puigcerver and Venu Govindaraju, Joan Puigcerver and Florent Perronnin, Joan Puigcerver and Andreas Fischer, Sabri A. Mahmoud and Venu Govindaraju, Sabri A. Mahmoud and Anil K. Jain, Florent Perronnin and Venu Govindaraju, Florent Perronnin and Andreas Fischer, Anil K. Jain and Venu Govindaraju, Andreas Fischer and Venu Govindaraju.\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: Tomas Eklund, Elena Karahanna, Ritu Agarwal, Viswanath Venkatesh, Yung Ho Suh, Francisco J. Liébana-Cabanillas, Hannu Vanharanta, Michael G. Morris, Zhiyuan Yao, Barbro Back, Ari Visa, Paul A. Pavlou, Esa Alhoniemi, Juha Vesanto\n- Research collaborations between these authors: Tomas Eklund and Ari Visa, Tomas Eklund and Zhiyuan Yao, Tomas Eklund and Barbro Back, Tomas Eklund and Hannu Vanharanta, Tomas Eklund and Juha Vesanto, Tomas Eklund and Esa Alhoniemi, Tomas Eklund and Yung Ho Suh, Elena Karahanna and Ritu Agarwal, Elena Karahanna and Paul A. Pavlou, Elena Karahanna and Viswanath Venkatesh, Elena Karahanna and Michael G. Morris, Elena Karahanna and Francisco J. Liébana-Cabanillas, Elena Karahanna and Yung Ho Suh, Ritu Agarwal and Paul A. Pavlou, Ritu Agarwal and Viswanath Venkatesh, Ritu Agarwal and Michael G. Morris, Ritu Agarwal and Yung Ho Suh, Viswanath Venkatesh and Paul A. Pavlou, Viswanath Venkatesh and Michael G. Morris, Viswanath Venkatesh and Francisco J. Liébana-Cabanillas, Viswanath Venkatesh and Yung Ho Suh, Yung Ho Suh and Barbro Back, Yung Ho Suh and Francisco J. Liébana-Cabanillas, Francisco J. Liébana-Cabanillas and Paul A. Pavlou, Francisco J. Liébana-Cabanillas and Michael G. Morris, Hannu Vanharanta and Ari Visa, Hannu Vanharanta and Barbro Back, Zhiyuan Yao and Barbro Back, Zhiyuan Yao and Juha Vesanto, Zhiyuan Yao and Esa Alhoniemi, Barbro Back and Ari Visa, Barbro Back and Juha Vesanto, Barbro Back and Esa Alhoniemi.\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\": \"Tomas Eklund\", \"id\": 480}, {\"name\": \"Elena Karahanna\", \"id\": 28485}, {\"name\": \"Ritu Agarwal\", \"id\": 1770}, {\"name\": \"Yung Ho Suh\", \"id\": 415051}, {\"name\": \"Viswanath Venkatesh\", \"id\": 74763}, {\"name\": \"Francisco J. Li\\u00e9bana-Cabanillas\", \"id\": 199820}, {\"name\": \"Hannu Vanharanta\", \"id\": 88113}, {\"name\": \"Michael G. Morris\", \"id\": 99953}, {\"name\": \"Zhiyuan Yao\", \"id\": 19669}, {\"name\": \"Barbro Back\", \"id\": 19670}, {\"name\": \"Ari Visa\", \"id\": 2103}, {\"name\": \"Paul A. Pavlou\", \"id\": 73144}, {\"name\": \"Esa Alhoniemi\", \"id\": 371257}, {\"name\": \"Juha Vesanto\", \"id\": 303642}], \"links\": [{\"source\": 480, \"target\": 2103}, {\"source\": 480, \"target\": 19669}, {\"source\": 480, \"target\": 19670}, {\"source\": 480, \"target\": 88113}, {\"source\": 480, \"target\": 303642}, {\"source\": 480, \"target\": 371257}, {\"source\": 480, \"target\": 415051}, {\"source\": 28485, \"target\": 1770}, {\"source\": 28485, \"target\": 73144}, {\"source\": 28485, \"target\": 74763}, {\"source\": 28485, \"target\": 99953}, {\"source\": 28485, \"target\": 199820}, {\"source\": 28485, \"target\": 415051}, {\"source\": 1770, \"target\": 73144}, {\"source\": 1770, \"target\": 74763}, {\"source\": 1770, \"target\": 99953}, {\"source\": 1770, \"target\": 415051}, {\"source\": 415051, \"target\": 19670}, {\"source\": 415051, \"target\": 199820}, {\"source\": 415051, \"target\": 74763}, {\"source\": 74763, \"target\": 73144}, {\"source\": 74763, \"target\": 99953}, {\"source\": 74763, \"target\": 199820}, {\"source\": 199820, \"target\": 73144}, {\"source\": 199820, \"target\": 99953}, {\"source\": 88113, \"target\": 2103}, {\"source\": 88113, \"target\": 19670}, {\"source\": 19669, \"target\": 19670}, {\"source\": 19669, \"target\": 303642}, {\"source\": 19669, \"target\": 371257}, {\"source\": 19670, \"target\": 2103}, {\"source\": 19670, \"target\": 303642}, {\"source\": 19670, \"target\": 371257}]}",
"id": 302,
"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: Tomas Eklund, Elena Karahanna, Ritu Agarwal, Viswanath Venkatesh, Yung Ho Suh, Francisco J. Liébana-Cabanillas, Hannu Vanharanta, Michael G. Morris, Zhiyuan Yao, Barbro Back, Ari Visa, Paul A. Pavlou, Esa Alhoniemi, Juha Vesanto\n- Research collaborations between these authors: Tomas Eklund and Ari Visa, Tomas Eklund and Zhiyuan Yao, Tomas Eklund and Barbro Back, Tomas Eklund and Hannu Vanharanta, Tomas Eklund and Juha Vesanto, Tomas Eklund and Esa Alhoniemi, Tomas Eklund and Yung Ho Suh, Elena Karahanna and Ritu Agarwal, Elena Karahanna and Paul A. Pavlou, Elena Karahanna and Viswanath Venkatesh, Elena Karahanna and Michael G. Morris, Elena Karahanna and Francisco J. Liébana-Cabanillas, Elena Karahanna and Yung Ho Suh, Ritu Agarwal and Paul A. Pavlou, Ritu Agarwal and Viswanath Venkatesh, Ritu Agarwal and Michael G. Morris, Ritu Agarwal and Yung Ho Suh, Viswanath Venkatesh and Paul A. Pavlou, Viswanath Venkatesh and Michael G. Morris, Viswanath Venkatesh and Francisco J. Liébana-Cabanillas, Viswanath Venkatesh and Yung Ho Suh, Yung Ho Suh and Barbro Back, Yung Ho Suh and Francisco J. Liébana-Cabanillas, Francisco J. Liébana-Cabanillas and Paul A. Pavlou, Francisco J. Liébana-Cabanillas and Michael G. Morris, Hannu Vanharanta and Ari Visa, Hannu Vanharanta and Barbro Back, Zhiyuan Yao and Barbro Back, Zhiyuan Yao and Juha Vesanto, Zhiyuan Yao and Esa Alhoniemi, Barbro Back and Ari Visa, Barbro Back and Juha Vesanto, Barbro Back and Esa Alhoniemi.\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érard Maral, Gorazd Kandus, Nei Kato, Aiyou Chen, Evangelos Papapetrou, George Varghese, Zhaofeng Wu, Stylianos Karapantazis, Michael D. Bender, Eylem Ekici, Fenglin Jin, Ales Svigelj, Ian F. Akyildiz, Mihael Mohorcic\n- Research collaborations between these authors: Gérard Maral and Gorazd Kandus, Gérard Maral and Mihael Mohorcic, Gérard Maral and Ales Svigelj, Gérard Maral and Zhaofeng Wu, Gérard Maral and Fenglin Jin, Gorazd Kandus and Nei Kato, Gorazd Kandus and Ian F. Akyildiz, Gorazd Kandus and Mihael Mohorcic, Gorazd Kandus and Ales Svigelj, Gorazd Kandus and Evangelos Papapetrou, Gorazd Kandus and Stylianos Karapantazis, Gorazd Kandus and Zhaofeng Wu, Gorazd Kandus and Fenglin Jin, Nei Kato and Ian F. Akyildiz, Nei Kato and Eylem Ekici, Nei Kato and Mihael Mohorcic, Nei Kato and Ales Svigelj, Nei Kato and Michael D. Bender, Nei Kato and Evangelos Papapetrou, Nei Kato and Zhaofeng Wu, Nei Kato and Fenglin Jin, Aiyou Chen and George Varghese, Aiyou Chen and Zhaofeng Wu, Evangelos Papapetrou and Ian F. Akyildiz, Evangelos Papapetrou and Eylem Ekici, Evangelos Papapetrou and Mihael Mohorcic, Evangelos Papapetrou and Ales Svigelj, Evangelos Papapetrou and Michael D. Bender, Evangelos Papapetrou and Stylianos Karapantazis, Evangelos Papapetrou and Zhaofeng Wu, Evangelos Papapetrou and Fenglin Jin, George Varghese and Zhaofeng Wu, Zhaofeng Wu and Ian F. Akyildiz, Zhaofeng Wu and Eylem Ekici, Zhaofeng Wu and Mihael Mohorcic, Zhaofeng Wu and Ales Svigelj, Zhaofeng Wu and Michael D. Bender, Zhaofeng Wu and Stylianos Karapantazis, Stylianos Karapantazis and Ian F. Akyildiz, Stylianos Karapantazis and Mihael Mohorcic, Stylianos Karapantazis and Ales Svigelj, Stylianos Karapantazis and Michael D. Bender, Stylianos Karapantazis and Fenglin Jin, Michael D. Bender and Ian F. Akyildiz, Michael D. Bender and Eylem Ekici, Michael D. Bender and Fenglin Jin, Eylem Ekici and Ian F. Akyildiz, Eylem Ekici and Fenglin Jin, Fenglin Jin and Ian F. Akyildiz, Fenglin Jin and Mihael Mohorcic, Fenglin Jin and Ales Svigelj, Ales Svigelj and Mihael Mohorcic.\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\": \"G\\u00e9rard Maral\", \"id\": 277664}, {\"name\": \"Gorazd Kandus\", \"id\": 141442}, {\"name\": \"Nei Kato\", \"id\": 101127}, {\"name\": \"Aiyou Chen\", \"id\": 351432}, {\"name\": \"Evangelos Papapetrou\", \"id\": 279277}, {\"name\": \"George Varghese\", \"id\": 138415}, {\"name\": \"Zhaofeng Wu\", \"id\": 1174704}, {\"name\": \"Stylianos Karapantazis\", \"id\": 598641}, {\"name\": \"Michael D. Bender\", \"id\": 320176}, {\"name\": \"Eylem Ekici\", \"id\": 234097}, {\"name\": \"Fenglin Jin\", \"id\": 1174705}, {\"name\": \"Ales Svigelj\", \"id\": 274711}, {\"name\": \"Ian F. Akyildiz\", \"id\": 180218}, {\"name\": \"Mihael Mohorcic\", \"id\": 258589}], \"links\": [{\"source\": 277664, \"target\": 141442}, {\"source\": 277664, \"target\": 258589}, {\"source\": 277664, \"target\": 274711}, {\"source\": 277664, \"target\": 1174704}, {\"source\": 277664, \"target\": 1174705}, {\"source\": 141442, \"target\": 101127}, {\"source\": 141442, \"target\": 180218}, {\"source\": 141442, \"target\": 258589}, {\"source\": 141442, \"target\": 274711}, {\"source\": 141442, \"target\": 279277}, {\"source\": 141442, \"target\": 598641}, {\"source\": 141442, \"target\": 1174704}, {\"source\": 141442, \"target\": 1174705}, {\"source\": 101127, \"target\": 180218}, {\"source\": 101127, \"target\": 234097}, {\"source\": 101127, \"target\": 258589}, {\"source\": 101127, \"target\": 274711}, {\"source\": 101127, \"target\": 320176}, {\"source\": 101127, \"target\": 279277}, {\"source\": 101127, \"target\": 1174704}, {\"source\": 101127, \"target\": 1174705}, {\"source\": 351432, \"target\": 138415}, {\"source\": 351432, \"target\": 1174704}, {\"source\": 279277, \"target\": 180218}, {\"source\": 279277, \"target\": 234097}, {\"source\": 279277, \"target\": 258589}, {\"source\": 279277, \"target\": 274711}, {\"source\": 279277, \"target\": 320176}, {\"source\": 279277, \"target\": 598641}, {\"source\": 279277, \"target\": 1174704}, {\"source\": 279277, \"target\": 1174705}, {\"source\": 138415, \"target\": 1174704}, {\"source\": 1174704, \"target\": 180218}, {\"source\": 1174704, \"target\": 234097}, {\"source\": 1174704, \"target\": 258589}, {\"source\": 1174704, \"target\": 274711}, {\"source\": 1174704, \"target\": 320176}, {\"source\": 1174704, \"target\": 598641}, {\"source\": 598641, \"target\": 180218}, {\"source\": 598641, \"target\": 258589}, {\"source\": 598641, \"target\": 274711}, {\"source\": 598641, \"target\": 320176}, {\"source\": 598641, \"target\": 1174705}, {\"source\": 320176, \"target\": 180218}, {\"source\": 320176, \"target\": 234097}, {\"source\": 320176, \"target\": 1174705}, {\"source\": 234097, \"target\": 180218}, {\"source\": 234097, \"target\": 1174705}, {\"source\": 1174705, \"target\": 180218}, {\"source\": 1174705, \"target\": 258589}, {\"source\": 1174705, \"target\": 274711}, {\"source\": 274711, \"target\": 258589}]}",
"id": 1907,
"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érard Maral, Gorazd Kandus, Nei Kato, Aiyou Chen, Evangelos Papapetrou, George Varghese, Zhaofeng Wu, Stylianos Karapantazis, Michael D. Bender, Eylem Ekici, Fenglin Jin, Ales Svigelj, Ian F. Akyildiz, Mihael Mohorcic\n- Research collaborations between these authors: Gérard Maral and Gorazd Kandus, Gérard Maral and Mihael Mohorcic, Gérard Maral and Ales Svigelj, Gérard Maral and Zhaofeng Wu, Gérard Maral and Fenglin Jin, Gorazd Kandus and Nei Kato, Gorazd Kandus and Ian F. Akyildiz, Gorazd Kandus and Mihael Mohorcic, Gorazd Kandus and Ales Svigelj, Gorazd Kandus and Evangelos Papapetrou, Gorazd Kandus and Stylianos Karapantazis, Gorazd Kandus and Zhaofeng Wu, Gorazd Kandus and Fenglin Jin, Nei Kato and Ian F. Akyildiz, Nei Kato and Eylem Ekici, Nei Kato and Mihael Mohorcic, Nei Kato and Ales Svigelj, Nei Kato and Michael D. Bender, Nei Kato and Evangelos Papapetrou, Nei Kato and Zhaofeng Wu, Nei Kato and Fenglin Jin, Aiyou Chen and George Varghese, Aiyou Chen and Zhaofeng Wu, Evangelos Papapetrou and Ian F. Akyildiz, Evangelos Papapetrou and Eylem Ekici, Evangelos Papapetrou and Mihael Mohorcic, Evangelos Papapetrou and Ales Svigelj, Evangelos Papapetrou and Michael D. Bender, Evangelos Papapetrou and Stylianos Karapantazis, Evangelos Papapetrou and Zhaofeng Wu, Evangelos Papapetrou and Fenglin Jin, George Varghese and Zhaofeng Wu, Zhaofeng Wu and Ian F. Akyildiz, Zhaofeng Wu and Eylem Ekici, Zhaofeng Wu and Mihael Mohorcic, Zhaofeng Wu and Ales Svigelj, Zhaofeng Wu and Michael D. Bender, Zhaofeng Wu and Stylianos Karapantazis, Stylianos Karapantazis and Ian F. Akyildiz, Stylianos Karapantazis and Mihael Mohorcic, Stylianos Karapantazis and Ales Svigelj, Stylianos Karapantazis and Michael D. Bender, Stylianos Karapantazis and Fenglin Jin, Michael D. Bender and Ian F. Akyildiz, Michael D. Bender and Eylem Ekici, Michael D. Bender and Fenglin Jin, Eylem Ekici and Ian F. Akyildiz, Eylem Ekici and Fenglin Jin, Fenglin Jin and Ian F. Akyildiz, Fenglin Jin and Mihael Mohorcic, Fenglin Jin and Ales Svigelj, Ales Svigelj and Mihael Mohorcic.\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: Chengming Huang, Guang-hua Gao, Hai-Wei Sun, Zhi-zhong Sun, Kassem Mustapha, Guanrong Chen, Weihua Deng, Wanrong Cao, Seakweng Vong, Hong Li, Changpin Li, Zhibo Wang, Jingwei Deng, Chuanju Xu\n- Research collaborations between these authors: Chengming Huang and Wanrong Cao, Chengming Huang and Changpin Li, Chengming Huang and Weihua Deng, Guang-hua Gao and Hong Li, Guang-hua Gao and Zhi-zhong Sun, Guang-hua Gao and Zhibo Wang, Guang-hua Gao and Weihua Deng, Guang-hua Gao and Seakweng Vong, Guang-hua Gao and Chuanju Xu, Guang-hua Gao and Hai-Wei Sun, Hai-Wei Sun and Zhi-zhong Sun, Hai-Wei Sun and Zhibo Wang, Hai-Wei Sun and Weihua Deng, Hai-Wei Sun and Seakweng Vong, Hai-Wei Sun and Chuanju Xu, Zhi-zhong Sun and Hong Li, Zhi-zhong Sun and Changpin Li, Zhi-zhong Sun and Zhibo Wang, Zhi-zhong Sun and Weihua Deng, Zhi-zhong Sun and Seakweng Vong, Zhi-zhong Sun and Chuanju Xu, Zhi-zhong Sun and Kassem Mustapha, Kassem Mustapha and Chuanju Xu, Kassem Mustapha and Weihua Deng, Guanrong Chen and Changpin Li, Guanrong Chen and Weihua Deng, Weihua Deng and Hong Li, Weihua Deng and Jingwei Deng, Weihua Deng and Wanrong Cao, Weihua Deng and Changpin Li, Weihua Deng and Zhibo Wang, Weihua Deng and Chuanju Xu, Weihua Deng and Seakweng Vong, Seakweng Vong and Hong Li, Seakweng Vong and Zhibo Wang, Hong Li and Changpin Li, Hong Li and Zhibo Wang, Hong Li and Chuanju Xu, Changpin Li and Chuanju 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\": \"Chengming Huang\", \"id\": 479584}, {\"name\": \"Guang-hua Gao\", \"id\": 188099}, {\"name\": \"Hai-Wei Sun\", \"id\": 188100}, {\"name\": \"Kassem Mustapha\", \"id\": 271813}, {\"name\": \"Zhi-zhong Sun\", \"id\": 188101}, {\"name\": \"Guanrong Chen\", \"id\": 68359}, {\"name\": \"Weihua Deng\", \"id\": 354728}, {\"name\": \"Wanrong Cao\", \"id\": 201063}, {\"name\": \"Seakweng Vong\", \"id\": 407172}, {\"name\": \"Hong Li\", \"id\": 24684}, {\"name\": \"Changpin Li\", \"id\": 215964}, {\"name\": \"Zhibo Wang\", \"id\": 235261}, {\"name\": \"Jingwei Deng\", \"id\": 80158}, {\"name\": \"Chuanju Xu\", \"id\": 485471}], \"links\": [{\"source\": 479584, \"target\": 201063}, {\"source\": 479584, \"target\": 215964}, {\"source\": 479584, \"target\": 354728}, {\"source\": 188099, \"target\": 24684}, {\"source\": 188099, \"target\": 188101}, {\"source\": 188099, \"target\": 235261}, {\"source\": 188099, \"target\": 354728}, {\"source\": 188099, \"target\": 407172}, {\"source\": 188099, \"target\": 485471}, {\"source\": 188099, \"target\": 188100}, {\"source\": 188100, \"target\": 188101}, {\"source\": 188100, \"target\": 235261}, {\"source\": 188100, \"target\": 354728}, {\"source\": 188100, \"target\": 407172}, {\"source\": 188100, \"target\": 485471}, {\"source\": 271813, \"target\": 188101}, {\"source\": 271813, \"target\": 485471}, {\"source\": 271813, \"target\": 354728}, {\"source\": 188101, \"target\": 24684}, {\"source\": 188101, \"target\": 215964}, {\"source\": 188101, \"target\": 235261}, {\"source\": 188101, \"target\": 354728}, {\"source\": 188101, \"target\": 407172}, {\"source\": 188101, \"target\": 485471}, {\"source\": 68359, \"target\": 215964}, {\"source\": 68359, \"target\": 354728}, {\"source\": 354728, \"target\": 24684}, {\"source\": 354728, \"target\": 80158}, {\"source\": 354728, \"target\": 201063}, {\"source\": 354728, \"target\": 215964}, {\"source\": 354728, \"target\": 235261}, {\"source\": 354728, \"target\": 485471}, {\"source\": 354728, \"target\": 407172}, {\"source\": 407172, \"target\": 24684}, {\"source\": 407172, \"target\": 235261}, {\"source\": 24684, \"target\": 215964}, {\"source\": 24684, \"target\": 235261}, {\"source\": 24684, \"target\": 485471}, {\"source\": 215964, \"target\": 485471}]}",
"id": 1220,
"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: Chengming Huang, Guang-hua Gao, Hai-Wei Sun, Zhi-zhong Sun, Kassem Mustapha, Guanrong Chen, Weihua Deng, Wanrong Cao, Seakweng Vong, Hong Li, Changpin Li, Zhibo Wang, Jingwei Deng, Chuanju Xu\n- Research collaborations between these authors: Chengming Huang and Wanrong Cao, Chengming Huang and Changpin Li, Chengming Huang and Weihua Deng, Guang-hua Gao and Hong Li, Guang-hua Gao and Zhi-zhong Sun, Guang-hua Gao and Zhibo Wang, Guang-hua Gao and Weihua Deng, Guang-hua Gao and Seakweng Vong, Guang-hua Gao and Chuanju Xu, Guang-hua Gao and Hai-Wei Sun, Hai-Wei Sun and Zhi-zhong Sun, Hai-Wei Sun and Zhibo Wang, Hai-Wei Sun and Weihua Deng, Hai-Wei Sun and Seakweng Vong, Hai-Wei Sun and Chuanju Xu, Zhi-zhong Sun and Hong Li, Zhi-zhong Sun and Changpin Li, Zhi-zhong Sun and Zhibo Wang, Zhi-zhong Sun and Weihua Deng, Zhi-zhong Sun and Seakweng Vong, Zhi-zhong Sun and Chuanju Xu, Zhi-zhong Sun and Kassem Mustapha, Kassem Mustapha and Chuanju Xu, Kassem Mustapha and Weihua Deng, Guanrong Chen and Changpin Li, Guanrong Chen and Weihua Deng, Weihua Deng and Hong Li, Weihua Deng and Jingwei Deng, Weihua Deng and Wanrong Cao, Weihua Deng and Changpin Li, Weihua Deng and Zhibo Wang, Weihua Deng and Chuanju Xu, Weihua Deng and Seakweng Vong, Seakweng Vong and Hong Li, Seakweng Vong and Zhibo Wang, Hong Li and Changpin Li, Hong Li and Zhibo Wang, Hong Li and Chuanju Xu, Changpin Li and Chuanju 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: Chunming Qiao, Biswanath Mukherjee, Daniel S. Stevenson, Bing Xie, Jason P. Jue, Masahiko Jinno, Jie Zhang, Andrew Zisserman, Blanca Caminero, George N. Rouskas, Ioannis Tomkos, Nicolas Zufferey, Yang Chen, Y. V. Kiran\n- Research collaborations between these authors: Chunming Qiao and Yang Chen, Chunming Qiao and Jie Zhang, Chunming Qiao and Biswanath Mukherjee, Chunming Qiao and George N. Rouskas, Chunming Qiao and Jason P. Jue, Chunming Qiao and Ioannis Tomkos, Chunming Qiao and Y. V. Kiran, Biswanath Mukherjee and Jie Zhang, Biswanath Mukherjee and Jason P. Jue, Biswanath Mukherjee and Yang Chen, Biswanath Mukherjee and George N. Rouskas, Biswanath Mukherjee and Masahiko Jinno, Biswanath Mukherjee and Ioannis Tomkos, Daniel S. Stevenson and George N. Rouskas, Bing Xie and Jie Zhang, Bing Xie and Yang Chen, Jason P. Jue and Jie Zhang, Jason P. Jue and Yang Chen, Jason P. Jue and Ioannis Tomkos, Jason P. Jue and George N. Rouskas, Jason P. Jue and Masahiko Jinno, Masahiko Jinno and Jie Zhang, Masahiko Jinno and George N. Rouskas, Jie Zhang and Andrew Zisserman, Jie Zhang and Ioannis Tomkos, Blanca Caminero and George N. Rouskas, George N. Rouskas and Yang Chen, George N. Rouskas and Y. V. Kiran, Yang Chen and Y. V. Kiran.\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\": \"Chunming Qiao\", \"id\": 26048}, {\"name\": \"Biswanath Mukherjee\", \"id\": 130466}, {\"name\": \"Bing Xie\", \"id\": 27714}, {\"name\": \"Daniel S. Stevenson\", \"id\": 313218}, {\"name\": \"Jason P. Jue\", \"id\": 31461}, {\"name\": \"Masahiko Jinno\", \"id\": 538082}, {\"name\": \"Jie Zhang\", \"id\": 20835}, {\"name\": \"Andrew Zisserman\", \"id\": 62508}, {\"name\": \"Blanca Caminero\", \"id\": 238414}, {\"name\": \"George N. Rouskas\", \"id\": 132496}, {\"name\": \"Ioannis Tomkos\", \"id\": 132049}, {\"name\": \"Nicolas Zufferey\", \"id\": 201554}, {\"name\": \"Yang Chen\", \"id\": 16568}, {\"name\": \"Y. V. Kiran\", \"id\": 498911}], \"links\": [{\"source\": 26048, \"target\": 16568}, {\"source\": 26048, \"target\": 20835}, {\"source\": 26048, \"target\": 130466}, {\"source\": 26048, \"target\": 132496}, {\"source\": 26048, \"target\": 31461}, {\"source\": 26048, \"target\": 132049}, {\"source\": 26048, \"target\": 498911}, {\"source\": 130466, \"target\": 20835}, {\"source\": 130466, \"target\": 31461}, {\"source\": 130466, \"target\": 16568}, {\"source\": 130466, \"target\": 132496}, {\"source\": 130466, \"target\": 538082}, {\"source\": 130466, \"target\": 132049}, {\"source\": 27714, \"target\": 20835}, {\"source\": 27714, \"target\": 16568}, {\"source\": 313218, \"target\": 132496}, {\"source\": 31461, \"target\": 20835}, {\"source\": 31461, \"target\": 16568}, {\"source\": 31461, \"target\": 132049}, {\"source\": 31461, \"target\": 132496}, {\"source\": 31461, \"target\": 538082}, {\"source\": 538082, \"target\": 20835}, {\"source\": 538082, \"target\": 132496}, {\"source\": 20835, \"target\": 62508}, {\"source\": 20835, \"target\": 132049}, {\"source\": 238414, \"target\": 132496}, {\"source\": 132496, \"target\": 16568}, {\"source\": 132496, \"target\": 498911}, {\"source\": 16568, \"target\": 498911}]}",
"id": 2017,
"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: Chunming Qiao, Biswanath Mukherjee, Daniel S. Stevenson, Bing Xie, Jason P. Jue, Masahiko Jinno, Jie Zhang, Andrew Zisserman, Blanca Caminero, George N. Rouskas, Ioannis Tomkos, Nicolas Zufferey, Yang Chen, Y. V. Kiran\n- Research collaborations between these authors: Chunming Qiao and Yang Chen, Chunming Qiao and Jie Zhang, Chunming Qiao and Biswanath Mukherjee, Chunming Qiao and George N. Rouskas, Chunming Qiao and Jason P. Jue, Chunming Qiao and Ioannis Tomkos, Chunming Qiao and Y. V. Kiran, Biswanath Mukherjee and Jie Zhang, Biswanath Mukherjee and Jason P. Jue, Biswanath Mukherjee and Yang Chen, Biswanath Mukherjee and George N. Rouskas, Biswanath Mukherjee and Masahiko Jinno, Biswanath Mukherjee and Ioannis Tomkos, Daniel S. Stevenson and George N. Rouskas, Bing Xie and Jie Zhang, Bing Xie and Yang Chen, Jason P. Jue and Jie Zhang, Jason P. Jue and Yang Chen, Jason P. Jue and Ioannis Tomkos, Jason P. Jue and George N. Rouskas, Jason P. Jue and Masahiko Jinno, Masahiko Jinno and Jie Zhang, Masahiko Jinno and George N. Rouskas, Jie Zhang and Andrew Zisserman, Jie Zhang and Ioannis Tomkos, Blanca Caminero and George N. Rouskas, George N. Rouskas and Yang Chen, George N. Rouskas and Y. V. Kiran, Yang Chen and Y. V. Kiran.\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: Walter Daelemans, Efstathios Stamatatos, Jie Zhang, Shlomo Argamon, Antonio Theophilo, Upendra Sapkota, Rachel Greenstadt, Walter J. Scheirer, Nicu Sebe, Pradeep Varakantham, Moshe Koppel, Benno Stein, Hsinchun Chen, Bing Liu\n- Research collaborations between these authors: Walter Daelemans and Benno Stein, Walter Daelemans and Moshe Koppel, Walter Daelemans and Bing Liu, Walter Daelemans and Shlomo Argamon, Walter Daelemans and Efstathios Stamatatos, Walter Daelemans and Upendra Sapkota, Efstathios Stamatatos and Hsinchun Chen, Efstathios Stamatatos and Benno Stein, Efstathios Stamatatos and Bing Liu, Efstathios Stamatatos and Rachel Greenstadt, Efstathios Stamatatos and Moshe Koppel, Efstathios Stamatatos and Shlomo Argamon, Efstathios Stamatatos and Walter J. Scheirer, Efstathios Stamatatos and Upendra Sapkota, Efstathios Stamatatos and Antonio Theophilo, Jie Zhang and Bing Liu, Jie Zhang and Rachel Greenstadt, Shlomo Argamon and Hsinchun Chen, Shlomo Argamon and Benno Stein, Shlomo Argamon and Bing Liu, Shlomo Argamon and Rachel Greenstadt, Shlomo Argamon and Moshe Koppel, Shlomo Argamon and Upendra Sapkota, Antonio Theophilo and Rachel Greenstadt, Antonio Theophilo and Moshe Koppel, Antonio Theophilo and Walter J. Scheirer, Upendra Sapkota and Moshe Koppel, Rachel Greenstadt and Hsinchun Chen, Rachel Greenstadt and Moshe Koppel, Rachel Greenstadt and Pradeep Varakantham, Rachel Greenstadt and Walter J. Scheirer, Walter J. Scheirer and Moshe Koppel, Moshe Koppel and Hsinchun Chen, Moshe Koppel and Benno Stein, Moshe Koppel and Bing Liu, Benno Stein and Bing Liu, Hsinchun Chen and Bing Liu.\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\": \"Walter Daelemans\", \"id\": 35584}, {\"name\": \"Efstathios Stamatatos\", \"id\": 59842}, {\"name\": \"Jie Zhang\", \"id\": 20835}, {\"name\": \"Shlomo Argamon\", \"id\": 56645}, {\"name\": \"Antonio Theophilo\", \"id\": 1274217}, {\"name\": \"Upendra Sapkota\", \"id\": 325610}, {\"name\": \"Rachel Greenstadt\", \"id\": 15275}, {\"name\": \"Walter J. Scheirer\", \"id\": 185356}, {\"name\": \"Nicu Sebe\", \"id\": 111371}, {\"name\": \"Pradeep Varakantham\", \"id\": 59280}, {\"name\": \"Moshe Koppel\", \"id\": 22386}, {\"name\": \"Benno Stein\", \"id\": 2643}, {\"name\": \"Hsinchun Chen\", \"id\": 188}, {\"name\": \"Bing Liu\", \"id\": 9822}], \"links\": [{\"source\": 35584, \"target\": 2643}, {\"source\": 35584, \"target\": 22386}, {\"source\": 35584, \"target\": 9822}, {\"source\": 35584, \"target\": 56645}, {\"source\": 35584, \"target\": 59842}, {\"source\": 35584, \"target\": 325610}, {\"source\": 59842, \"target\": 188}, {\"source\": 59842, \"target\": 2643}, {\"source\": 59842, \"target\": 9822}, {\"source\": 59842, \"target\": 15275}, {\"source\": 59842, \"target\": 22386}, {\"source\": 59842, \"target\": 56645}, {\"source\": 59842, \"target\": 185356}, {\"source\": 59842, \"target\": 325610}, {\"source\": 59842, \"target\": 1274217}, {\"source\": 20835, \"target\": 9822}, {\"source\": 20835, \"target\": 15275}, {\"source\": 56645, \"target\": 188}, {\"source\": 56645, \"target\": 2643}, {\"source\": 56645, \"target\": 9822}, {\"source\": 56645, \"target\": 15275}, {\"source\": 56645, \"target\": 22386}, {\"source\": 56645, \"target\": 325610}, {\"source\": 1274217, \"target\": 15275}, {\"source\": 1274217, \"target\": 22386}, {\"source\": 1274217, \"target\": 185356}, {\"source\": 325610, \"target\": 22386}, {\"source\": 15275, \"target\": 188}, {\"source\": 15275, \"target\": 22386}, {\"source\": 15275, \"target\": 59280}, {\"source\": 15275, \"target\": 185356}, {\"source\": 185356, \"target\": 22386}, {\"source\": 22386, \"target\": 188}, {\"source\": 22386, \"target\": 2643}, {\"source\": 22386, \"target\": 9822}, {\"source\": 2643, \"target\": 9822}, {\"source\": 188, \"target\": 9822}]}",
"id": 567,
"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: Walter Daelemans, Efstathios Stamatatos, Jie Zhang, Shlomo Argamon, Antonio Theophilo, Upendra Sapkota, Rachel Greenstadt, Walter J. Scheirer, Nicu Sebe, Pradeep Varakantham, Moshe Koppel, Benno Stein, Hsinchun Chen, Bing Liu\n- Research collaborations between these authors: Walter Daelemans and Benno Stein, Walter Daelemans and Moshe Koppel, Walter Daelemans and Bing Liu, Walter Daelemans and Shlomo Argamon, Walter Daelemans and Efstathios Stamatatos, Walter Daelemans and Upendra Sapkota, Efstathios Stamatatos and Hsinchun Chen, Efstathios Stamatatos and Benno Stein, Efstathios Stamatatos and Bing Liu, Efstathios Stamatatos and Rachel Greenstadt, Efstathios Stamatatos and Moshe Koppel, Efstathios Stamatatos and Shlomo Argamon, Efstathios Stamatatos and Walter J. Scheirer, Efstathios Stamatatos and Upendra Sapkota, Efstathios Stamatatos and Antonio Theophilo, Jie Zhang and Bing Liu, Jie Zhang and Rachel Greenstadt, Shlomo Argamon and Hsinchun Chen, Shlomo Argamon and Benno Stein, Shlomo Argamon and Bing Liu, Shlomo Argamon and Rachel Greenstadt, Shlomo Argamon and Moshe Koppel, Shlomo Argamon and Upendra Sapkota, Antonio Theophilo and Rachel Greenstadt, Antonio Theophilo and Moshe Koppel, Antonio Theophilo and Walter J. Scheirer, Upendra Sapkota and Moshe Koppel, Rachel Greenstadt and Hsinchun Chen, Rachel Greenstadt and Moshe Koppel, Rachel Greenstadt and Pradeep Varakantham, Rachel Greenstadt and Walter J. Scheirer, Walter J. Scheirer and Moshe Koppel, Moshe Koppel and Hsinchun Chen, Moshe Koppel and Benno Stein, Moshe Koppel and Bing Liu, Benno Stein and Bing Liu, Hsinchun Chen and Bing Liu.\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: Ricardo S. Santos, Ilias Sakellariou, Konstantinos Rousis, Florentin Ipate, Marian Gheorghe, C. Natalie van der Wal, Petros Kefalas, Ioanna Stamatopoulou, José Neves, Ognen Paunovski, George Eleftherakis, Anthony J. Cowling, Goreti Marreiros, Carlos Ramos\n- Research collaborations between these authors: Ricardo S. Santos and Goreti Marreiros, Ricardo S. Santos and Carlos Ramos, Ricardo S. Santos and José Neves, Ricardo S. Santos and Ilias Sakellariou, Ricardo S. Santos and Petros Kefalas, Ricardo S. Santos and Ioanna Stamatopoulou, Ilias Sakellariou and Goreti Marreiros, Ilias Sakellariou and Carlos Ramos, Ilias Sakellariou and José Neves, Ilias Sakellariou and George Eleftherakis, Ilias Sakellariou and Petros Kefalas, Ilias Sakellariou and Ioanna Stamatopoulou, Ilias Sakellariou and C. Natalie van der Wal, Ilias Sakellariou and Marian Gheorghe, Konstantinos Rousis and Ognen Paunovski, Konstantinos Rousis and George Eleftherakis, Florentin Ipate and Anthony J. Cowling, Florentin Ipate and Marian Gheorghe, Florentin Ipate and Petros Kefalas, Marian Gheorghe and George Eleftherakis, Marian Gheorghe and Petros Kefalas, Marian Gheorghe and Ioanna Stamatopoulou, C. Natalie van der Wal and Petros Kefalas, C. Natalie van der Wal and Ioanna Stamatopoulou, Petros Kefalas and George Eleftherakis, Petros Kefalas and Goreti Marreiros, Petros Kefalas and Carlos Ramos, Petros Kefalas and José Neves, Petros Kefalas and Ioanna Stamatopoulou, Ioanna Stamatopoulou and George Eleftherakis, Ioanna Stamatopoulou and Goreti Marreiros, Ioanna Stamatopoulou and Carlos Ramos, Ioanna Stamatopoulou and José Neves, José Neves and Goreti Marreiros, José Neves and Carlos Ramos, Ognen Paunovski and George Eleftherakis, George Eleftherakis and Anthony J. Cowling, Goreti Marreiros and Carlos Ramos.\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\": \"Ricardo S. Santos\", \"id\": 75960}, {\"name\": \"Ilias Sakellariou\", \"id\": 45413}, {\"name\": \"Konstantinos Rousis\", \"id\": 127334}, {\"name\": \"Florentin Ipate\", \"id\": 36967}, {\"name\": \"Marian Gheorghe\", \"id\": 127146}, {\"name\": \"C. Natalie van der Wal\", \"id\": 114252}, {\"name\": \"Petros Kefalas\", \"id\": 95793}, {\"name\": \"Ioanna Stamatopoulou\", \"id\": 95795}, {\"name\": \"Anthony J. Cowling\", \"id\": 74266}, {\"name\": \"Ognen Paunovski\", \"id\": 74264}, {\"name\": \"George Eleftherakis\", \"id\": 74265}, {\"name\": \"Jos\\u00e9 Neves\", \"id\": 28314}, {\"name\": \"Goreti Marreiros\", \"id\": 317}, {\"name\": \"Carlos Ramos\", \"id\": 318}], \"links\": [{\"source\": 75960, \"target\": 317}, {\"source\": 75960, \"target\": 318}, {\"source\": 75960, \"target\": 28314}, {\"source\": 75960, \"target\": 45413}, {\"source\": 75960, \"target\": 95793}, {\"source\": 75960, \"target\": 95795}, {\"source\": 45413, \"target\": 317}, {\"source\": 45413, \"target\": 318}, {\"source\": 45413, \"target\": 28314}, {\"source\": 45413, \"target\": 74265}, {\"source\": 45413, \"target\": 95793}, {\"source\": 45413, \"target\": 95795}, {\"source\": 45413, \"target\": 114252}, {\"source\": 45413, \"target\": 127146}, {\"source\": 127334, \"target\": 74264}, {\"source\": 127334, \"target\": 74265}, {\"source\": 36967, \"target\": 74266}, {\"source\": 36967, \"target\": 127146}, {\"source\": 36967, \"target\": 95793}, {\"source\": 127146, \"target\": 74265}, {\"source\": 127146, \"target\": 95793}, {\"source\": 127146, \"target\": 95795}, {\"source\": 114252, \"target\": 95793}, {\"source\": 114252, \"target\": 95795}, {\"source\": 95793, \"target\": 74265}, {\"source\": 95793, \"target\": 317}, {\"source\": 95793, \"target\": 318}, {\"source\": 95793, \"target\": 28314}, {\"source\": 95793, \"target\": 95795}, {\"source\": 95795, \"target\": 74265}, {\"source\": 95795, \"target\": 317}, {\"source\": 95795, \"target\": 318}, {\"source\": 95795, \"target\": 28314}, {\"source\": 74266, \"target\": 74265}, {\"source\": 74264, \"target\": 74265}, {\"source\": 28314, \"target\": 317}, {\"source\": 28314, \"target\": 318}, {\"source\": 317, \"target\": 318}]}",
"id": 2039,
"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: Ricardo S. Santos, Ilias Sakellariou, Konstantinos Rousis, Florentin Ipate, Marian Gheorghe, C. Natalie van der Wal, Petros Kefalas, Ioanna Stamatopoulou, José Neves, Ognen Paunovski, George Eleftherakis, Anthony J. Cowling, Goreti Marreiros, Carlos Ramos\n- Research collaborations between these authors: Ricardo S. Santos and Goreti Marreiros, Ricardo S. Santos and Carlos Ramos, Ricardo S. Santos and José Neves, Ricardo S. Santos and Ilias Sakellariou, Ricardo S. Santos and Petros Kefalas, Ricardo S. Santos and Ioanna Stamatopoulou, Ilias Sakellariou and Goreti Marreiros, Ilias Sakellariou and Carlos Ramos, Ilias Sakellariou and José Neves, Ilias Sakellariou and George Eleftherakis, Ilias Sakellariou and Petros Kefalas, Ilias Sakellariou and Ioanna Stamatopoulou, Ilias Sakellariou and C. Natalie van der Wal, Ilias Sakellariou and Marian Gheorghe, Konstantinos Rousis and Ognen Paunovski, Konstantinos Rousis and George Eleftherakis, Florentin Ipate and Anthony J. Cowling, Florentin Ipate and Marian Gheorghe, Florentin Ipate and Petros Kefalas, Marian Gheorghe and George Eleftherakis, Marian Gheorghe and Petros Kefalas, Marian Gheorghe and Ioanna Stamatopoulou, C. Natalie van der Wal and Petros Kefalas, C. Natalie van der Wal and Ioanna Stamatopoulou, Petros Kefalas and George Eleftherakis, Petros Kefalas and Goreti Marreiros, Petros Kefalas and Carlos Ramos, Petros Kefalas and José Neves, Petros Kefalas and Ioanna Stamatopoulou, Ioanna Stamatopoulou and George Eleftherakis, Ioanna Stamatopoulou and Goreti Marreiros, Ioanna Stamatopoulou and Carlos Ramos, Ioanna Stamatopoulou and José Neves, José Neves and Goreti Marreiros, José Neves and Carlos Ramos, Ognen Paunovski and George Eleftherakis, George Eleftherakis and Anthony J. Cowling, Goreti Marreiros and Carlos Ramos.\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: German Rigau, Michael Roth, Ivan Titov, Marieke van Erp, Pierre Nugues, Marco Rospocher, Sanda M. Harabagiu, Love Hafdell, Mirella Lapata, Peter Exner, Martha Palmer, Itziar Aldabe, Piek Vossen, Mihai Surdeanu\n- Research collaborations between these authors: German Rigau and Martha Palmer, German Rigau and Marco Rospocher, German Rigau and Piek Vossen, German Rigau and Michael Roth, German Rigau and Mihai Surdeanu, German Rigau and Pierre Nugues, German Rigau and Itziar Aldabe, German Rigau and Love Hafdell, German Rigau and Marieke van Erp, Michael Roth and Mirella Lapata, Michael Roth and Martha Palmer, Michael Roth and Mihai Surdeanu, Michael Roth and Ivan Titov, Michael Roth and Pierre Nugues, Michael Roth and Love Hafdell, Ivan Titov and Mirella Lapata, Ivan Titov and Martha Palmer, Ivan Titov and Mihai Surdeanu, Ivan Titov and Pierre Nugues, Ivan Titov and Love Hafdell, Marieke van Erp and Piek Vossen, Marieke van Erp and Marco Rospocher, Marieke van Erp and Pierre Nugues, Marieke van Erp and Love Hafdell, Pierre Nugues and Mirella Lapata, Pierre Nugues and Marco Rospocher, Pierre Nugues and Piek Vossen, Pierre Nugues and Martha Palmer, Pierre Nugues and Mihai Surdeanu, Pierre Nugues and Peter Exner, Pierre Nugues and Love Hafdell, Pierre Nugues and Itziar Aldabe, Marco Rospocher and Piek Vossen, Marco Rospocher and Love Hafdell, Marco Rospocher and Itziar Aldabe, Sanda M. Harabagiu and Mirella Lapata, Sanda M. Harabagiu and Martha Palmer, Sanda M. Harabagiu and Mihai Surdeanu, Sanda M. Harabagiu and Piek Vossen, Love Hafdell and Mirella Lapata, Love Hafdell and Piek Vossen, Love Hafdell and Itziar Aldabe, Love Hafdell and Peter Exner, Mirella Lapata and Martha Palmer, Mirella Lapata and Mihai Surdeanu, Peter Exner and Martha Palmer, Peter Exner and Mihai Surdeanu, Martha Palmer and Mihai Surdeanu, Martha Palmer and Piek Vossen, Martha Palmer and Itziar Aldabe, Itziar Aldabe and Piek Vossen.\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\": \"Ivan Titov\", \"id\": 185731}, {\"name\": \"Michael Roth\", \"id\": 80964}, {\"name\": \"German Rigau\", \"id\": 4547}, {\"name\": \"Pierre Nugues\", \"id\": 208422}, {\"name\": \"Marieke van Erp\", \"id\": 266790}, {\"name\": \"Marco Rospocher\", \"id\": 12746}, {\"name\": \"Sanda M. Harabagiu\", \"id\": 24651}, {\"name\": \"Love Hafdell\", \"id\": 921780}, {\"name\": \"Mirella Lapata\", \"id\": 4054}, {\"name\": \"Peter Exner\", \"id\": 421785}, {\"name\": \"Martha Palmer\", \"id\": 5882}, {\"name\": \"Itziar Aldabe\", \"id\": 232827}, {\"name\": \"Piek Vossen\", \"id\": 44636}, {\"name\": \"Mihai Surdeanu\", \"id\": 116829}], \"links\": [{\"source\": 185731, \"target\": 4054}, {\"source\": 185731, \"target\": 5882}, {\"source\": 185731, \"target\": 80964}, {\"source\": 185731, \"target\": 116829}, {\"source\": 185731, \"target\": 208422}, {\"source\": 185731, \"target\": 921780}, {\"source\": 80964, \"target\": 4054}, {\"source\": 80964, \"target\": 4547}, {\"source\": 80964, \"target\": 5882}, {\"source\": 80964, \"target\": 116829}, {\"source\": 80964, \"target\": 208422}, {\"source\": 80964, \"target\": 921780}, {\"source\": 4547, \"target\": 5882}, {\"source\": 4547, \"target\": 12746}, {\"source\": 4547, \"target\": 44636}, {\"source\": 4547, \"target\": 116829}, {\"source\": 4547, \"target\": 208422}, {\"source\": 4547, \"target\": 232827}, {\"source\": 4547, \"target\": 921780}, {\"source\": 4547, \"target\": 266790}, {\"source\": 208422, \"target\": 4054}, {\"source\": 208422, \"target\": 12746}, {\"source\": 208422, \"target\": 44636}, {\"source\": 208422, \"target\": 5882}, {\"source\": 208422, \"target\": 116829}, {\"source\": 208422, \"target\": 421785}, {\"source\": 208422, \"target\": 921780}, {\"source\": 208422, \"target\": 232827}, {\"source\": 208422, \"target\": 266790}, {\"source\": 266790, \"target\": 44636}, {\"source\": 266790, \"target\": 12746}, {\"source\": 266790, \"target\": 921780}, {\"source\": 12746, \"target\": 44636}, {\"source\": 12746, \"target\": 921780}, {\"source\": 12746, \"target\": 232827}, {\"source\": 24651, \"target\": 4054}, {\"source\": 24651, \"target\": 5882}, {\"source\": 24651, \"target\": 116829}, {\"source\": 24651, \"target\": 44636}, {\"source\": 921780, \"target\": 4054}, {\"source\": 921780, \"target\": 44636}, {\"source\": 921780, \"target\": 232827}, {\"source\": 921780, \"target\": 421785}, {\"source\": 4054, \"target\": 5882}, {\"source\": 4054, \"target\": 116829}, {\"source\": 421785, \"target\": 5882}, {\"source\": 421785, \"target\": 116829}, {\"source\": 5882, \"target\": 116829}, {\"source\": 5882, \"target\": 44636}, {\"source\": 5882, \"target\": 232827}, {\"source\": 232827, \"target\": 44636}]}",
"id": 266,
"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: German Rigau, Michael Roth, Ivan Titov, Marieke van Erp, Pierre Nugues, Marco Rospocher, Sanda M. Harabagiu, Love Hafdell, Mirella Lapata, Peter Exner, Martha Palmer, Itziar Aldabe, Piek Vossen, Mihai Surdeanu\n- Research collaborations between these authors: German Rigau and Martha Palmer, German Rigau and Marco Rospocher, German Rigau and Piek Vossen, German Rigau and Michael Roth, German Rigau and Mihai Surdeanu, German Rigau and Pierre Nugues, German Rigau and Itziar Aldabe, German Rigau and Love Hafdell, German Rigau and Marieke van Erp, Michael Roth and Mirella Lapata, Michael Roth and Martha Palmer, Michael Roth and Mihai Surdeanu, Michael Roth and Ivan Titov, Michael Roth and Pierre Nugues, Michael Roth and Love Hafdell, Ivan Titov and Mirella Lapata, Ivan Titov and Martha Palmer, Ivan Titov and Mihai Surdeanu, Ivan Titov and Pierre Nugues, Ivan Titov and Love Hafdell, Marieke van Erp and Piek Vossen, Marieke van Erp and Marco Rospocher, Marieke van Erp and Pierre Nugues, Marieke van Erp and Love Hafdell, Pierre Nugues and Mirella Lapata, Pierre Nugues and Marco Rospocher, Pierre Nugues and Piek Vossen, Pierre Nugues and Martha Palmer, Pierre Nugues and Mihai Surdeanu, Pierre Nugues and Peter Exner, Pierre Nugues and Love Hafdell, Pierre Nugues and Itziar Aldabe, Marco Rospocher and Piek Vossen, Marco Rospocher and Love Hafdell, Marco Rospocher and Itziar Aldabe, Sanda M. Harabagiu and Mirella Lapata, Sanda M. Harabagiu and Martha Palmer, Sanda M. Harabagiu and Mihai Surdeanu, Sanda M. Harabagiu and Piek Vossen, Love Hafdell and Mirella Lapata, Love Hafdell and Piek Vossen, Love Hafdell and Itziar Aldabe, Love Hafdell and Peter Exner, Mirella Lapata and Martha Palmer, Mirella Lapata and Mihai Surdeanu, Peter Exner and Martha Palmer, Peter Exner and Mihai Surdeanu, Martha Palmer and Mihai Surdeanu, Martha Palmer and Piek Vossen, Martha Palmer and Itziar Aldabe, Itziar Aldabe and Piek Vossen.\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 E. Koditschek, Stanislav N. Gorb, Kendrick M. Shaw, Richard J. Bachmann, James Pluta, Roger D. Quinn, Kyu-Jin Cho, Ansgar Büschges, Dario Floreano, William A. Lewinger, Nicholas S. Szczecinski, Roy E. Ritzmann, Kathryn A. Daltorio, Ronald S. Fearing\n- Research collaborations between these authors: Daniel E. Koditschek and Richard J. Bachmann, Daniel E. Koditschek and Roger D. Quinn, Daniel E. Koditschek and Kathryn A. Daltorio, Daniel E. Koditschek and Ronald S. Fearing, Daniel E. Koditschek and Roy E. Ritzmann, Daniel E. Koditschek and Stanislav N. Gorb, Daniel E. Koditschek and William A. Lewinger, Stanislav N. Gorb and Roger D. Quinn, Stanislav N. Gorb and Kathryn A. Daltorio, Stanislav N. Gorb and Roy E. Ritzmann, Stanislav N. Gorb and Richard J. Bachmann, Kendrick M. Shaw and Roger D. Quinn, Kendrick M. Shaw and Kathryn A. Daltorio, Richard J. Bachmann and Roger D. Quinn, Richard J. Bachmann and Roy E. Ritzmann, Richard J. Bachmann and Kathryn A. Daltorio, Richard J. Bachmann and Dario Floreano, Richard J. Bachmann and William A. Lewinger, James Pluta and Roger D. Quinn, Roger D. Quinn and Kathryn A. Daltorio, Roger D. Quinn and Nicholas S. Szczecinski, Roger D. Quinn and Roy E. Ritzmann, Roger D. Quinn and Ansgar Büschges, Roger D. Quinn and William A. Lewinger, Roger D. Quinn and Kyu-Jin Cho, Roger D. Quinn and Ronald S. Fearing, Roger D. Quinn and Dario Floreano, Kyu-Jin Cho and Roy E. Ritzmann, Kyu-Jin Cho and Ronald S. Fearing, Kyu-Jin Cho and Dario Floreano, Dario Floreano and Ronald S. Fearing, William A. Lewinger and Nicholas S. Szczecinski, William A. Lewinger and Roy E. Ritzmann, Nicholas S. Szczecinski and Roy E. Ritzmann, Roy E. Ritzmann and Kathryn A. Daltorio, Roy E. Ritzmann and Ronald S. Fearing.\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\": \"Daniel E. Koditschek\", \"id\": 72448}, {\"name\": \"Stanislav N. Gorb\", \"id\": 354241}, {\"name\": \"Kendrick M. Shaw\", \"id\": 106592}, {\"name\": \"Richard J. Bachmann\", \"id\": 4673}, {\"name\": \"James Pluta\", \"id\": 4676}, {\"name\": \"Roger D. Quinn\", \"id\": 4681}, {\"name\": \"Kyu-Jin Cho\", \"id\": 120394}, {\"name\": \"Ansgar B\\u00fcschges\", \"id\": 602540}, {\"name\": \"Dario Floreano\", \"id\": 251342}, {\"name\": \"William A. Lewinger\", \"id\": 718068}, {\"name\": \"Nicholas S. Szczecinski\", \"id\": 142807}, {\"name\": \"Roy E. Ritzmann\", \"id\": 142808}, {\"name\": \"Kathryn A. Daltorio\", \"id\": 46938}, {\"name\": \"Ronald S. Fearing\", \"id\": 201595}], \"links\": [{\"source\": 72448, \"target\": 4673}, {\"source\": 72448, \"target\": 4681}, {\"source\": 72448, \"target\": 46938}, {\"source\": 72448, \"target\": 201595}, {\"source\": 72448, \"target\": 142808}, {\"source\": 72448, \"target\": 354241}, {\"source\": 72448, \"target\": 718068}, {\"source\": 354241, \"target\": 4681}, {\"source\": 354241, \"target\": 46938}, {\"source\": 354241, \"target\": 142808}, {\"source\": 354241, \"target\": 4673}, {\"source\": 106592, \"target\": 4681}, {\"source\": 106592, \"target\": 46938}, {\"source\": 4673, \"target\": 4681}, {\"source\": 4673, \"target\": 142808}, {\"source\": 4673, \"target\": 46938}, {\"source\": 4673, \"target\": 251342}, {\"source\": 4673, \"target\": 718068}, {\"source\": 4676, \"target\": 4681}, {\"source\": 4681, \"target\": 46938}, {\"source\": 4681, \"target\": 142807}, {\"source\": 4681, \"target\": 142808}, {\"source\": 4681, \"target\": 602540}, {\"source\": 4681, \"target\": 718068}, {\"source\": 4681, \"target\": 120394}, {\"source\": 4681, \"target\": 201595}, {\"source\": 4681, \"target\": 251342}, {\"source\": 120394, \"target\": 142808}, {\"source\": 120394, \"target\": 201595}, {\"source\": 120394, \"target\": 251342}, {\"source\": 251342, \"target\": 201595}, {\"source\": 718068, \"target\": 142807}, {\"source\": 718068, \"target\": 142808}, {\"source\": 142807, \"target\": 142808}, {\"source\": 142808, \"target\": 46938}, {\"source\": 142808, \"target\": 201595}]}",
"id": 1763,
"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 E. Koditschek, Stanislav N. Gorb, Kendrick M. Shaw, Richard J. Bachmann, James Pluta, Roger D. Quinn, Kyu-Jin Cho, Ansgar Büschges, Dario Floreano, William A. Lewinger, Nicholas S. Szczecinski, Roy E. Ritzmann, Kathryn A. Daltorio, Ronald S. Fearing\n- Research collaborations between these authors: Daniel E. Koditschek and Richard J. Bachmann, Daniel E. Koditschek and Roger D. Quinn, Daniel E. Koditschek and Kathryn A. Daltorio, Daniel E. Koditschek and Ronald S. Fearing, Daniel E. Koditschek and Roy E. Ritzmann, Daniel E. Koditschek and Stanislav N. Gorb, Daniel E. Koditschek and William A. Lewinger, Stanislav N. Gorb and Roger D. Quinn, Stanislav N. Gorb and Kathryn A. Daltorio, Stanislav N. Gorb and Roy E. Ritzmann, Stanislav N. Gorb and Richard J. Bachmann, Kendrick M. Shaw and Roger D. Quinn, Kendrick M. Shaw and Kathryn A. Daltorio, Richard J. Bachmann and Roger D. Quinn, Richard J. Bachmann and Roy E. Ritzmann, Richard J. Bachmann and Kathryn A. Daltorio, Richard J. Bachmann and Dario Floreano, Richard J. Bachmann and William A. Lewinger, James Pluta and Roger D. Quinn, Roger D. Quinn and Kathryn A. Daltorio, Roger D. Quinn and Nicholas S. Szczecinski, Roger D. Quinn and Roy E. Ritzmann, Roger D. Quinn and Ansgar Büschges, Roger D. Quinn and William A. Lewinger, Roger D. Quinn and Kyu-Jin Cho, Roger D. Quinn and Ronald S. Fearing, Roger D. Quinn and Dario Floreano, Kyu-Jin Cho and Roy E. Ritzmann, Kyu-Jin Cho and Ronald S. Fearing, Kyu-Jin Cho and Dario Floreano, Dario Floreano and Ronald S. Fearing, William A. Lewinger and Nicholas S. Szczecinski, William A. Lewinger and Roy E. Ritzmann, Nicholas S. Szczecinski and Roy E. Ritzmann, Roy E. Ritzmann and Kathryn A. Daltorio, Roy E. Ritzmann and Ronald S. Fearing.\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: Alvaro Araujo, Álvaro Araujo, David Fraga, Juan Carlos Vallejo, Dawn Xiaodong Song, José Manuel Moya, Juan-Mariano de Goyeneche, Pedro Malagón, Elias Z. Tragos, K. P. Subbalakshmi, Zorana Bankovic, Javier Blesa, Daniel Villanueva, Adrian Perrig\n- Research collaborations between these authors: Alvaro Araujo and Zorana Bankovic, Alvaro Araujo and José Manuel Moya, Alvaro Araujo and Elias Z. Tragos, Alvaro Araujo and David Fraga, Alvaro Araujo and Juan Carlos Vallejo, Alvaro Araujo and Adrian Perrig, Alvaro Araujo and Javier Blesa, Alvaro Araujo and Daniel Villanueva, Alvaro Araujo and Dawn Xiaodong Song, Alvaro Araujo and Pedro Malagón, Alvaro Araujo and Juan-Mariano de Goyeneche, Alvaro Araujo and Álvaro Araujo, Álvaro Araujo and Zorana Bankovic, Álvaro Araujo and José Manuel Moya, Álvaro Araujo and David Fraga, Álvaro Araujo and Juan Carlos Vallejo, Álvaro Araujo and Javier Blesa, Álvaro Araujo and Daniel Villanueva, Álvaro Araujo and Pedro Malagón, Álvaro Araujo and Juan-Mariano de Goyeneche, Álvaro Araujo and Adrian Perrig, Álvaro Araujo and Dawn Xiaodong Song, David Fraga and Zorana Bankovic, David Fraga and José Manuel Moya, David Fraga and Adrian Perrig, David Fraga and Juan Carlos Vallejo, David Fraga and Javier Blesa, David Fraga and Daniel Villanueva, David Fraga and Dawn Xiaodong Song, David Fraga and Pedro Malagón, David Fraga and Juan-Mariano de Goyeneche, Juan Carlos Vallejo and Zorana Bankovic, Juan Carlos Vallejo and José Manuel Moya, Juan Carlos Vallejo and Adrian Perrig, Juan Carlos Vallejo and Javier Blesa, Juan Carlos Vallejo and Daniel Villanueva, Juan Carlos Vallejo and Dawn Xiaodong Song, Juan Carlos Vallejo and Pedro Malagón, Juan Carlos Vallejo and Juan-Mariano de Goyeneche, Dawn Xiaodong Song and Adrian Perrig, Dawn Xiaodong Song and Zorana Bankovic, Dawn Xiaodong Song and José Manuel Moya, Dawn Xiaodong Song and Javier Blesa, Dawn Xiaodong Song and Daniel Villanueva, Dawn Xiaodong Song and Pedro Malagón, Dawn Xiaodong Song and Juan-Mariano de Goyeneche, José Manuel Moya and Zorana Bankovic, José Manuel Moya and Adrian Perrig, José Manuel Moya and Javier Blesa, José Manuel Moya and Daniel Villanueva, José Manuel Moya and Pedro Malagón, José Manuel Moya and Juan-Mariano de Goyeneche, Juan-Mariano de Goyeneche and Zorana Bankovic, Juan-Mariano de Goyeneche and Javier Blesa, Juan-Mariano de Goyeneche and Daniel Villanueva, Juan-Mariano de Goyeneche and Pedro Malagón, Juan-Mariano de Goyeneche and Adrian Perrig, Pedro Malagón and Zorana Bankovic, Pedro Malagón and Javier Blesa, Pedro Malagón and Daniel Villanueva, Pedro Malagón and Adrian Perrig, Elias Z. Tragos and K. P. Subbalakshmi, Elias Z. Tragos and Javier Blesa, Elias Z. Tragos and Daniel Villanueva, K. P. Subbalakshmi and Javier Blesa, Zorana Bankovic and Adrian Perrig, Zorana Bankovic and Javier Blesa, Zorana Bankovic and Daniel Villanueva, Javier Blesa and Adrian Perrig, Javier Blesa and Daniel Villanueva, Daniel Villanueva and Adrian Perrig.\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": 12,
"style": "rule"
}
|
{
"exact_answer": 12,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"\\u00c1lvaro Araujo\", \"id\": 324292}, {\"name\": \"David Fraga\", \"id\": 137324}, {\"name\": \"Juan Carlos Vallejo\", \"id\": 137325}, {\"name\": \"Dawn Xiaodong Song\", \"id\": 218768}, {\"name\": \"Adrian Perrig\", \"id\": 23549}, {\"name\": \"Jos\\u00e9 Manuel Moya\", \"id\": 48980}, {\"name\": \"Juan-Mariano de Goyeneche\", \"id\": 288053}, {\"name\": \"Pedro Malag\\u00f3n\", \"id\": 288052}, {\"name\": \"Elias Z. Tragos\", \"id\": 123255}, {\"name\": \"K. P. Subbalakshmi\", \"id\": 80084}, {\"name\": \"Zorana Bankovic\", \"id\": 28377}, {\"name\": \"Javier Blesa\", \"id\": 139739}, {\"name\": \"Daniel Villanueva\", \"id\": 139740}, {\"name\": \"Alvaro Araujo\", \"id\": 139741}], \"links\": [{\"source\": 324292, \"target\": 28377}, {\"source\": 324292, \"target\": 48980}, {\"source\": 324292, \"target\": 137324}, {\"source\": 324292, \"target\": 137325}, {\"source\": 324292, \"target\": 139739}, {\"source\": 324292, \"target\": 139740}, {\"source\": 324292, \"target\": 139741}, {\"source\": 324292, \"target\": 288052}, {\"source\": 324292, \"target\": 288053}, {\"source\": 324292, \"target\": 23549}, {\"source\": 324292, \"target\": 218768}, {\"source\": 137324, \"target\": 28377}, {\"source\": 137324, \"target\": 48980}, {\"source\": 137324, \"target\": 23549}, {\"source\": 137324, \"target\": 137325}, {\"source\": 137324, \"target\": 139739}, {\"source\": 137324, \"target\": 139740}, {\"source\": 137324, \"target\": 139741}, {\"source\": 137324, \"target\": 218768}, {\"source\": 137324, \"target\": 288052}, {\"source\": 137324, \"target\": 288053}, {\"source\": 137325, \"target\": 28377}, {\"source\": 137325, \"target\": 48980}, {\"source\": 137325, \"target\": 23549}, {\"source\": 137325, \"target\": 139739}, {\"source\": 137325, \"target\": 139740}, {\"source\": 137325, \"target\": 139741}, {\"source\": 137325, \"target\": 218768}, {\"source\": 137325, \"target\": 288052}, {\"source\": 137325, \"target\": 288053}, {\"source\": 218768, \"target\": 23549}, {\"source\": 218768, \"target\": 28377}, {\"source\": 218768, \"target\": 48980}, {\"source\": 218768, \"target\": 139739}, {\"source\": 218768, \"target\": 139740}, {\"source\": 218768, \"target\": 139741}, {\"source\": 218768, \"target\": 288052}, {\"source\": 218768, \"target\": 288053}, {\"source\": 23549, \"target\": 28377}, {\"source\": 23549, \"target\": 48980}, {\"source\": 23549, \"target\": 139739}, {\"source\": 23549, \"target\": 139740}, {\"source\": 23549, \"target\": 139741}, {\"source\": 23549, \"target\": 288052}, {\"source\": 23549, \"target\": 288053}, {\"source\": 48980, \"target\": 28377}, {\"source\": 48980, \"target\": 139739}, {\"source\": 48980, \"target\": 139740}, {\"source\": 48980, \"target\": 139741}, {\"source\": 48980, \"target\": 288052}, {\"source\": 48980, \"target\": 288053}, {\"source\": 288053, \"target\": 28377}, {\"source\": 288053, \"target\": 139739}, {\"source\": 288053, \"target\": 139740}, {\"source\": 288053, \"target\": 139741}, {\"source\": 288053, \"target\": 288052}, {\"source\": 288052, \"target\": 28377}, {\"source\": 288052, \"target\": 139739}, {\"source\": 288052, \"target\": 139740}, {\"source\": 288052, \"target\": 139741}, {\"source\": 123255, \"target\": 80084}, {\"source\": 123255, \"target\": 139739}, {\"source\": 123255, \"target\": 139740}, {\"source\": 123255, \"target\": 139741}, {\"source\": 80084, \"target\": 139739}, {\"source\": 28377, \"target\": 139739}, {\"source\": 28377, \"target\": 139740}, {\"source\": 28377, \"target\": 139741}, {\"source\": 139739, \"target\": 139740}, {\"source\": 139739, \"target\": 139741}, {\"source\": 139740, \"target\": 139741}]}",
"id": 1802,
"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: Alvaro Araujo, Álvaro Araujo, David Fraga, Juan Carlos Vallejo, Dawn Xiaodong Song, José Manuel Moya, Juan-Mariano de Goyeneche, Pedro Malagón, Elias Z. Tragos, K. P. Subbalakshmi, Zorana Bankovic, Javier Blesa, Daniel Villanueva, Adrian Perrig\n- Research collaborations between these authors: Alvaro Araujo and Zorana Bankovic, Alvaro Araujo and José Manuel Moya, Alvaro Araujo and Elias Z. Tragos, Alvaro Araujo and David Fraga, Alvaro Araujo and Juan Carlos Vallejo, Alvaro Araujo and Adrian Perrig, Alvaro Araujo and Javier Blesa, Alvaro Araujo and Daniel Villanueva, Alvaro Araujo and Dawn Xiaodong Song, Alvaro Araujo and Pedro Malagón, Alvaro Araujo and Juan-Mariano de Goyeneche, Alvaro Araujo and Álvaro Araujo, Álvaro Araujo and Zorana Bankovic, Álvaro Araujo and José Manuel Moya, Álvaro Araujo and David Fraga, Álvaro Araujo and Juan Carlos Vallejo, Álvaro Araujo and Javier Blesa, Álvaro Araujo and Daniel Villanueva, Álvaro Araujo and Pedro Malagón, Álvaro Araujo and Juan-Mariano de Goyeneche, Álvaro Araujo and Adrian Perrig, Álvaro Araujo and Dawn Xiaodong Song, David Fraga and Zorana Bankovic, David Fraga and José Manuel Moya, David Fraga and Adrian Perrig, David Fraga and Juan Carlos Vallejo, David Fraga and Javier Blesa, David Fraga and Daniel Villanueva, David Fraga and Dawn Xiaodong Song, David Fraga and Pedro Malagón, David Fraga and Juan-Mariano de Goyeneche, Juan Carlos Vallejo and Zorana Bankovic, Juan Carlos Vallejo and José Manuel Moya, Juan Carlos Vallejo and Adrian Perrig, Juan Carlos Vallejo and Javier Blesa, Juan Carlos Vallejo and Daniel Villanueva, Juan Carlos Vallejo and Dawn Xiaodong Song, Juan Carlos Vallejo and Pedro Malagón, Juan Carlos Vallejo and Juan-Mariano de Goyeneche, Dawn Xiaodong Song and Adrian Perrig, Dawn Xiaodong Song and Zorana Bankovic, Dawn Xiaodong Song and José Manuel Moya, Dawn Xiaodong Song and Javier Blesa, Dawn Xiaodong Song and Daniel Villanueva, Dawn Xiaodong Song and Pedro Malagón, Dawn Xiaodong Song and Juan-Mariano de Goyeneche, José Manuel Moya and Zorana Bankovic, José Manuel Moya and Adrian Perrig, José Manuel Moya and Javier Blesa, José Manuel Moya and Daniel Villanueva, José Manuel Moya and Pedro Malagón, José Manuel Moya and Juan-Mariano de Goyeneche, Juan-Mariano de Goyeneche and Zorana Bankovic, Juan-Mariano de Goyeneche and Javier Blesa, Juan-Mariano de Goyeneche and Daniel Villanueva, Juan-Mariano de Goyeneche and Pedro Malagón, Juan-Mariano de Goyeneche and Adrian Perrig, Pedro Malagón and Zorana Bankovic, Pedro Malagón and Javier Blesa, Pedro Malagón and Daniel Villanueva, Pedro Malagón and Adrian Perrig, Elias Z. Tragos and K. P. Subbalakshmi, Elias Z. Tragos and Javier Blesa, Elias Z. Tragos and Daniel Villanueva, K. P. Subbalakshmi and Javier Blesa, Zorana Bankovic and Adrian Perrig, Zorana Bankovic and Javier Blesa, Zorana Bankovic and Daniel Villanueva, Javier Blesa and Adrian Perrig, Javier Blesa and Daniel Villanueva, Daniel Villanueva and Adrian Perrig.\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: Kenneth F. Manly, William J. Bug, Nahum Kiryati, Glenn D. Rosen, Jonathan Nissanov, Carl Gustafson, Oleh J. Tretiak, Smadar Gefen, Elissa J. Chesler, Perry L. Miller, Louise Bertrand, Richard Baldock, Guangjie Feng, Robert W. Williams\n- Research collaborations between these authors: Kenneth F. Manly and Elissa J. Chesler, Kenneth F. Manly and William J. Bug, Kenneth F. Manly and Jonathan Nissanov, Kenneth F. Manly and Robert W. Williams, Kenneth F. Manly and Louise Bertrand, Kenneth F. Manly and Smadar Gefen, William J. Bug and Perry L. Miller, William J. Bug and Robert W. Williams, Nahum Kiryati and Carl Gustafson, Nahum Kiryati and Jonathan Nissanov, Nahum Kiryati and Louise Bertrand, Nahum Kiryati and Oleh J. Tretiak, Nahum Kiryati and Smadar Gefen, Glenn D. Rosen and Jonathan Nissanov, Glenn D. Rosen and Louise Bertrand, Glenn D. Rosen and Smadar Gefen, Jonathan Nissanov and Richard Baldock, Jonathan Nissanov and Carl Gustafson, Jonathan Nissanov and Robert W. Williams, Jonathan Nissanov and Guangjie Feng, Jonathan Nissanov and Louise Bertrand, Jonathan Nissanov and Oleh J. Tretiak, Jonathan Nissanov and Smadar Gefen, Carl Gustafson and Louise Bertrand, Carl Gustafson and Smadar Gefen, Oleh J. Tretiak and Louise Bertrand, Oleh J. Tretiak and Smadar Gefen, Smadar Gefen and Louise Bertrand, Smadar Gefen and Robert W. Williams, Elissa J. Chesler and Robert W. Williams, Perry L. Miller and Robert W. Williams, Louise Bertrand and Robert W. Williams, Richard Baldock and Guangjie Feng.\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\": \"Kenneth F. Manly\", \"id\": 638563}, {\"name\": \"Richard Baldock\", \"id\": 298749}, {\"name\": \"Nahum Kiryati\", \"id\": 214316}, {\"name\": \"Louise Bertrand\", \"id\": 709272}, {\"name\": \"Glenn D. Rosen\", \"id\": 956400}, {\"name\": \"Jonathan Nissanov\", \"id\": 369809}, {\"name\": \"Carl Gustafson\", \"id\": 369808}, {\"name\": \"Oleh J. Tretiak\", \"id\": 854579}, {\"name\": \"Smadar Gefen\", \"id\": 956404}, {\"name\": \"Elissa J. Chesler\", \"id\": 65712}, {\"name\": \"William J. Bug\", \"id\": 158168}, {\"name\": \"Perry L. Miller\", \"id\": 79933}, {\"name\": \"Guangjie Feng\", \"id\": 540542}, {\"name\": \"Robert W. Williams\", \"id\": 498015}], \"links\": [{\"source\": 638563, \"target\": 65712}, {\"source\": 638563, \"target\": 158168}, {\"source\": 638563, \"target\": 369809}, {\"source\": 638563, \"target\": 498015}, {\"source\": 638563, \"target\": 709272}, {\"source\": 638563, \"target\": 956404}, {\"source\": 298749, \"target\": 369809}, {\"source\": 298749, \"target\": 540542}, {\"source\": 214316, \"target\": 369808}, {\"source\": 214316, \"target\": 369809}, {\"source\": 214316, \"target\": 709272}, {\"source\": 214316, \"target\": 854579}, {\"source\": 214316, \"target\": 956404}, {\"source\": 709272, \"target\": 369809}, {\"source\": 709272, \"target\": 369808}, {\"source\": 709272, \"target\": 498015}, {\"source\": 709272, \"target\": 854579}, {\"source\": 709272, \"target\": 956400}, {\"source\": 709272, \"target\": 956404}, {\"source\": 956400, \"target\": 369809}, {\"source\": 956400, \"target\": 956404}, {\"source\": 369809, \"target\": 369808}, {\"source\": 369809, \"target\": 498015}, {\"source\": 369809, \"target\": 540542}, {\"source\": 369809, \"target\": 854579}, {\"source\": 369809, \"target\": 956404}, {\"source\": 369808, \"target\": 956404}, {\"source\": 854579, \"target\": 956404}, {\"source\": 956404, \"target\": 498015}, {\"source\": 65712, \"target\": 498015}, {\"source\": 158168, \"target\": 79933}, {\"source\": 158168, \"target\": 498015}, {\"source\": 79933, \"target\": 498015}]}",
"id": 357,
"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: Kenneth F. Manly, William J. Bug, Nahum Kiryati, Glenn D. Rosen, Jonathan Nissanov, Carl Gustafson, Oleh J. Tretiak, Smadar Gefen, Elissa J. Chesler, Perry L. Miller, Louise Bertrand, Richard Baldock, Guangjie Feng, Robert W. Williams\n- Research collaborations between these authors: Kenneth F. Manly and Elissa J. Chesler, Kenneth F. Manly and William J. Bug, Kenneth F. Manly and Jonathan Nissanov, Kenneth F. Manly and Robert W. Williams, Kenneth F. Manly and Louise Bertrand, Kenneth F. Manly and Smadar Gefen, William J. Bug and Perry L. Miller, William J. Bug and Robert W. Williams, Nahum Kiryati and Carl Gustafson, Nahum Kiryati and Jonathan Nissanov, Nahum Kiryati and Louise Bertrand, Nahum Kiryati and Oleh J. Tretiak, Nahum Kiryati and Smadar Gefen, Glenn D. Rosen and Jonathan Nissanov, Glenn D. Rosen and Louise Bertrand, Glenn D. Rosen and Smadar Gefen, Jonathan Nissanov and Richard Baldock, Jonathan Nissanov and Carl Gustafson, Jonathan Nissanov and Robert W. Williams, Jonathan Nissanov and Guangjie Feng, Jonathan Nissanov and Louise Bertrand, Jonathan Nissanov and Oleh J. Tretiak, Jonathan Nissanov and Smadar Gefen, Carl Gustafson and Louise Bertrand, Carl Gustafson and Smadar Gefen, Oleh J. Tretiak and Louise Bertrand, Oleh J. Tretiak and Smadar Gefen, Smadar Gefen and Louise Bertrand, Smadar Gefen and Robert W. Williams, Elissa J. Chesler and Robert W. Williams, Perry L. Miller and Robert W. Williams, Louise Bertrand and Robert W. Williams, Richard Baldock and Guangjie Feng.\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: Fei Wang, Lin Ma, Daigo Muramatsu, Alexander J. Smola, Xiaojing Zhao, Jing Liu, Giuseppe Amato, Shengjin Wang, Chao Liang, Jialie Shen, Francis R. Bach, Dacheng Tao, Xuelong Li, Cheng-Lin Liu\n- Research collaborations between these authors: Fei Wang and Dacheng Tao, Fei Wang and Xuelong Li, Fei Wang and Francis R. Bach, Fei Wang and Alexander J. Smola, Fei Wang and Cheng-Lin Liu, Lin Ma and Dacheng Tao, Lin Ma and Xuelong Li, Daigo Muramatsu and Dacheng Tao, Daigo Muramatsu and Xuelong Li, Alexander J. Smola and Jing Liu, Alexander J. Smola and Dacheng Tao, Alexander J. Smola and Xuelong Li, Alexander J. Smola and Francis R. Bach, Alexander J. Smola and Jialie Shen, Xiaojing Zhao and Dacheng Tao, Jing Liu and Dacheng Tao, Jing Liu and Xuelong Li, Jing Liu and Francis R. Bach, Jing Liu and Chao Liang, Shengjin Wang and Dacheng Tao, Shengjin Wang and Xuelong Li, Shengjin Wang and Chao Liang, Chao Liang and Dacheng Tao, Chao Liang and Xuelong Li, Jialie Shen and Dacheng Tao, Jialie Shen and Xuelong Li, Jialie Shen and Francis R. Bach, Francis R. Bach and Dacheng Tao, Francis R. Bach and Xuelong Li, Francis R. Bach and Cheng-Lin Liu, Dacheng Tao and Xuelong Li, Dacheng Tao and Cheng-Lin Liu, Xuelong Li and Cheng-Lin Liu.\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\": \"Fei Wang\", \"id\": 6017}, {\"name\": \"Lin Ma\", \"id\": 24132}, {\"name\": \"Daigo Muramatsu\", \"id\": 172039}, {\"name\": \"Alexander J. Smola\", \"id\": 32296}, {\"name\": \"Xiaojing Zhao\", \"id\": 715017}, {\"name\": \"Giuseppe Amato\", \"id\": 19209}, {\"name\": \"Shengjin Wang\", \"id\": 34156}, {\"name\": \"Chao Liang\", \"id\": 85807}, {\"name\": \"Jialie Shen\", \"id\": 34867}, {\"name\": \"Francis R. Bach\", \"id\": 24723}, {\"name\": \"Xuelong Li\", \"id\": 23931}, {\"name\": \"Dacheng Tao\", \"id\": 14041}, {\"name\": \"Jing Liu\", \"id\": 8283}, {\"name\": \"Cheng-Lin Liu\", \"id\": 60607}], \"links\": [{\"source\": 6017, \"target\": 14041}, {\"source\": 6017, \"target\": 23931}, {\"source\": 6017, \"target\": 24723}, {\"source\": 6017, \"target\": 32296}, {\"source\": 6017, \"target\": 60607}, {\"source\": 24132, \"target\": 14041}, {\"source\": 24132, \"target\": 23931}, {\"source\": 172039, \"target\": 14041}, {\"source\": 172039, \"target\": 23931}, {\"source\": 32296, \"target\": 8283}, {\"source\": 32296, \"target\": 14041}, {\"source\": 32296, \"target\": 23931}, {\"source\": 32296, \"target\": 24723}, {\"source\": 32296, \"target\": 34867}, {\"source\": 715017, \"target\": 14041}, {\"source\": 34156, \"target\": 14041}, {\"source\": 34156, \"target\": 23931}, {\"source\": 34156, \"target\": 85807}, {\"source\": 85807, \"target\": 8283}, {\"source\": 85807, \"target\": 14041}, {\"source\": 85807, \"target\": 23931}, {\"source\": 34867, \"target\": 14041}, {\"source\": 34867, \"target\": 23931}, {\"source\": 34867, \"target\": 24723}, {\"source\": 24723, \"target\": 8283}, {\"source\": 24723, \"target\": 14041}, {\"source\": 24723, \"target\": 23931}, {\"source\": 24723, \"target\": 60607}, {\"source\": 23931, \"target\": 8283}, {\"source\": 23931, \"target\": 14041}, {\"source\": 23931, \"target\": 60607}, {\"source\": 14041, \"target\": 8283}, {\"source\": 14041, \"target\": 60607}]}",
"id": 225,
"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: Fei Wang, Lin Ma, Daigo Muramatsu, Alexander J. Smola, Xiaojing Zhao, Jing Liu, Giuseppe Amato, Shengjin Wang, Chao Liang, Jialie Shen, Francis R. Bach, Dacheng Tao, Xuelong Li, Cheng-Lin Liu\n- Research collaborations between these authors: Fei Wang and Dacheng Tao, Fei Wang and Xuelong Li, Fei Wang and Francis R. Bach, Fei Wang and Alexander J. Smola, Fei Wang and Cheng-Lin Liu, Lin Ma and Dacheng Tao, Lin Ma and Xuelong Li, Daigo Muramatsu and Dacheng Tao, Daigo Muramatsu and Xuelong Li, Alexander J. Smola and Jing Liu, Alexander J. Smola and Dacheng Tao, Alexander J. Smola and Xuelong Li, Alexander J. Smola and Francis R. Bach, Alexander J. Smola and Jialie Shen, Xiaojing Zhao and Dacheng Tao, Jing Liu and Dacheng Tao, Jing Liu and Xuelong Li, Jing Liu and Francis R. Bach, Jing Liu and Chao Liang, Shengjin Wang and Dacheng Tao, Shengjin Wang and Xuelong Li, Shengjin Wang and Chao Liang, Chao Liang and Dacheng Tao, Chao Liang and Xuelong Li, Jialie Shen and Dacheng Tao, Jialie Shen and Xuelong Li, Jialie Shen and Francis R. Bach, Francis R. Bach and Dacheng Tao, Francis R. Bach and Xuelong Li, Francis R. Bach and Cheng-Lin Liu, Dacheng Tao and Xuelong Li, Dacheng Tao and Cheng-Lin Liu, Xuelong Li and Cheng-Lin Liu.\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: Riccardo Bellazzi, Isabelle Bichindaritz, Petra Perner, Mobyen Uddin Ahmed, Peter J. Whitehouse, David McSherry, Peter Funk, Paolo Magni, Bo von Schéele, Ning Xiong, Horst Perner, Luigi Portinale, Shaibal Barua, Stefania Montani\n- Research collaborations between these authors: Riccardo Bellazzi and Stefania Montani, Riccardo Bellazzi and Paolo Magni, Riccardo Bellazzi and Luigi Portinale, Riccardo Bellazzi and Isabelle Bichindaritz, Riccardo Bellazzi and Peter Funk, Riccardo Bellazzi and Ning Xiong, Riccardo Bellazzi and Mobyen Uddin Ahmed, Riccardo Bellazzi and Bo von Schéele, Isabelle Bichindaritz and Stefania Montani, Isabelle Bichindaritz and Peter Funk, Isabelle Bichindaritz and Ning Xiong, Isabelle Bichindaritz and Petra Perner, Isabelle Bichindaritz and Luigi Portinale, Isabelle Bichindaritz and Mobyen Uddin Ahmed, Petra Perner and Stefania Montani, Petra Perner and Peter Funk, Petra Perner and Ning Xiong, Petra Perner and Mobyen Uddin Ahmed, Petra Perner and Horst Perner, Petra Perner and Bo von Schéele, Mobyen Uddin Ahmed and Peter Funk, Mobyen Uddin Ahmed and Ning Xiong, Mobyen Uddin Ahmed and Stefania Montani, Mobyen Uddin Ahmed and Luigi Portinale, Mobyen Uddin Ahmed and Horst Perner, Mobyen Uddin Ahmed and Bo von Schéele, Mobyen Uddin Ahmed and Shaibal Barua, Peter J. Whitehouse and Stefania Montani, Peter J. Whitehouse and Peter Funk, Peter J. Whitehouse and Ning Xiong, Peter J. Whitehouse and Bo von Schéele, David McSherry and Stefania Montani, David McSherry and Peter Funk, David McSherry and Ning Xiong, Peter Funk and Stefania Montani, Peter Funk and Ning Xiong, Peter Funk and Paolo Magni, Peter Funk and Luigi Portinale, Peter Funk and Horst Perner, Peter Funk and Bo von Schéele, Peter Funk and Shaibal Barua, Paolo Magni and Stefania Montani, Paolo Magni and Ning Xiong, Paolo Magni and Luigi Portinale, Paolo Magni and Bo von Schéele, Bo von Schéele and Stefania Montani, Bo von Schéele and Ning Xiong, Bo von Schéele and Luigi Portinale, Bo von Schéele and Shaibal Barua, Bo von Schéele and Horst Perner, Ning Xiong and Stefania Montani, Ning Xiong and Luigi Portinale, Ning Xiong and Horst Perner, Ning Xiong and Shaibal Barua, Luigi Portinale and Stefania Montani.\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\": \"Riccardo Bellazzi\", \"id\": 8033}, {\"name\": \"Isabelle Bichindaritz\", \"id\": 35363}, {\"name\": \"Petra Perner\", \"id\": 100293}, {\"name\": \"Mobyen Uddin Ahmed\", \"id\": 65318}, {\"name\": \"Peter J. Whitehouse\", \"id\": 440392}, {\"name\": \"David McSherry\", \"id\": 9650}, {\"name\": \"Peter Funk\", \"id\": 54772}, {\"name\": \"Paolo Magni\", \"id\": 96373}, {\"name\": \"Bo von Sch\\u00e9ele\", \"id\": 423126}, {\"name\": \"Ning Xiong\", \"id\": 54774}, {\"name\": \"Horst Perner\", \"id\": 157880}, {\"name\": \"Luigi Portinale\", \"id\": 135513}, {\"name\": \"Shaibal Barua\", \"id\": 193211}, {\"name\": \"Stefania Montani\", \"id\": 4575}], \"links\": [{\"source\": 8033, \"target\": 4575}, {\"source\": 8033, \"target\": 96373}, {\"source\": 8033, \"target\": 135513}, {\"source\": 8033, \"target\": 35363}, {\"source\": 8033, \"target\": 54772}, {\"source\": 8033, \"target\": 54774}, {\"source\": 8033, \"target\": 65318}, {\"source\": 8033, \"target\": 423126}, {\"source\": 35363, \"target\": 4575}, {\"source\": 35363, \"target\": 54772}, {\"source\": 35363, \"target\": 54774}, {\"source\": 35363, \"target\": 100293}, {\"source\": 35363, \"target\": 135513}, {\"source\": 35363, \"target\": 65318}, {\"source\": 100293, \"target\": 4575}, {\"source\": 100293, \"target\": 54772}, {\"source\": 100293, \"target\": 54774}, {\"source\": 100293, \"target\": 65318}, {\"source\": 100293, \"target\": 157880}, {\"source\": 100293, \"target\": 423126}, {\"source\": 65318, \"target\": 54772}, {\"source\": 65318, \"target\": 54774}, {\"source\": 65318, \"target\": 4575}, {\"source\": 65318, \"target\": 135513}, {\"source\": 65318, \"target\": 157880}, {\"source\": 65318, \"target\": 423126}, {\"source\": 65318, \"target\": 193211}, {\"source\": 440392, \"target\": 4575}, {\"source\": 440392, \"target\": 54772}, {\"source\": 440392, \"target\": 54774}, {\"source\": 440392, \"target\": 423126}, {\"source\": 9650, \"target\": 4575}, {\"source\": 9650, \"target\": 54772}, {\"source\": 9650, \"target\": 54774}, {\"source\": 54772, \"target\": 4575}, {\"source\": 54772, \"target\": 54774}, {\"source\": 54772, \"target\": 96373}, {\"source\": 54772, \"target\": 135513}, {\"source\": 54772, \"target\": 157880}, {\"source\": 54772, \"target\": 423126}, {\"source\": 54772, \"target\": 193211}, {\"source\": 96373, \"target\": 4575}, {\"source\": 96373, \"target\": 54774}, {\"source\": 96373, \"target\": 135513}, {\"source\": 96373, \"target\": 423126}, {\"source\": 423126, \"target\": 4575}, {\"source\": 423126, \"target\": 54774}, {\"source\": 423126, \"target\": 135513}, {\"source\": 423126, \"target\": 193211}, {\"source\": 423126, \"target\": 157880}, {\"source\": 54774, \"target\": 4575}, {\"source\": 54774, \"target\": 135513}, {\"source\": 54774, \"target\": 157880}, {\"source\": 54774, \"target\": 193211}, {\"source\": 135513, \"target\": 4575}]}",
"id": 2763,
"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: Riccardo Bellazzi, Isabelle Bichindaritz, Petra Perner, Mobyen Uddin Ahmed, Peter J. Whitehouse, David McSherry, Peter Funk, Paolo Magni, Bo von Schéele, Ning Xiong, Horst Perner, Luigi Portinale, Shaibal Barua, Stefania Montani\n- Research collaborations between these authors: Riccardo Bellazzi and Stefania Montani, Riccardo Bellazzi and Paolo Magni, Riccardo Bellazzi and Luigi Portinale, Riccardo Bellazzi and Isabelle Bichindaritz, Riccardo Bellazzi and Peter Funk, Riccardo Bellazzi and Ning Xiong, Riccardo Bellazzi and Mobyen Uddin Ahmed, Riccardo Bellazzi and Bo von Schéele, Isabelle Bichindaritz and Stefania Montani, Isabelle Bichindaritz and Peter Funk, Isabelle Bichindaritz and Ning Xiong, Isabelle Bichindaritz and Petra Perner, Isabelle Bichindaritz and Luigi Portinale, Isabelle Bichindaritz and Mobyen Uddin Ahmed, Petra Perner and Stefania Montani, Petra Perner and Peter Funk, Petra Perner and Ning Xiong, Petra Perner and Mobyen Uddin Ahmed, Petra Perner and Horst Perner, Petra Perner and Bo von Schéele, Mobyen Uddin Ahmed and Peter Funk, Mobyen Uddin Ahmed and Ning Xiong, Mobyen Uddin Ahmed and Stefania Montani, Mobyen Uddin Ahmed and Luigi Portinale, Mobyen Uddin Ahmed and Horst Perner, Mobyen Uddin Ahmed and Bo von Schéele, Mobyen Uddin Ahmed and Shaibal Barua, Peter J. Whitehouse and Stefania Montani, Peter J. Whitehouse and Peter Funk, Peter J. Whitehouse and Ning Xiong, Peter J. Whitehouse and Bo von Schéele, David McSherry and Stefania Montani, David McSherry and Peter Funk, David McSherry and Ning Xiong, Peter Funk and Stefania Montani, Peter Funk and Ning Xiong, Peter Funk and Paolo Magni, Peter Funk and Luigi Portinale, Peter Funk and Horst Perner, Peter Funk and Bo von Schéele, Peter Funk and Shaibal Barua, Paolo Magni and Stefania Montani, Paolo Magni and Ning Xiong, Paolo Magni and Luigi Portinale, Paolo Magni and Bo von Schéele, Bo von Schéele and Stefania Montani, Bo von Schéele and Ning Xiong, Bo von Schéele and Luigi Portinale, Bo von Schéele and Shaibal Barua, Bo von Schéele and Horst Perner, Ning Xiong and Stefania Montani, Ning Xiong and Luigi Portinale, Ning Xiong and Horst Perner, Ning Xiong and Shaibal Barua, Luigi Portinale and Stefania Montani.\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: See-Kiong Ng, Jianxin Wang, Yuping Wang, Min Li, Fang-Xiang Wu, Jianer Chen, Hans-Werner Mewes, Bahriye Basturk, Ulrich Güldener, Xiujuan Lei, Dervis Karaboga, Junzhong Ji, Nurhan Karaboga, J. De Montigny\n- Research collaborations between these authors: See-Kiong Ng and Min Li, See-Kiong Ng and Fang-Xiang Wu, See-Kiong Ng and Hans-Werner Mewes, See-Kiong Ng and Jianxin Wang, See-Kiong Ng and Xiujuan Lei, Jianxin Wang and Jianer Chen, Jianxin Wang and Min Li, Jianxin Wang and Fang-Xiang Wu, Jianxin Wang and Hans-Werner Mewes, Jianxin Wang and Ulrich Güldener, Jianxin Wang and Xiujuan Lei, Yuping Wang and Xiujuan Lei, Min Li and Jianer Chen, Min Li and Fang-Xiang Wu, Min Li and Hans-Werner Mewes, Min Li and Ulrich Güldener, Min Li and Xiujuan Lei, Fang-Xiang Wu and Jianer Chen, Fang-Xiang Wu and Hans-Werner Mewes, Fang-Xiang Wu and Xiujuan Lei, Fang-Xiang Wu and Ulrich Güldener, Jianer Chen and Hans-Werner Mewes, Jianer Chen and Ulrich Güldener, Jianer Chen and Xiujuan Lei, Hans-Werner Mewes and Junzhong Ji, Hans-Werner Mewes and Ulrich Güldener, Hans-Werner Mewes and J. De Montigny, Hans-Werner Mewes and Xiujuan Lei, Bahriye Basturk and Dervis Karaboga, Bahriye Basturk and Xiujuan Lei, Bahriye Basturk and Nurhan Karaboga, Ulrich Güldener and Junzhong Ji, Ulrich Güldener and Xiujuan Lei, Xiujuan Lei and Junzhong Ji, Xiujuan Lei and Dervis Karaboga, Xiujuan Lei and J. De Montigny, Xiujuan Lei and Nurhan Karaboga, Dervis Karaboga and Nurhan Karaboga.\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\": \"See-Kiong Ng\", \"id\": 15074}, {\"name\": \"Jianxin Wang\", \"id\": 66339}, {\"name\": \"Yuping Wang\", \"id\": 64581}, {\"name\": \"Min Li\", \"id\": 8583}, {\"name\": \"Fang-Xiang Wu\", \"id\": 8584}, {\"name\": \"Jianer Chen\", \"id\": 1482}, {\"name\": \"Hans-Werner Mewes\", \"id\": 105548}, {\"name\": \"Bahriye Basturk\", \"id\": 1077325}, {\"name\": \"Ulrich G\\u00fcldener\", \"id\": 279566}, {\"name\": \"Xiujuan Lei\", \"id\": 110580}, {\"name\": \"Junzhong Ji\", \"id\": 75736}, {\"name\": \"Dervis Karaboga\", \"id\": 87960}, {\"name\": \"Nurhan Karaboga\", \"id\": 272058}, {\"name\": \"J. De Montigny\", \"id\": 279581}], \"links\": [{\"source\": 15074, \"target\": 8583}, {\"source\": 15074, \"target\": 8584}, {\"source\": 15074, \"target\": 105548}, {\"source\": 15074, \"target\": 66339}, {\"source\": 15074, \"target\": 110580}, {\"source\": 66339, \"target\": 1482}, {\"source\": 66339, \"target\": 8583}, {\"source\": 66339, \"target\": 8584}, {\"source\": 66339, \"target\": 105548}, {\"source\": 66339, \"target\": 279566}, {\"source\": 66339, \"target\": 110580}, {\"source\": 64581, \"target\": 110580}, {\"source\": 8583, \"target\": 1482}, {\"source\": 8583, \"target\": 8584}, {\"source\": 8583, \"target\": 105548}, {\"source\": 8583, \"target\": 279566}, {\"source\": 8583, \"target\": 110580}, {\"source\": 8584, \"target\": 1482}, {\"source\": 8584, \"target\": 105548}, {\"source\": 8584, \"target\": 110580}, {\"source\": 8584, \"target\": 279566}, {\"source\": 1482, \"target\": 105548}, {\"source\": 1482, \"target\": 279566}, {\"source\": 1482, \"target\": 110580}, {\"source\": 105548, \"target\": 75736}, {\"source\": 105548, \"target\": 279566}, {\"source\": 105548, \"target\": 279581}, {\"source\": 105548, \"target\": 110580}, {\"source\": 1077325, \"target\": 87960}, {\"source\": 1077325, \"target\": 110580}, {\"source\": 1077325, \"target\": 272058}, {\"source\": 279566, \"target\": 75736}, {\"source\": 279566, \"target\": 110580}, {\"source\": 110580, \"target\": 75736}, {\"source\": 110580, \"target\": 87960}, {\"source\": 110580, \"target\": 279581}, {\"source\": 110580, \"target\": 272058}, {\"source\": 87960, \"target\": 272058}]}",
"id": 52,
"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: See-Kiong Ng, Jianxin Wang, Yuping Wang, Min Li, Fang-Xiang Wu, Jianer Chen, Hans-Werner Mewes, Bahriye Basturk, Ulrich Güldener, Xiujuan Lei, Dervis Karaboga, Junzhong Ji, Nurhan Karaboga, J. De Montigny\n- Research collaborations between these authors: See-Kiong Ng and Min Li, See-Kiong Ng and Fang-Xiang Wu, See-Kiong Ng and Hans-Werner Mewes, See-Kiong Ng and Jianxin Wang, See-Kiong Ng and Xiujuan Lei, Jianxin Wang and Jianer Chen, Jianxin Wang and Min Li, Jianxin Wang and Fang-Xiang Wu, Jianxin Wang and Hans-Werner Mewes, Jianxin Wang and Ulrich Güldener, Jianxin Wang and Xiujuan Lei, Yuping Wang and Xiujuan Lei, Min Li and Jianer Chen, Min Li and Fang-Xiang Wu, Min Li and Hans-Werner Mewes, Min Li and Ulrich Güldener, Min Li and Xiujuan Lei, Fang-Xiang Wu and Jianer Chen, Fang-Xiang Wu and Hans-Werner Mewes, Fang-Xiang Wu and Xiujuan Lei, Fang-Xiang Wu and Ulrich Güldener, Jianer Chen and Hans-Werner Mewes, Jianer Chen and Ulrich Güldener, Jianer Chen and Xiujuan Lei, Hans-Werner Mewes and Junzhong Ji, Hans-Werner Mewes and Ulrich Güldener, Hans-Werner Mewes and J. De Montigny, Hans-Werner Mewes and Xiujuan Lei, Bahriye Basturk and Dervis Karaboga, Bahriye Basturk and Xiujuan Lei, Bahriye Basturk and Nurhan Karaboga, Ulrich Güldener and Junzhong Ji, Ulrich Güldener and Xiujuan Lei, Xiujuan Lei and Junzhong Ji, Xiujuan Lei and Dervis Karaboga, Xiujuan Lei and J. De Montigny, Xiujuan Lei and Nurhan Karaboga, Dervis Karaboga and Nurhan Karaboga.\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: Mei-Qun Jiang, Mário A. T. Figueiredo, Michael K. Ng, Liqun Qi, Zeng-Qi Wang, Changfeng Ma, Yang Cao, Xian-Sheng Hua, Howard C. Elman, Zhaolin Jiang, Lizhen Shao, Zhong-Zhi Bai, Valeria Simoncini, Yimin Wei\n- Research collaborations between these authors: Mei-Qun Jiang and Yang Cao, Mei-Qun Jiang and Changfeng Ma, Mei-Qun Jiang and Michael K. Ng, Mei-Qun Jiang and Zhong-Zhi Bai, Mei-Qun Jiang and Zeng-Qi Wang, Mário A. T. Figueiredo and Michael K. Ng, Michael K. Ng and Xian-Sheng Hua, Michael K. Ng and Zhong-Zhi Bai, Michael K. Ng and Liqun Qi, Michael K. Ng and Yang Cao, Michael K. Ng and Yimin Wei, Michael K. Ng and Zhaolin Jiang, Michael K. Ng and Changfeng Ma, Liqun Qi and Yimin Wei, Liqun Qi and Changfeng Ma, Zeng-Qi Wang and Zhong-Zhi Bai, Zeng-Qi Wang and Yang Cao, Zeng-Qi Wang and Changfeng Ma, Changfeng Ma and Zhong-Zhi Bai, Changfeng Ma and Yang Cao, Changfeng Ma and Yimin Wei, Changfeng Ma and Howard C. Elman, Yang Cao and Xian-Sheng Hua, Yang Cao and Zhong-Zhi Bai, Howard C. Elman and Zhong-Zhi Bai, Howard C. Elman and Valeria Simoncini, Zhaolin Jiang and Zhong-Zhi Bai, Zhong-Zhi Bai and Valeria Simoncini, Zhong-Zhi Bai and Yimin Wei.\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\": \"Mei-Qun Jiang\", \"id\": 580513}, {\"name\": \"M\\u00e1rio A. T. Figueiredo\", \"id\": 24226}, {\"name\": \"Zeng-Qi Wang\", \"id\": 912741}, {\"name\": \"Michael K. Ng\", \"id\": 45253}, {\"name\": \"Liqun Qi\", \"id\": 139429}, {\"name\": \"Changfeng Ma\", \"id\": 167752}, {\"name\": \"Yang Cao\", \"id\": 71656}, {\"name\": \"Xian-Sheng Hua\", \"id\": 29896}, {\"name\": \"Howard C. Elman\", \"id\": 194027}, {\"name\": \"Zhaolin Jiang\", \"id\": 97292}, {\"name\": \"Lizhen Shao\", \"id\": 708301}, {\"name\": \"Zhong-Zhi Bai\", \"id\": 65399}, {\"name\": \"Valeria Simoncini\", \"id\": 185113}, {\"name\": \"Yimin Wei\", \"id\": 79805}], \"links\": [{\"source\": 580513, \"target\": 71656}, {\"source\": 580513, \"target\": 167752}, {\"source\": 580513, \"target\": 45253}, {\"source\": 580513, \"target\": 65399}, {\"source\": 580513, \"target\": 912741}, {\"source\": 24226, \"target\": 45253}, {\"source\": 912741, \"target\": 65399}, {\"source\": 912741, \"target\": 71656}, {\"source\": 912741, \"target\": 167752}, {\"source\": 45253, \"target\": 29896}, {\"source\": 45253, \"target\": 65399}, {\"source\": 45253, \"target\": 139429}, {\"source\": 45253, \"target\": 71656}, {\"source\": 45253, \"target\": 79805}, {\"source\": 45253, \"target\": 97292}, {\"source\": 45253, \"target\": 167752}, {\"source\": 139429, \"target\": 79805}, {\"source\": 139429, \"target\": 167752}, {\"source\": 167752, \"target\": 65399}, {\"source\": 167752, \"target\": 71656}, {\"source\": 167752, \"target\": 79805}, {\"source\": 167752, \"target\": 194027}, {\"source\": 71656, \"target\": 29896}, {\"source\": 71656, \"target\": 65399}, {\"source\": 194027, \"target\": 65399}, {\"source\": 194027, \"target\": 185113}, {\"source\": 97292, \"target\": 65399}, {\"source\": 65399, \"target\": 185113}, {\"source\": 65399, \"target\": 79805}]}",
"id": 1964,
"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: Mei-Qun Jiang, Mário A. T. Figueiredo, Michael K. Ng, Liqun Qi, Zeng-Qi Wang, Changfeng Ma, Yang Cao, Xian-Sheng Hua, Howard C. Elman, Zhaolin Jiang, Lizhen Shao, Zhong-Zhi Bai, Valeria Simoncini, Yimin Wei\n- Research collaborations between these authors: Mei-Qun Jiang and Yang Cao, Mei-Qun Jiang and Changfeng Ma, Mei-Qun Jiang and Michael K. Ng, Mei-Qun Jiang and Zhong-Zhi Bai, Mei-Qun Jiang and Zeng-Qi Wang, Mário A. T. Figueiredo and Michael K. Ng, Michael K. Ng and Xian-Sheng Hua, Michael K. Ng and Zhong-Zhi Bai, Michael K. Ng and Liqun Qi, Michael K. Ng and Yang Cao, Michael K. Ng and Yimin Wei, Michael K. Ng and Zhaolin Jiang, Michael K. Ng and Changfeng Ma, Liqun Qi and Yimin Wei, Liqun Qi and Changfeng Ma, Zeng-Qi Wang and Zhong-Zhi Bai, Zeng-Qi Wang and Yang Cao, Zeng-Qi Wang and Changfeng Ma, Changfeng Ma and Zhong-Zhi Bai, Changfeng Ma and Yang Cao, Changfeng Ma and Yimin Wei, Changfeng Ma and Howard C. Elman, Yang Cao and Xian-Sheng Hua, Yang Cao and Zhong-Zhi Bai, Howard C. Elman and Zhong-Zhi Bai, Howard C. Elman and Valeria Simoncini, Zhaolin Jiang and Zhong-Zhi Bai, Zhong-Zhi Bai and Valeria Simoncini, Zhong-Zhi Bai and Yimin Wei.\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: Bo Zhang, Wei-Ying Ma, Batya Friedman, Shashi Shekhar, Andrew McCallum, Chao-Ying Wu, Julio Gonzalo, Wei Chen, Hernán Merlino, Oren Etzioni, Tak-Lam Wong, Zhixing Yang, Giovanni Grasso, Stephen Soderland\n- Research collaborations between these authors: Bo Zhang and Shashi Shekhar, Bo Zhang and Wei Chen, Bo Zhang and Andrew McCallum, Bo Zhang and Wei-Ying Ma, Bo Zhang and Oren Etzioni, Bo Zhang and Tak-Lam Wong, Wei-Ying Ma and Wei Chen, Wei-Ying Ma and Shashi Shekhar, Wei-Ying Ma and Andrew McCallum, Wei-Ying Ma and Oren Etzioni, Wei-Ying Ma and Tak-Lam Wong, Shashi Shekhar and Hernán Merlino, Shashi Shekhar and Andrew McCallum, Shashi Shekhar and Chao-Ying Wu, Andrew McCallum and Wei Chen, Andrew McCallum and Oren Etzioni, Andrew McCallum and Stephen Soderland, Andrew McCallum and Tak-Lam Wong, Wei Chen and Tak-Lam Wong, Hernán Merlino and Oren Etzioni, Hernán Merlino and Stephen Soderland, Oren Etzioni and Stephen Soderland, Oren Etzioni and Giovanni Grasso, Oren Etzioni and Tak-Lam Wong, Tak-Lam Wong and Stephen Soderland, Giovanni Grasso and Stephen Soderland.\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\": \"Bo Zhang\", \"id\": 31042}, {\"name\": \"Batya Friedman\", \"id\": 25416}, {\"name\": \"Shashi Shekhar\", \"id\": 12875}, {\"name\": \"Chao-Ying Wu\", \"id\": 815341}, {\"name\": \"Andrew McCallum\", \"id\": 17613}, {\"name\": \"Julio Gonzalo\", \"id\": 94925}, {\"name\": \"Wei Chen\", \"id\": 13200}, {\"name\": \"Oren Etzioni\", \"id\": 32887}, {\"name\": \"Hern\\u00e1n Merlino\", \"id\": 5301}, {\"name\": \"Wei-Ying Ma\", \"id\": 81431}, {\"name\": \"Tak-Lam Wong\", \"id\": 121787}, {\"name\": \"Zhixing Yang\", \"id\": 228316}, {\"name\": \"Giovanni Grasso\", \"id\": 114141}, {\"name\": \"Stephen Soderland\", \"id\": 137951}], \"links\": [{\"source\": 31042, \"target\": 12875}, {\"source\": 31042, \"target\": 13200}, {\"source\": 31042, \"target\": 17613}, {\"source\": 31042, \"target\": 81431}, {\"source\": 31042, \"target\": 32887}, {\"source\": 31042, \"target\": 121787}, {\"source\": 12875, \"target\": 5301}, {\"source\": 12875, \"target\": 17613}, {\"source\": 12875, \"target\": 81431}, {\"source\": 12875, \"target\": 815341}, {\"source\": 17613, \"target\": 13200}, {\"source\": 17613, \"target\": 32887}, {\"source\": 17613, \"target\": 137951}, {\"source\": 17613, \"target\": 81431}, {\"source\": 17613, \"target\": 121787}, {\"source\": 13200, \"target\": 81431}, {\"source\": 13200, \"target\": 121787}, {\"source\": 32887, \"target\": 5301}, {\"source\": 32887, \"target\": 137951}, {\"source\": 32887, \"target\": 81431}, {\"source\": 32887, \"target\": 114141}, {\"source\": 32887, \"target\": 121787}, {\"source\": 5301, \"target\": 137951}, {\"source\": 81431, \"target\": 121787}, {\"source\": 121787, \"target\": 137951}, {\"source\": 114141, \"target\": 137951}]}",
"id": 30,
"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: Bo Zhang, Wei-Ying Ma, Batya Friedman, Shashi Shekhar, Andrew McCallum, Chao-Ying Wu, Julio Gonzalo, Wei Chen, Hernán Merlino, Oren Etzioni, Tak-Lam Wong, Zhixing Yang, Giovanni Grasso, Stephen Soderland\n- Research collaborations between these authors: Bo Zhang and Shashi Shekhar, Bo Zhang and Wei Chen, Bo Zhang and Andrew McCallum, Bo Zhang and Wei-Ying Ma, Bo Zhang and Oren Etzioni, Bo Zhang and Tak-Lam Wong, Wei-Ying Ma and Wei Chen, Wei-Ying Ma and Shashi Shekhar, Wei-Ying Ma and Andrew McCallum, Wei-Ying Ma and Oren Etzioni, Wei-Ying Ma and Tak-Lam Wong, Shashi Shekhar and Hernán Merlino, Shashi Shekhar and Andrew McCallum, Shashi Shekhar and Chao-Ying Wu, Andrew McCallum and Wei Chen, Andrew McCallum and Oren Etzioni, Andrew McCallum and Stephen Soderland, Andrew McCallum and Tak-Lam Wong, Wei Chen and Tak-Lam Wong, Hernán Merlino and Oren Etzioni, Hernán Merlino and Stephen Soderland, Oren Etzioni and Stephen Soderland, Oren Etzioni and Giovanni Grasso, Oren Etzioni and Tak-Lam Wong, Tak-Lam Wong and Stephen Soderland, Giovanni Grasso and Stephen Soderland.\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: Antonio Torralba, Shu Ching Chen, Chengcui Zhang, Hsin-Yu Ha, Borko Furht, Zongxing Xie, Ramesh Jain, Tao Meng, Changsheng Xu, Na Zhao, Kanoksri Sarinnapakorn, LiWu Chang, Samira Pouyanfar, Mei Ling Shyu\n- Research collaborations between these authors: Antonio Torralba and Changsheng Xu, Antonio Torralba and Ramesh Jain, Antonio Torralba and Mei Ling Shyu, Shu Ching Chen and Mei Ling Shyu, Shu Ching Chen and Hsin-Yu Ha, Shu Ching Chen and Tao Meng, Shu Ching Chen and Chengcui Zhang, Shu Ching Chen and Borko Furht, Shu Ching Chen and Changsheng Xu, Shu Ching Chen and LiWu Chang, Shu Ching Chen and Kanoksri Sarinnapakorn, Shu Ching Chen and Na Zhao, Shu Ching Chen and Zongxing Xie, Shu Ching Chen and Samira Pouyanfar, Chengcui Zhang and Changsheng Xu, Chengcui Zhang and Mei Ling Shyu, Chengcui Zhang and Hsin-Yu Ha, Chengcui Zhang and Na Zhao, Chengcui Zhang and Tao Meng, Chengcui Zhang and Samira Pouyanfar, Hsin-Yu Ha and Mei Ling Shyu, Hsin-Yu Ha and Samira Pouyanfar, Borko Furht and Mei Ling Shyu, Zongxing Xie and Mei Ling Shyu, Zongxing Xie and Tao Meng, Zongxing Xie and LiWu Chang, Zongxing Xie and Kanoksri Sarinnapakorn, Zongxing Xie and Samira Pouyanfar, Ramesh Jain and Changsheng Xu, Ramesh Jain and Mei Ling Shyu, Tao Meng and Mei Ling Shyu, Tao Meng and LiWu Chang, Changsheng Xu and Mei Ling Shyu, Na Zhao and Mei Ling Shyu, Na Zhao and Samira Pouyanfar, Kanoksri Sarinnapakorn and LiWu Chang, Kanoksri Sarinnapakorn and Mei Ling Shyu, LiWu Chang and Mei Ling Shyu, Samira Pouyanfar and Mei Ling Shyu.\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\": \"Antonio Torralba\", \"id\": 54659}, {\"name\": \"Shu Ching Chen\", \"id\": 317830}, {\"name\": \"Chengcui Zhang\", \"id\": 5894}, {\"name\": \"Hsin-Yu Ha\", \"id\": 278663}, {\"name\": \"Samira Pouyanfar\", \"id\": 595289}, {\"name\": \"Borko Furht\", \"id\": 6634}, {\"name\": \"Zongxing Xie\", \"id\": 525931}, {\"name\": \"Ramesh Jain\", \"id\": 161327}, {\"name\": \"Tao Meng\", \"id\": 300304}, {\"name\": \"Changsheng Xu\", \"id\": 84145}, {\"name\": \"Na Zhao\", \"id\": 281234}, {\"name\": \"Kanoksri Sarinnapakorn\", \"id\": 123539}, {\"name\": \"LiWu Chang\", \"id\": 107289}, {\"name\": \"Mei Ling Shyu\", \"id\": 215484}], \"links\": [{\"source\": 54659, \"target\": 84145}, {\"source\": 54659, \"target\": 161327}, {\"source\": 54659, \"target\": 215484}, {\"source\": 317830, \"target\": 215484}, {\"source\": 317830, \"target\": 278663}, {\"source\": 317830, \"target\": 300304}, {\"source\": 317830, \"target\": 5894}, {\"source\": 317830, \"target\": 6634}, {\"source\": 317830, \"target\": 84145}, {\"source\": 317830, \"target\": 107289}, {\"source\": 317830, \"target\": 123539}, {\"source\": 317830, \"target\": 281234}, {\"source\": 317830, \"target\": 525931}, {\"source\": 317830, \"target\": 595289}, {\"source\": 5894, \"target\": 84145}, {\"source\": 5894, \"target\": 215484}, {\"source\": 5894, \"target\": 278663}, {\"source\": 5894, \"target\": 281234}, {\"source\": 5894, \"target\": 300304}, {\"source\": 5894, \"target\": 595289}, {\"source\": 278663, \"target\": 215484}, {\"source\": 278663, \"target\": 595289}, {\"source\": 595289, \"target\": 215484}, {\"source\": 595289, \"target\": 281234}, {\"source\": 595289, \"target\": 525931}, {\"source\": 6634, \"target\": 215484}, {\"source\": 525931, \"target\": 215484}, {\"source\": 525931, \"target\": 300304}, {\"source\": 525931, \"target\": 107289}, {\"source\": 525931, \"target\": 123539}, {\"source\": 161327, \"target\": 84145}, {\"source\": 161327, \"target\": 215484}, {\"source\": 300304, \"target\": 215484}, {\"source\": 300304, \"target\": 107289}, {\"source\": 84145, \"target\": 215484}, {\"source\": 281234, \"target\": 215484}, {\"source\": 123539, \"target\": 107289}, {\"source\": 123539, \"target\": 215484}, {\"source\": 107289, \"target\": 215484}]}",
"id": 733,
"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: Antonio Torralba, Shu Ching Chen, Chengcui Zhang, Hsin-Yu Ha, Borko Furht, Zongxing Xie, Ramesh Jain, Tao Meng, Changsheng Xu, Na Zhao, Kanoksri Sarinnapakorn, LiWu Chang, Samira Pouyanfar, Mei Ling Shyu\n- Research collaborations between these authors: Antonio Torralba and Changsheng Xu, Antonio Torralba and Ramesh Jain, Antonio Torralba and Mei Ling Shyu, Shu Ching Chen and Mei Ling Shyu, Shu Ching Chen and Hsin-Yu Ha, Shu Ching Chen and Tao Meng, Shu Ching Chen and Chengcui Zhang, Shu Ching Chen and Borko Furht, Shu Ching Chen and Changsheng Xu, Shu Ching Chen and LiWu Chang, Shu Ching Chen and Kanoksri Sarinnapakorn, Shu Ching Chen and Na Zhao, Shu Ching Chen and Zongxing Xie, Shu Ching Chen and Samira Pouyanfar, Chengcui Zhang and Changsheng Xu, Chengcui Zhang and Mei Ling Shyu, Chengcui Zhang and Hsin-Yu Ha, Chengcui Zhang and Na Zhao, Chengcui Zhang and Tao Meng, Chengcui Zhang and Samira Pouyanfar, Hsin-Yu Ha and Mei Ling Shyu, Hsin-Yu Ha and Samira Pouyanfar, Borko Furht and Mei Ling Shyu, Zongxing Xie and Mei Ling Shyu, Zongxing Xie and Tao Meng, Zongxing Xie and LiWu Chang, Zongxing Xie and Kanoksri Sarinnapakorn, Zongxing Xie and Samira Pouyanfar, Ramesh Jain and Changsheng Xu, Ramesh Jain and Mei Ling Shyu, Tao Meng and Mei Ling Shyu, Tao Meng and LiWu Chang, Changsheng Xu and Mei Ling Shyu, Na Zhao and Mei Ling Shyu, Na Zhao and Samira Pouyanfar, Kanoksri Sarinnapakorn and LiWu Chang, Kanoksri Sarinnapakorn and Mei Ling Shyu, LiWu Chang and Mei Ling Shyu, Samira Pouyanfar and Mei Ling Shyu.\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: Arcanjo Lenzi, Rui Seara, José Carlos M. Bermudez, Tareq Y. Al-Naffouri, Azzedine Zerguine, Muhammad Moinuddin, Min Lin, Yongbin Wei, Eweda Eweda, Colin Cowan, Pedro Inácio Hübscher, Márcio Holsbach Costa, Wei-Ping Zhu, Ali H. Sayed\n- Research collaborations between these authors: Arcanjo Lenzi and Tareq Y. Al-Naffouri, Arcanjo Lenzi and Muhammad Moinuddin, Rui Seara and José Carlos M. Bermudez, Rui Seara and Ali H. Sayed, Rui Seara and Márcio Holsbach Costa, Rui Seara and Tareq Y. Al-Naffouri, Rui Seara and Muhammad Moinuddin, José Carlos M. Bermudez and Azzedine Zerguine, José Carlos M. Bermudez and Ali H. Sayed, José Carlos M. Bermudez and Tareq Y. Al-Naffouri, José Carlos M. Bermudez and Márcio Holsbach Costa, José Carlos M. Bermudez and Pedro Inácio Hübscher, José Carlos M. Bermudez and Eweda Eweda, José Carlos M. Bermudez and Muhammad Moinuddin, Tareq Y. Al-Naffouri and Azzedine Zerguine, Tareq Y. Al-Naffouri and Ali H. Sayed, Tareq Y. Al-Naffouri and Min Lin, Tareq Y. Al-Naffouri and Muhammad Moinuddin, Tareq Y. Al-Naffouri and Wei-Ping Zhu, Tareq Y. Al-Naffouri and Márcio Holsbach Costa, Tareq Y. Al-Naffouri and Eweda Eweda, Azzedine Zerguine and Colin Cowan, Azzedine Zerguine and Yongbin Wei, Azzedine Zerguine and Ali H. Sayed, Azzedine Zerguine and Muhammad Moinuddin, Azzedine Zerguine and Pedro Inácio Hübscher, Azzedine Zerguine and Eweda Eweda, Muhammad Moinuddin and Min Lin, Muhammad Moinuddin and Colin Cowan, Muhammad Moinuddin and Yongbin Wei, Muhammad Moinuddin and Ali H. Sayed, Muhammad Moinuddin and Wei-Ping Zhu, Muhammad Moinuddin and Márcio Holsbach Costa, Muhammad Moinuddin and Pedro Inácio Hübscher, Muhammad Moinuddin and Eweda Eweda, Min Lin and Wei-Ping Zhu, Eweda Eweda and Colin Cowan, Eweda Eweda and Ali H. Sayed, Eweda Eweda and Márcio Holsbach Costa, Eweda Eweda and Pedro Inácio Hübscher, Colin Cowan and Ali H. Sayed, Wei-Ping Zhu and Ali H. Sayed.\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\": \"Arcanjo Lenzi\", \"id\": 1136066}, {\"name\": \"Rui Seara\", \"id\": 156487}, {\"name\": \"Jos\\u00e9 Carlos M. Bermudez\", \"id\": 177512}, {\"name\": \"Azzedine Zerguine\", \"id\": 84458}, {\"name\": \"Tareq Y. Al-Naffouri\", \"id\": 193450}, {\"name\": \"Muhammad Moinuddin\", \"id\": 237615}, {\"name\": \"Min Lin\", \"id\": 90671}, {\"name\": \"Yongbin Wei\", \"id\": 175441}, {\"name\": \"Eweda Eweda\", \"id\": 505296}, {\"name\": \"Colin Cowan\", \"id\": 136371}, {\"name\": \"Pedro In\\u00e1cio H\\u00fcbscher\", \"id\": 430548}, {\"name\": \"M\\u00e1rcio Holsbach Costa\", \"id\": 267477}, {\"name\": \"Wei-Ping Zhu\", \"id\": 245108}, {\"name\": \"Ali H. Sayed\", \"id\": 180956}], \"links\": [{\"source\": 1136066, \"target\": 193450}, {\"source\": 1136066, \"target\": 237615}, {\"source\": 156487, \"target\": 177512}, {\"source\": 156487, \"target\": 180956}, {\"source\": 156487, \"target\": 267477}, {\"source\": 156487, \"target\": 193450}, {\"source\": 156487, \"target\": 237615}, {\"source\": 177512, \"target\": 84458}, {\"source\": 177512, \"target\": 180956}, {\"source\": 177512, \"target\": 193450}, {\"source\": 177512, \"target\": 267477}, {\"source\": 177512, \"target\": 430548}, {\"source\": 177512, \"target\": 505296}, {\"source\": 177512, \"target\": 237615}, {\"source\": 84458, \"target\": 136371}, {\"source\": 84458, \"target\": 175441}, {\"source\": 84458, \"target\": 180956}, {\"source\": 84458, \"target\": 193450}, {\"source\": 84458, \"target\": 237615}, {\"source\": 84458, \"target\": 430548}, {\"source\": 84458, \"target\": 505296}, {\"source\": 193450, \"target\": 180956}, {\"source\": 193450, \"target\": 90671}, {\"source\": 193450, \"target\": 237615}, {\"source\": 193450, \"target\": 245108}, {\"source\": 193450, \"target\": 267477}, {\"source\": 193450, \"target\": 505296}, {\"source\": 237615, \"target\": 90671}, {\"source\": 237615, \"target\": 136371}, {\"source\": 237615, \"target\": 175441}, {\"source\": 237615, \"target\": 180956}, {\"source\": 237615, \"target\": 245108}, {\"source\": 237615, \"target\": 267477}, {\"source\": 237615, \"target\": 430548}, {\"source\": 237615, \"target\": 505296}, {\"source\": 90671, \"target\": 245108}, {\"source\": 505296, \"target\": 136371}, {\"source\": 505296, \"target\": 180956}, {\"source\": 505296, \"target\": 267477}, {\"source\": 505296, \"target\": 430548}, {\"source\": 136371, \"target\": 180956}, {\"source\": 245108, \"target\": 180956}]}",
"id": 1614,
"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: Arcanjo Lenzi, Rui Seara, José Carlos M. Bermudez, Tareq Y. Al-Naffouri, Azzedine Zerguine, Muhammad Moinuddin, Min Lin, Yongbin Wei, Eweda Eweda, Colin Cowan, Pedro Inácio Hübscher, Márcio Holsbach Costa, Wei-Ping Zhu, Ali H. Sayed\n- Research collaborations between these authors: Arcanjo Lenzi and Tareq Y. Al-Naffouri, Arcanjo Lenzi and Muhammad Moinuddin, Rui Seara and José Carlos M. Bermudez, Rui Seara and Ali H. Sayed, Rui Seara and Márcio Holsbach Costa, Rui Seara and Tareq Y. Al-Naffouri, Rui Seara and Muhammad Moinuddin, José Carlos M. Bermudez and Azzedine Zerguine, José Carlos M. Bermudez and Ali H. Sayed, José Carlos M. Bermudez and Tareq Y. Al-Naffouri, José Carlos M. Bermudez and Márcio Holsbach Costa, José Carlos M. Bermudez and Pedro Inácio Hübscher, José Carlos M. Bermudez and Eweda Eweda, José Carlos M. Bermudez and Muhammad Moinuddin, Tareq Y. Al-Naffouri and Azzedine Zerguine, Tareq Y. Al-Naffouri and Ali H. Sayed, Tareq Y. Al-Naffouri and Min Lin, Tareq Y. Al-Naffouri and Muhammad Moinuddin, Tareq Y. Al-Naffouri and Wei-Ping Zhu, Tareq Y. Al-Naffouri and Márcio Holsbach Costa, Tareq Y. Al-Naffouri and Eweda Eweda, Azzedine Zerguine and Colin Cowan, Azzedine Zerguine and Yongbin Wei, Azzedine Zerguine and Ali H. Sayed, Azzedine Zerguine and Muhammad Moinuddin, Azzedine Zerguine and Pedro Inácio Hübscher, Azzedine Zerguine and Eweda Eweda, Muhammad Moinuddin and Min Lin, Muhammad Moinuddin and Colin Cowan, Muhammad Moinuddin and Yongbin Wei, Muhammad Moinuddin and Ali H. Sayed, Muhammad Moinuddin and Wei-Ping Zhu, Muhammad Moinuddin and Márcio Holsbach Costa, Muhammad Moinuddin and Pedro Inácio Hübscher, Muhammad Moinuddin and Eweda Eweda, Min Lin and Wei-Ping Zhu, Eweda Eweda and Colin Cowan, Eweda Eweda and Ali H. Sayed, Eweda Eweda and Márcio Holsbach Costa, Eweda Eweda and Pedro Inácio Hübscher, Colin Cowan and Ali H. Sayed, Wei-Ping Zhu and Ali H. Sayed.\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": 487,
"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: Changyang Li, Daniel Rueckert, Kensaku Mori, Yoshinobu Sato, De-Xing Kong, Yadong Wang, Georg Rose, Yuanzhi Cheng, Yong Yin, Shinichi Tamura, Gyorgy Bekes, Matthias Kirschner, Cristian Lorenz, Sergio Vera\n- Research collaborations between these authors: Changyang Li and Yong Yin, Changyang Li and Gyorgy Bekes, Daniel Rueckert and Kensaku Mori, Daniel Rueckert and Yoshinobu Sato, Daniel Rueckert and Gyorgy Bekes, Daniel Rueckert and Cristian Lorenz, Kensaku Mori and Yoshinobu Sato, Kensaku Mori and Shinichi Tamura, Kensaku Mori and Gyorgy Bekes, Yoshinobu Sato and Shinichi Tamura, Yoshinobu Sato and Gyorgy Bekes, Yoshinobu Sato and Yadong Wang, Yoshinobu Sato and Yuanzhi Cheng, De-Xing Kong and Gyorgy Bekes, Yadong Wang and Shinichi Tamura, Yadong Wang and Gyorgy Bekes, Georg Rose and Cristian Lorenz, Georg Rose and Gyorgy Bekes, Yuanzhi Cheng and Shinichi Tamura, Yuanzhi Cheng and Gyorgy Bekes, Yong Yin and Gyorgy Bekes, Shinichi Tamura and Gyorgy Bekes, Gyorgy Bekes and Matthias Kirschner, Gyorgy Bekes and Sergio Vera, Gyorgy Bekes and Cristian Lorenz, Matthias Kirschner and Cristian Lorenz.\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\": \"Changyang Li\", \"id\": 464290}, {\"name\": \"Daniel Rueckert\", \"id\": 7234}, {\"name\": \"Kensaku Mori\", \"id\": 11653}, {\"name\": \"Cristian Lorenz\", \"id\": 137624}, {\"name\": \"Yoshinobu Sato\", \"id\": 27561}, {\"name\": \"De-Xing Kong\", \"id\": 239242}, {\"name\": \"Yadong Wang\", \"id\": 41964}, {\"name\": \"Yuanzhi Cheng\", \"id\": 407789}, {\"name\": \"Yong Yin\", \"id\": 176527}, {\"name\": \"Shinichi Tamura\", \"id\": 27568}, {\"name\": \"Gyorgy Bekes\", \"id\": 646833}, {\"name\": \"Matthias Kirschner\", \"id\": 22390}, {\"name\": \"Georg Rose\", \"id\": 172696}, {\"name\": \"Sergio Vera\", \"id\": 36124}], \"links\": [{\"source\": 464290, \"target\": 176527}, {\"source\": 464290, \"target\": 646833}, {\"source\": 7234, \"target\": 11653}, {\"source\": 7234, \"target\": 27561}, {\"source\": 7234, \"target\": 646833}, {\"source\": 7234, \"target\": 137624}, {\"source\": 11653, \"target\": 27561}, {\"source\": 11653, \"target\": 27568}, {\"source\": 11653, \"target\": 646833}, {\"source\": 137624, \"target\": 22390}, {\"source\": 137624, \"target\": 172696}, {\"source\": 137624, \"target\": 646833}, {\"source\": 27561, \"target\": 27568}, {\"source\": 27561, \"target\": 646833}, {\"source\": 27561, \"target\": 41964}, {\"source\": 27561, \"target\": 407789}, {\"source\": 239242, \"target\": 646833}, {\"source\": 41964, \"target\": 27568}, {\"source\": 41964, \"target\": 646833}, {\"source\": 407789, \"target\": 27568}, {\"source\": 407789, \"target\": 646833}, {\"source\": 176527, \"target\": 646833}, {\"source\": 27568, \"target\": 646833}, {\"source\": 646833, \"target\": 22390}, {\"source\": 646833, \"target\": 36124}, {\"source\": 646833, \"target\": 172696}]}",
"id": 2239,
"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: Changyang Li, Daniel Rueckert, Kensaku Mori, Yoshinobu Sato, De-Xing Kong, Yadong Wang, Georg Rose, Yuanzhi Cheng, Yong Yin, Shinichi Tamura, Gyorgy Bekes, Matthias Kirschner, Cristian Lorenz, Sergio Vera\n- Research collaborations between these authors: Changyang Li and Yong Yin, Changyang Li and Gyorgy Bekes, Daniel Rueckert and Kensaku Mori, Daniel Rueckert and Yoshinobu Sato, Daniel Rueckert and Gyorgy Bekes, Daniel Rueckert and Cristian Lorenz, Kensaku Mori and Yoshinobu Sato, Kensaku Mori and Shinichi Tamura, Kensaku Mori and Gyorgy Bekes, Yoshinobu Sato and Shinichi Tamura, Yoshinobu Sato and Gyorgy Bekes, Yoshinobu Sato and Yadong Wang, Yoshinobu Sato and Yuanzhi Cheng, De-Xing Kong and Gyorgy Bekes, Yadong Wang and Shinichi Tamura, Yadong Wang and Gyorgy Bekes, Georg Rose and Cristian Lorenz, Georg Rose and Gyorgy Bekes, Yuanzhi Cheng and Shinichi Tamura, Yuanzhi Cheng and Gyorgy Bekes, Yong Yin and Gyorgy Bekes, Shinichi Tamura and Gyorgy Bekes, Gyorgy Bekes and Matthias Kirschner, Gyorgy Bekes and Sergio Vera, Gyorgy Bekes and Cristian Lorenz, Matthias Kirschner and Cristian Lorenz.\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: Atsushi Shimada, Katsuhiko Sakaue, Makoto Tanaka, Rin-ichiro Taniguchi, Yutaka Satoh, Kees van den Doel, Hajime Nagahara, Yoshinori Niwa, Christopher Raphael, Hideaki Goto, Caihua Wang, Satoshi Yoshinaga, Kazuhiko Yamamoto, Mamoru Yasumoto\n- Research collaborations between these authors: Atsushi Shimada and Kazuhiko Yamamoto, Atsushi Shimada and Rin-ichiro Taniguchi, Atsushi Shimada and Hajime Nagahara, Atsushi Shimada and Yoshinori Niwa, Atsushi Shimada and Yutaka Satoh, Atsushi Shimada and Satoshi Yoshinaga, Katsuhiko Sakaue and Kazuhiko Yamamoto, Katsuhiko Sakaue and Yoshinori Niwa, Katsuhiko Sakaue and Yutaka Satoh, Makoto Tanaka and Hideaki Goto, Makoto Tanaka and Kazuhiko Yamamoto, Rin-ichiro Taniguchi and Kazuhiko Yamamoto, Rin-ichiro Taniguchi and Hajime Nagahara, Rin-ichiro Taniguchi and Yoshinori Niwa, Rin-ichiro Taniguchi and Yutaka Satoh, Rin-ichiro Taniguchi and Satoshi Yoshinaga, Yutaka Satoh and Hajime Nagahara, Yutaka Satoh and Kazuhiko Yamamoto, Yutaka Satoh and Yoshinori Niwa, Yutaka Satoh and Caihua Wang, Yutaka Satoh and Satoshi Yoshinaga, Kees van den Doel and Kazuhiko Yamamoto, Hajime Nagahara and Kazuhiko Yamamoto, Hajime Nagahara and Yoshinori Niwa, Hajime Nagahara and Satoshi Yoshinaga, Yoshinori Niwa and Kazuhiko Yamamoto, Yoshinori Niwa and Satoshi Yoshinaga, Yoshinori Niwa and Caihua Wang, Christopher Raphael and Kazuhiko Yamamoto, Hideaki Goto and Kazuhiko Yamamoto, Caihua Wang and Kazuhiko Yamamoto, Satoshi Yoshinaga and Kazuhiko Yamamoto, Kazuhiko Yamamoto and Mamoru Yasumoto.\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\": \"Atsushi Shimada\", \"id\": 100384}, {\"name\": \"Katsuhiko Sakaue\", \"id\": 87970}, {\"name\": \"Rin-ichiro Taniguchi\", \"id\": 100386}, {\"name\": \"Yutaka Satoh\", \"id\": 266728}, {\"name\": \"Kees van den Doel\", \"id\": 374121}, {\"name\": \"Hajime Nagahara\", \"id\": 137466}, {\"name\": \"Mamoru Yasumoto\", \"id\": 82781}, {\"name\": \"Yoshinori Niwa\", \"id\": 223315}, {\"name\": \"Christopher Raphael\", \"id\": 46035}, {\"name\": \"Hideaki Goto\", \"id\": 61205}, {\"name\": \"Caihua Wang\", \"id\": 512052}, {\"name\": \"Satoshi Yoshinaga\", \"id\": 298361}, {\"name\": \"Makoto Tanaka\", \"id\": 470042}, {\"name\": \"Kazuhiko Yamamoto\", \"id\": 68442}], \"links\": [{\"source\": 100384, \"target\": 68442}, {\"source\": 100384, \"target\": 100386}, {\"source\": 100384, \"target\": 137466}, {\"source\": 100384, \"target\": 223315}, {\"source\": 100384, \"target\": 266728}, {\"source\": 100384, \"target\": 298361}, {\"source\": 87970, \"target\": 68442}, {\"source\": 87970, \"target\": 223315}, {\"source\": 87970, \"target\": 266728}, {\"source\": 100386, \"target\": 68442}, {\"source\": 100386, \"target\": 137466}, {\"source\": 100386, \"target\": 223315}, {\"source\": 100386, \"target\": 266728}, {\"source\": 100386, \"target\": 298361}, {\"source\": 266728, \"target\": 137466}, {\"source\": 266728, \"target\": 68442}, {\"source\": 266728, \"target\": 223315}, {\"source\": 266728, \"target\": 512052}, {\"source\": 266728, \"target\": 298361}, {\"source\": 374121, \"target\": 68442}, {\"source\": 137466, \"target\": 68442}, {\"source\": 137466, \"target\": 223315}, {\"source\": 137466, \"target\": 298361}, {\"source\": 82781, \"target\": 68442}, {\"source\": 223315, \"target\": 68442}, {\"source\": 223315, \"target\": 298361}, {\"source\": 223315, \"target\": 512052}, {\"source\": 46035, \"target\": 68442}, {\"source\": 61205, \"target\": 68442}, {\"source\": 61205, \"target\": 470042}, {\"source\": 512052, \"target\": 68442}, {\"source\": 298361, \"target\": 68442}, {\"source\": 470042, \"target\": 68442}]}",
"id": 663,
"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: Atsushi Shimada, Katsuhiko Sakaue, Makoto Tanaka, Rin-ichiro Taniguchi, Yutaka Satoh, Kees van den Doel, Hajime Nagahara, Yoshinori Niwa, Christopher Raphael, Hideaki Goto, Caihua Wang, Satoshi Yoshinaga, Kazuhiko Yamamoto, Mamoru Yasumoto\n- Research collaborations between these authors: Atsushi Shimada and Kazuhiko Yamamoto, Atsushi Shimada and Rin-ichiro Taniguchi, Atsushi Shimada and Hajime Nagahara, Atsushi Shimada and Yoshinori Niwa, Atsushi Shimada and Yutaka Satoh, Atsushi Shimada and Satoshi Yoshinaga, Katsuhiko Sakaue and Kazuhiko Yamamoto, Katsuhiko Sakaue and Yoshinori Niwa, Katsuhiko Sakaue and Yutaka Satoh, Makoto Tanaka and Hideaki Goto, Makoto Tanaka and Kazuhiko Yamamoto, Rin-ichiro Taniguchi and Kazuhiko Yamamoto, Rin-ichiro Taniguchi and Hajime Nagahara, Rin-ichiro Taniguchi and Yoshinori Niwa, Rin-ichiro Taniguchi and Yutaka Satoh, Rin-ichiro Taniguchi and Satoshi Yoshinaga, Yutaka Satoh and Hajime Nagahara, Yutaka Satoh and Kazuhiko Yamamoto, Yutaka Satoh and Yoshinori Niwa, Yutaka Satoh and Caihua Wang, Yutaka Satoh and Satoshi Yoshinaga, Kees van den Doel and Kazuhiko Yamamoto, Hajime Nagahara and Kazuhiko Yamamoto, Hajime Nagahara and Yoshinori Niwa, Hajime Nagahara and Satoshi Yoshinaga, Yoshinori Niwa and Kazuhiko Yamamoto, Yoshinori Niwa and Satoshi Yoshinaga, Yoshinori Niwa and Caihua Wang, Christopher Raphael and Kazuhiko Yamamoto, Hideaki Goto and Kazuhiko Yamamoto, Caihua Wang and Kazuhiko Yamamoto, Satoshi Yoshinaga and Kazuhiko Yamamoto, Kazuhiko Yamamoto and Mamoru Yasumoto.\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: Montserrat Batet, Aida Valls, Philipp Cimiano, Carlos Vicient, Daniel S. Weld, Joaquín Izquierdo, Oren Etzioni, David Riaño, Karina Gibert, Steffen Staab, David Sánchez, Antonio Moreno, Doug Downey, Stephen Soderland\n- Research collaborations between these authors: Montserrat Batet and David Sánchez, Montserrat Batet and Antonio Moreno, Montserrat Batet and Steffen Staab, Montserrat Batet and Aida Valls, Montserrat Batet and Oren Etzioni, Montserrat Batet and Karina Gibert, Montserrat Batet and David Riaño, Montserrat Batet and Doug Downey, Montserrat Batet and Carlos Vicient, Aida Valls and David Sánchez, Aida Valls and Antonio Moreno, Aida Valls and Steffen Staab, Aida Valls and Oren Etzioni, Aida Valls and Karina Gibert, Aida Valls and Daniel S. Weld, Aida Valls and David Riaño, Aida Valls and Doug Downey, Aida Valls and Carlos Vicient, Philipp Cimiano and Steffen Staab, Philipp Cimiano and David Sánchez, Philipp Cimiano and Antonio Moreno, Philipp Cimiano and Oren Etzioni, Philipp Cimiano and Daniel S. Weld, Philipp Cimiano and Doug Downey, Philipp Cimiano and Stephen Soderland, Philipp Cimiano and Carlos Vicient, Carlos Vicient and David Sánchez, Carlos Vicient and Steffen Staab, Carlos Vicient and Antonio Moreno, Carlos Vicient and Oren Etzioni, Carlos Vicient and Karina Gibert, Carlos Vicient and Daniel S. Weld, Carlos Vicient and Doug Downey, Carlos Vicient and Stephen Soderland, Daniel S. Weld and Steffen Staab, Daniel S. Weld and David Sánchez, Daniel S. Weld and Antonio Moreno, Daniel S. Weld and Oren Etzioni, Daniel S. Weld and Doug Downey, Daniel S. Weld and Stephen Soderland, Joaquín Izquierdo and Karina Gibert, Oren Etzioni and Steffen Staab, Oren Etzioni and David Sánchez, Oren Etzioni and Antonio Moreno, Oren Etzioni and Doug Downey, Oren Etzioni and Stephen Soderland, David Riaño and David Sánchez, David Riaño and Antonio Moreno, David Riaño and Karina Gibert, Karina Gibert and David Sánchez, Karina Gibert and Antonio Moreno, Karina Gibert and Steffen Staab, Steffen Staab and David Sánchez, Steffen Staab and Antonio Moreno, David Sánchez and Antonio Moreno, David Sánchez and Doug Downey, David Sánchez and Stephen Soderland, Antonio Moreno and Doug Downey, Antonio Moreno and Stephen Soderland, Doug Downey and Stephen Soderland.\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\": \"Montserrat Batet\", \"id\": 5665}, {\"name\": \"Aida Valls\", \"id\": 5666}, {\"name\": \"Philipp Cimiano\", \"id\": 17962}, {\"name\": \"Carlos Vicient\", \"id\": 204172}, {\"name\": \"Stephen Soderland\", \"id\": 137951}, {\"name\": \"Antonio Moreno\", \"id\": 2300}, {\"name\": \"Joaqu\\u00edn Izquierdo\", \"id\": 186838}, {\"name\": \"Oren Etzioni\", \"id\": 32887}, {\"name\": \"David Ria\\u00f1o\", \"id\": 101304}, {\"name\": \"Karina Gibert\", \"id\": 33273}, {\"name\": \"David S\\u00e1nchez\", \"id\": 2299}, {\"name\": \"Steffen Staab\", \"id\": 1468}, {\"name\": \"Doug Downey\", \"id\": 137950}, {\"name\": \"Daniel S. Weld\", \"id\": 47935}], \"links\": [{\"source\": 5665, \"target\": 2299}, {\"source\": 5665, \"target\": 2300}, {\"source\": 5665, \"target\": 1468}, {\"source\": 5665, \"target\": 5666}, {\"source\": 5665, \"target\": 32887}, {\"source\": 5665, \"target\": 33273}, {\"source\": 5665, \"target\": 101304}, {\"source\": 5665, \"target\": 137950}, {\"source\": 5665, \"target\": 204172}, {\"source\": 5666, \"target\": 2299}, {\"source\": 5666, \"target\": 2300}, {\"source\": 5666, \"target\": 1468}, {\"source\": 5666, \"target\": 32887}, {\"source\": 5666, \"target\": 33273}, {\"source\": 5666, \"target\": 47935}, {\"source\": 5666, \"target\": 101304}, {\"source\": 5666, \"target\": 137950}, {\"source\": 5666, \"target\": 204172}, {\"source\": 17962, \"target\": 1468}, {\"source\": 17962, \"target\": 2299}, {\"source\": 17962, \"target\": 2300}, {\"source\": 17962, \"target\": 32887}, {\"source\": 17962, \"target\": 47935}, {\"source\": 17962, \"target\": 137950}, {\"source\": 17962, \"target\": 137951}, {\"source\": 17962, \"target\": 204172}, {\"source\": 204172, \"target\": 2299}, {\"source\": 204172, \"target\": 1468}, {\"source\": 204172, \"target\": 2300}, {\"source\": 204172, \"target\": 32887}, {\"source\": 204172, \"target\": 33273}, {\"source\": 204172, \"target\": 47935}, {\"source\": 204172, \"target\": 137950}, {\"source\": 204172, \"target\": 137951}, {\"source\": 137951, \"target\": 2299}, {\"source\": 137951, \"target\": 2300}, {\"source\": 137951, \"target\": 32887}, {\"source\": 137951, \"target\": 47935}, {\"source\": 137951, \"target\": 137950}, {\"source\": 2300, \"target\": 2299}, {\"source\": 2300, \"target\": 1468}, {\"source\": 2300, \"target\": 32887}, {\"source\": 2300, \"target\": 33273}, {\"source\": 2300, \"target\": 47935}, {\"source\": 2300, \"target\": 101304}, {\"source\": 2300, \"target\": 137950}, {\"source\": 186838, \"target\": 33273}, {\"source\": 32887, \"target\": 1468}, {\"source\": 32887, \"target\": 2299}, {\"source\": 32887, \"target\": 47935}, {\"source\": 32887, \"target\": 137950}, {\"source\": 101304, \"target\": 2299}, {\"source\": 101304, \"target\": 33273}, {\"source\": 33273, \"target\": 2299}, {\"source\": 33273, \"target\": 1468}, {\"source\": 2299, \"target\": 1468}, {\"source\": 2299, \"target\": 47935}, {\"source\": 2299, \"target\": 137950}, {\"source\": 1468, \"target\": 47935}, {\"source\": 137950, \"target\": 47935}]}",
"id": 2620,
"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: Montserrat Batet, Aida Valls, Philipp Cimiano, Carlos Vicient, Daniel S. Weld, Joaquín Izquierdo, Oren Etzioni, David Riaño, Karina Gibert, Steffen Staab, David Sánchez, Antonio Moreno, Doug Downey, Stephen Soderland\n- Research collaborations between these authors: Montserrat Batet and David Sánchez, Montserrat Batet and Antonio Moreno, Montserrat Batet and Steffen Staab, Montserrat Batet and Aida Valls, Montserrat Batet and Oren Etzioni, Montserrat Batet and Karina Gibert, Montserrat Batet and David Riaño, Montserrat Batet and Doug Downey, Montserrat Batet and Carlos Vicient, Aida Valls and David Sánchez, Aida Valls and Antonio Moreno, Aida Valls and Steffen Staab, Aida Valls and Oren Etzioni, Aida Valls and Karina Gibert, Aida Valls and Daniel S. Weld, Aida Valls and David Riaño, Aida Valls and Doug Downey, Aida Valls and Carlos Vicient, Philipp Cimiano and Steffen Staab, Philipp Cimiano and David Sánchez, Philipp Cimiano and Antonio Moreno, Philipp Cimiano and Oren Etzioni, Philipp Cimiano and Daniel S. Weld, Philipp Cimiano and Doug Downey, Philipp Cimiano and Stephen Soderland, Philipp Cimiano and Carlos Vicient, Carlos Vicient and David Sánchez, Carlos Vicient and Steffen Staab, Carlos Vicient and Antonio Moreno, Carlos Vicient and Oren Etzioni, Carlos Vicient and Karina Gibert, Carlos Vicient and Daniel S. Weld, Carlos Vicient and Doug Downey, Carlos Vicient and Stephen Soderland, Daniel S. Weld and Steffen Staab, Daniel S. Weld and David Sánchez, Daniel S. Weld and Antonio Moreno, Daniel S. Weld and Oren Etzioni, Daniel S. Weld and Doug Downey, Daniel S. Weld and Stephen Soderland, Joaquín Izquierdo and Karina Gibert, Oren Etzioni and Steffen Staab, Oren Etzioni and David Sánchez, Oren Etzioni and Antonio Moreno, Oren Etzioni and Doug Downey, Oren Etzioni and Stephen Soderland, David Riaño and David Sánchez, David Riaño and Antonio Moreno, David Riaño and Karina Gibert, Karina Gibert and David Sánchez, Karina Gibert and Antonio Moreno, Karina Gibert and Steffen Staab, Steffen Staab and David Sánchez, Steffen Staab and Antonio Moreno, David Sánchez and Antonio Moreno, David Sánchez and Doug Downey, David Sánchez and Stephen Soderland, Antonio Moreno and Doug Downey, Antonio Moreno and Stephen Soderland, Doug Downey and Stephen Soderland.\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: Degang Chen, Qinghua Hu, Ramakrishna Voorakaranam, Takahiro J. Yamaguchi, R. Sethukkarasi, Feng Wang, Etienne E. Kerre, Junhai Zhai, Chuan Luo, Wei-Zhi Wu, Randy Geiger, Adoración Rueda, Feng Jiang, Chengming He\n- Research collaborations between these authors: Degang Chen and Chuan Luo, Degang Chen and Qinghua Hu, Degang Chen and Junhai Zhai, Degang Chen and Feng Wang, Degang Chen and Wei-Zhi Wu, Degang Chen and Etienne E. Kerre, Degang Chen and Takahiro J. Yamaguchi, Degang Chen and Chengming He, Degang Chen and Randy Geiger, Degang Chen and R. Sethukkarasi, Degang Chen and Feng Jiang, Degang Chen and Adoración Rueda, Qinghua Hu and Chuan Luo, Qinghua Hu and Junhai Zhai, Qinghua Hu and Etienne E. Kerre, Qinghua Hu and Wei-Zhi Wu, Qinghua Hu and Feng Wang, Qinghua Hu and Feng Jiang, Ramakrishna Voorakaranam and Adoración Rueda, Feng Wang and Chuan Luo, Feng Wang and Wei-Zhi Wu, Etienne E. Kerre and Wei-Zhi Wu, Chuan Luo and Wei-Zhi 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": 5,
"style": "rule"
}
|
{
"exact_answer": 5,
"graph": "{\"directed\": false, \"multigraph\": false, \"graph\": {}, \"nodes\": [{\"name\": \"Degang Chen\", \"id\": 67809}, {\"name\": \"Qinghua Hu\", \"id\": 20995}, {\"name\": \"Ramakrishna Voorakaranam\", \"id\": 239780}, {\"name\": \"Takahiro J. Yamaguchi\", \"id\": 73508}, {\"name\": \"R. Sethukkarasi\", \"id\": 107223}, {\"name\": \"Feng Wang\", \"id\": 26512}, {\"name\": \"Etienne E. Kerre\", \"id\": 28497}, {\"name\": \"Junhai Zhai\", \"id\": 21522}, {\"name\": \"Chuan Luo\", \"id\": 16691}, {\"name\": \"Wei-Zhi Wu\", \"id\": 28916}, {\"name\": \"Randy Geiger\", \"id\": 459030}, {\"name\": \"Adoraci\\u00f3n Rueda\", \"id\": 256279}, {\"name\": \"Feng Jiang\", \"id\": 127484}, {\"name\": \"Chengming He\", \"id\": 448445}], \"links\": [{\"source\": 67809, \"target\": 16691}, {\"source\": 67809, \"target\": 20995}, {\"source\": 67809, \"target\": 21522}, {\"source\": 67809, \"target\": 26512}, {\"source\": 67809, \"target\": 28916}, {\"source\": 67809, \"target\": 28497}, {\"source\": 67809, \"target\": 73508}, {\"source\": 67809, \"target\": 448445}, {\"source\": 67809, \"target\": 459030}, {\"source\": 67809, \"target\": 107223}, {\"source\": 67809, \"target\": 127484}, {\"source\": 67809, \"target\": 256279}, {\"source\": 20995, \"target\": 16691}, {\"source\": 20995, \"target\": 21522}, {\"source\": 20995, \"target\": 28497}, {\"source\": 20995, \"target\": 28916}, {\"source\": 20995, \"target\": 26512}, {\"source\": 20995, \"target\": 127484}, {\"source\": 239780, \"target\": 256279}, {\"source\": 26512, \"target\": 16691}, {\"source\": 26512, \"target\": 28916}, {\"source\": 28497, \"target\": 28916}, {\"source\": 16691, \"target\": 28916}]}",
"id": 2989,
"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: Degang Chen, Qinghua Hu, Ramakrishna Voorakaranam, Takahiro J. Yamaguchi, R. Sethukkarasi, Feng Wang, Etienne E. Kerre, Junhai Zhai, Chuan Luo, Wei-Zhi Wu, Randy Geiger, Adoración Rueda, Feng Jiang, Chengming He\n- Research collaborations between these authors: Degang Chen and Chuan Luo, Degang Chen and Qinghua Hu, Degang Chen and Junhai Zhai, Degang Chen and Feng Wang, Degang Chen and Wei-Zhi Wu, Degang Chen and Etienne E. Kerre, Degang Chen and Takahiro J. Yamaguchi, Degang Chen and Chengming He, Degang Chen and Randy Geiger, Degang Chen and R. Sethukkarasi, Degang Chen and Feng Jiang, Degang Chen and Adoración Rueda, Qinghua Hu and Chuan Luo, Qinghua Hu and Junhai Zhai, Qinghua Hu and Etienne E. Kerre, Qinghua Hu and Wei-Zhi Wu, Qinghua Hu and Feng Wang, Qinghua Hu and Feng Jiang, Ramakrishna Voorakaranam and Adoración Rueda, Feng Wang and Chuan Luo, Feng Wang and Wei-Zhi Wu, Etienne E. Kerre and Wei-Zhi Wu, Chuan Luo and Wei-Zhi 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: Rüdiger L. Urbanke, Guanghui Song, Yuta Tsujii, Yoichiro Watanabe, Tianbin Wo, Ping Li, Lajos Hanzo, Zheng-Guang Wu, Xiaodong Wang, Meilin He, Vincenzo Lottici, Jun Cheng, Li Ping, Guosen Yue\n- Research collaborations between these authors: Rüdiger L. Urbanke and Xiaodong Wang, Rüdiger L. Urbanke and Jun Cheng, Rüdiger L. Urbanke and Lajos Hanzo, Rüdiger L. Urbanke and Li Ping, Rüdiger L. Urbanke and Guosen Yue, Rüdiger L. Urbanke and Guanghui Song, Rüdiger L. Urbanke and Yoichiro Watanabe, Guanghui Song and Jun Cheng, Guanghui Song and Xiaodong Wang, Guanghui Song and Ping Li, Guanghui Song and Lajos Hanzo, Guanghui Song and Li Ping, Guanghui Song and Tianbin Wo, Guanghui Song and Guosen Yue, Guanghui Song and Yuta Tsujii, Guanghui Song and Yoichiro Watanabe, Guanghui Song and Meilin He, Yuta Tsujii and Jun Cheng, Yuta Tsujii and Xiaodong Wang, Yuta Tsujii and Li Ping, Yuta Tsujii and Yoichiro Watanabe, Yoichiro Watanabe and Jun Cheng, Yoichiro Watanabe and Xiaodong Wang, Yoichiro Watanabe and Lajos Hanzo, Yoichiro Watanabe and Li Ping, Yoichiro Watanabe and Meilin He, Tianbin Wo and Jun Cheng, Tianbin Wo and Lajos Hanzo, Tianbin Wo and Li Ping, Ping Li and Jun Cheng, Lajos Hanzo and Jun Cheng, Lajos Hanzo and Xiaodong Wang, Lajos Hanzo and Li Ping, Lajos Hanzo and Guosen Yue, Zheng-Guang Wu and Jun Cheng, Xiaodong Wang and Li Ping, Xiaodong Wang and Guosen Yue, Xiaodong Wang and Jun Cheng, Meilin He and Jun Cheng, Jun Cheng and Li Ping, Jun Cheng and Guosen Yue, Li Ping and Guosen Yue.\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\": \"R\\u00fcdiger L. Urbanke\", \"id\": 151138}, {\"name\": \"Guanghui Song\", \"id\": 306627}, {\"name\": \"Yuta Tsujii\", \"id\": 306628}, {\"name\": \"Yoichiro Watanabe\", \"id\": 306629}, {\"name\": \"Ping Li\", \"id\": 35143}, {\"name\": \"Lajos Hanzo\", \"id\": 122248}, {\"name\": \"Zheng-Guang Wu\", \"id\": 209961}, {\"name\": \"Xiaodong Wang\", \"id\": 9070}, {\"name\": \"Meilin He\", \"id\": 836498}, {\"name\": \"Li Ping\", \"id\": 199900}, {\"name\": \"Vincenzo Lottici\", \"id\": 255060}, {\"name\": \"Jun Cheng\", \"id\": 50135}, {\"name\": \"Tianbin Wo\", \"id\": 233244}, {\"name\": \"Guosen Yue\", \"id\": 258014}], \"links\": [{\"source\": 151138, \"target\": 9070}, {\"source\": 151138, \"target\": 50135}, {\"source\": 151138, \"target\": 122248}, {\"source\": 151138, \"target\": 199900}, {\"source\": 151138, \"target\": 258014}, {\"source\": 151138, \"target\": 306627}, {\"source\": 151138, \"target\": 306629}, {\"source\": 306627, \"target\": 50135}, {\"source\": 306627, \"target\": 9070}, {\"source\": 306627, \"target\": 35143}, {\"source\": 306627, \"target\": 122248}, {\"source\": 306627, \"target\": 199900}, {\"source\": 306627, \"target\": 233244}, {\"source\": 306627, \"target\": 258014}, {\"source\": 306627, \"target\": 306628}, {\"source\": 306627, \"target\": 306629}, {\"source\": 306627, \"target\": 836498}, {\"source\": 306628, \"target\": 50135}, {\"source\": 306628, \"target\": 9070}, {\"source\": 306628, \"target\": 199900}, {\"source\": 306628, \"target\": 306629}, {\"source\": 306629, \"target\": 50135}, {\"source\": 306629, \"target\": 9070}, {\"source\": 306629, \"target\": 122248}, {\"source\": 306629, \"target\": 199900}, {\"source\": 306629, \"target\": 836498}, {\"source\": 35143, \"target\": 50135}, {\"source\": 122248, \"target\": 50135}, {\"source\": 122248, \"target\": 9070}, {\"source\": 122248, \"target\": 199900}, {\"source\": 122248, \"target\": 233244}, {\"source\": 122248, \"target\": 258014}, {\"source\": 209961, \"target\": 50135}, {\"source\": 9070, \"target\": 199900}, {\"source\": 9070, \"target\": 258014}, {\"source\": 9070, \"target\": 50135}, {\"source\": 836498, \"target\": 50135}, {\"source\": 199900, \"target\": 50135}, {\"source\": 199900, \"target\": 258014}, {\"source\": 199900, \"target\": 233244}, {\"source\": 50135, \"target\": 233244}, {\"source\": 50135, \"target\": 258014}]}",
"id": 543,
"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üdiger L. Urbanke, Guanghui Song, Yuta Tsujii, Yoichiro Watanabe, Tianbin Wo, Ping Li, Lajos Hanzo, Zheng-Guang Wu, Xiaodong Wang, Meilin He, Vincenzo Lottici, Jun Cheng, Li Ping, Guosen Yue\n- Research collaborations between these authors: Rüdiger L. Urbanke and Xiaodong Wang, Rüdiger L. Urbanke and Jun Cheng, Rüdiger L. Urbanke and Lajos Hanzo, Rüdiger L. Urbanke and Li Ping, Rüdiger L. Urbanke and Guosen Yue, Rüdiger L. Urbanke and Guanghui Song, Rüdiger L. Urbanke and Yoichiro Watanabe, Guanghui Song and Jun Cheng, Guanghui Song and Xiaodong Wang, Guanghui Song and Ping Li, Guanghui Song and Lajos Hanzo, Guanghui Song and Li Ping, Guanghui Song and Tianbin Wo, Guanghui Song and Guosen Yue, Guanghui Song and Yuta Tsujii, Guanghui Song and Yoichiro Watanabe, Guanghui Song and Meilin He, Yuta Tsujii and Jun Cheng, Yuta Tsujii and Xiaodong Wang, Yuta Tsujii and Li Ping, Yuta Tsujii and Yoichiro Watanabe, Yoichiro Watanabe and Jun Cheng, Yoichiro Watanabe and Xiaodong Wang, Yoichiro Watanabe and Lajos Hanzo, Yoichiro Watanabe and Li Ping, Yoichiro Watanabe and Meilin He, Tianbin Wo and Jun Cheng, Tianbin Wo and Lajos Hanzo, Tianbin Wo and Li Ping, Ping Li and Jun Cheng, Lajos Hanzo and Jun Cheng, Lajos Hanzo and Xiaodong Wang, Lajos Hanzo and Li Ping, Lajos Hanzo and Guosen Yue, Zheng-Guang Wu and Jun Cheng, Xiaodong Wang and Li Ping, Xiaodong Wang and Guosen Yue, Xiaodong Wang and Jun Cheng, Meilin He and Jun Cheng, Jun Cheng and Li Ping, Jun Cheng and Guosen Yue, Li Ping and Guosen Yue.\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: Zhen Gao, Rong Wang, Wai Sun Don, Yufeng Shi, Bruno Costa, Shuhai Zhang, Khosro Shahbazi, Tao Xiong, Xiangxiong Zhang, Jean-Piero Suarez, Hui Feng, Yan Guo, Wai-Sun Don, Chi-Wang Shu\n- Research collaborations between these authors: Zhen Gao and Chi-Wang Shu, Zhen Gao and Bruno Costa, Zhen Gao and Wai Sun Don, Rong Wang and Chi-Wang Shu, Rong Wang and Hui Feng, Rong Wang and Bruno Costa, Rong Wang and Wai Sun Don, Wai Sun Don and Yan Guo, Wai Sun Don and Tao Xiong, Wai Sun Don and Hui Feng, Wai Sun Don and Wai-Sun Don, Wai Sun Don and Yufeng Shi, Wai Sun Don and Bruno Costa, Wai Sun Don and Jean-Piero Suarez, Wai Sun Don and Khosro Shahbazi, Yufeng Shi and Tao Xiong, Yufeng Shi and Chi-Wang Shu, Yufeng Shi and Bruno Costa, Yufeng Shi and Xiangxiong Zhang, Yufeng Shi and Shuhai Zhang, Bruno Costa and Yan Guo, Bruno Costa and Tao Xiong, Bruno Costa and Hui Feng, Bruno Costa and Wai-Sun Don, Bruno Costa and Jean-Piero Suarez, Bruno Costa and Khosro Shahbazi, Shuhai Zhang and Yan Guo, Shuhai Zhang and Chi-Wang Shu, Khosro Shahbazi and Chi-Wang Shu, Khosro Shahbazi and Xiangxiong Zhang, Tao Xiong and Yan Guo, Tao Xiong and Chi-Wang Shu, Tao Xiong and Xiangxiong Zhang, Xiangxiong Zhang and Yan Guo, Xiangxiong Zhang and Chi-Wang Shu, Hui Feng and Chi-Wang Shu, Yan Guo and Chi-Wang Shu, Wai-Sun Don and Chi-Wang Shu.\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\": \"Zhen Gao\", \"id\": 152774}, {\"name\": \"Rong Wang\", \"id\": 43270}, {\"name\": \"Wai Sun Don\", \"id\": 717641}, {\"name\": \"Yufeng Shi\", \"id\": 597610}, {\"name\": \"Bruno Costa\", \"id\": 226219}, {\"name\": \"Shuhai Zhang\", \"id\": 668905}, {\"name\": \"Khosro Shahbazi\", \"id\": 1050825}, {\"name\": \"Tao Xiong\", \"id\": 115987}, {\"name\": \"Xiangxiong Zhang\", \"id\": 418676}, {\"name\": \"Jean-Piero Suarez\", \"id\": 913716}, {\"name\": \"Hui Feng\", \"id\": 214107}, {\"name\": \"Yan Guo\", \"id\": 50268}, {\"name\": \"Wai-Sun Don\", \"id\": 543581}, {\"name\": \"Chi-Wang Shu\", \"id\": 201182}], \"links\": [{\"source\": 152774, \"target\": 201182}, {\"source\": 152774, \"target\": 226219}, {\"source\": 152774, \"target\": 717641}, {\"source\": 43270, \"target\": 201182}, {\"source\": 43270, \"target\": 214107}, {\"source\": 43270, \"target\": 226219}, {\"source\": 43270, \"target\": 717641}, {\"source\": 717641, \"target\": 50268}, {\"source\": 717641, \"target\": 115987}, {\"source\": 717641, \"target\": 214107}, {\"source\": 717641, \"target\": 543581}, {\"source\": 717641, \"target\": 597610}, {\"source\": 717641, \"target\": 226219}, {\"source\": 717641, \"target\": 913716}, {\"source\": 717641, \"target\": 1050825}, {\"source\": 597610, \"target\": 115987}, {\"source\": 597610, \"target\": 201182}, {\"source\": 597610, \"target\": 226219}, {\"source\": 597610, \"target\": 418676}, {\"source\": 597610, \"target\": 668905}, {\"source\": 226219, \"target\": 50268}, {\"source\": 226219, \"target\": 115987}, {\"source\": 226219, \"target\": 214107}, {\"source\": 226219, \"target\": 543581}, {\"source\": 226219, \"target\": 913716}, {\"source\": 226219, \"target\": 1050825}, {\"source\": 668905, \"target\": 50268}, {\"source\": 668905, \"target\": 201182}, {\"source\": 1050825, \"target\": 201182}, {\"source\": 1050825, \"target\": 418676}, {\"source\": 115987, \"target\": 50268}, {\"source\": 115987, \"target\": 201182}, {\"source\": 115987, \"target\": 418676}, {\"source\": 418676, \"target\": 50268}, {\"source\": 418676, \"target\": 201182}, {\"source\": 214107, \"target\": 201182}, {\"source\": 50268, \"target\": 201182}, {\"source\": 543581, \"target\": 201182}]}",
"id": 107,
"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: Zhen Gao, Rong Wang, Wai Sun Don, Yufeng Shi, Bruno Costa, Shuhai Zhang, Khosro Shahbazi, Tao Xiong, Xiangxiong Zhang, Jean-Piero Suarez, Hui Feng, Yan Guo, Wai-Sun Don, Chi-Wang Shu\n- Research collaborations between these authors: Zhen Gao and Chi-Wang Shu, Zhen Gao and Bruno Costa, Zhen Gao and Wai Sun Don, Rong Wang and Chi-Wang Shu, Rong Wang and Hui Feng, Rong Wang and Bruno Costa, Rong Wang and Wai Sun Don, Wai Sun Don and Yan Guo, Wai Sun Don and Tao Xiong, Wai Sun Don and Hui Feng, Wai Sun Don and Wai-Sun Don, Wai Sun Don and Yufeng Shi, Wai Sun Don and Bruno Costa, Wai Sun Don and Jean-Piero Suarez, Wai Sun Don and Khosro Shahbazi, Yufeng Shi and Tao Xiong, Yufeng Shi and Chi-Wang Shu, Yufeng Shi and Bruno Costa, Yufeng Shi and Xiangxiong Zhang, Yufeng Shi and Shuhai Zhang, Bruno Costa and Yan Guo, Bruno Costa and Tao Xiong, Bruno Costa and Hui Feng, Bruno Costa and Wai-Sun Don, Bruno Costa and Jean-Piero Suarez, Bruno Costa and Khosro Shahbazi, Shuhai Zhang and Yan Guo, Shuhai Zhang and Chi-Wang Shu, Khosro Shahbazi and Chi-Wang Shu, Khosro Shahbazi and Xiangxiong Zhang, Tao Xiong and Yan Guo, Tao Xiong and Chi-Wang Shu, Tao Xiong and Xiangxiong Zhang, Xiangxiong Zhang and Yan Guo, Xiangxiong Zhang and Chi-Wang Shu, Hui Feng and Chi-Wang Shu, Yan Guo and Chi-Wang Shu, Wai-Sun Don and Chi-Wang Shu.\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: Luca Cardelli, Cassio Polpo de Campos, John Grant, Edmund M. Clarke, Xiaozhong Liu, Rocco De Nicola, Paolo Milazzo, Walter Fontana, Anthony G. Cohn, Júlia Zappe, Alon Y. Halevy, V. S. Subrahmanian, Francesco Parisi, Dimitris Papadias\n- Research collaborations between these authors: Luca Cardelli and Rocco De Nicola, Luca Cardelli and Paolo Milazzo, Luca Cardelli and Walter Fontana, Luca Cardelli and Júlia Zappe, John Grant and V. S. Subrahmanian, John Grant and Anthony G. Cohn, John Grant and Alon Y. Halevy, John Grant and Francesco Parisi, John Grant and Dimitris Papadias, John Grant and Júlia Zappe, Edmund M. Clarke and Paolo Milazzo, Rocco De Nicola and Júlia Zappe, Anthony G. Cohn and V. S. Subrahmanian, Anthony G. Cohn and Francesco Parisi, Júlia Zappe and V. S. Subrahmanian, Júlia Zappe and Francesco Parisi, Alon Y. Halevy and V. S. Subrahmanian, Alon Y. Halevy and Dimitris Papadias, Alon Y. Halevy and Francesco Parisi, V. S. Subrahmanian and Francesco Parisi, Francesco Parisi and Dimitris Papadias.\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\": \"Luca Cardelli\", \"id\": 162083}, {\"name\": \"Cassio Polpo de Campos\", \"id\": 10279}, {\"name\": \"John Grant\", \"id\": 33003}, {\"name\": \"Edmund M. Clarke\", \"id\": 31438}, {\"name\": \"V. S. Subrahmanian\", \"id\": 22684}, {\"name\": \"Xiaozhong Liu\", \"id\": 244628}, {\"name\": \"Rocco De Nicola\", \"id\": 30901}, {\"name\": \"Anthony G. Cohn\", \"id\": 19639}, {\"name\": \"Walter Fontana\", \"id\": 375096}, {\"name\": \"J\\u00falia Zappe\", \"id\": 259770}, {\"name\": \"Alon Y. Halevy\", \"id\": 29531}, {\"name\": \"Paolo Milazzo\", \"id\": 37212}, {\"name\": \"Francesco Parisi\", \"id\": 52541}, {\"name\": \"Dimitris Papadias\", \"id\": 199263}], \"links\": [{\"source\": 162083, \"target\": 30901}, {\"source\": 162083, \"target\": 37212}, {\"source\": 162083, \"target\": 375096}, {\"source\": 162083, \"target\": 259770}, {\"source\": 33003, \"target\": 22684}, {\"source\": 33003, \"target\": 19639}, {\"source\": 33003, \"target\": 29531}, {\"source\": 33003, \"target\": 52541}, {\"source\": 33003, \"target\": 199263}, {\"source\": 33003, \"target\": 259770}, {\"source\": 31438, \"target\": 37212}, {\"source\": 22684, \"target\": 19639}, {\"source\": 22684, \"target\": 29531}, {\"source\": 22684, \"target\": 52541}, {\"source\": 22684, \"target\": 259770}, {\"source\": 30901, \"target\": 259770}, {\"source\": 19639, \"target\": 52541}, {\"source\": 259770, \"target\": 52541}, {\"source\": 29531, \"target\": 199263}, {\"source\": 29531, \"target\": 52541}, {\"source\": 52541, \"target\": 199263}]}",
"id": 259,
"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: Luca Cardelli, Cassio Polpo de Campos, John Grant, Edmund M. Clarke, Xiaozhong Liu, Rocco De Nicola, Paolo Milazzo, Walter Fontana, Anthony G. Cohn, Júlia Zappe, Alon Y. Halevy, V. S. Subrahmanian, Francesco Parisi, Dimitris Papadias\n- Research collaborations between these authors: Luca Cardelli and Rocco De Nicola, Luca Cardelli and Paolo Milazzo, Luca Cardelli and Walter Fontana, Luca Cardelli and Júlia Zappe, John Grant and V. S. Subrahmanian, John Grant and Anthony G. Cohn, John Grant and Alon Y. Halevy, John Grant and Francesco Parisi, John Grant and Dimitris Papadias, John Grant and Júlia Zappe, Edmund M. Clarke and Paolo Milazzo, Rocco De Nicola and Júlia Zappe, Anthony G. Cohn and V. S. Subrahmanian, Anthony G. Cohn and Francesco Parisi, Júlia Zappe and V. S. Subrahmanian, Júlia Zappe and Francesco Parisi, Alon Y. Halevy and V. S. Subrahmanian, Alon Y. Halevy and Dimitris Papadias, Alon Y. Halevy and Francesco Parisi, V. S. Subrahmanian and Francesco Parisi, Francesco Parisi and Dimitris Papadias.\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: Douglas L. Arnold, Ganapathy Krishnamurthi, D. Louis Collins, Nicholas Ayache, Christian Barillot, Aaron Carass, Ajay Gupta, Nobutaka Ikeda, Filippo Molinari, Tal Arbel, Luca Saba, Jasjit S. Suri, Bjoern H. Menze, Andrew Nicolaides\n- Research collaborations between these authors: Douglas L. Arnold and Aaron Carass, Douglas L. Arnold and Nicholas Ayache, Douglas L. Arnold and D. Louis Collins, Douglas L. Arnold and Christian Barillot, Douglas L. Arnold and Tal Arbel, Douglas L. Arnold and Ganapathy Krishnamurthi, Ganapathy Krishnamurthi and Ajay Gupta, Ganapathy Krishnamurthi and Andrew Nicolaides, Ganapathy Krishnamurthi and Jasjit S. Suri, Ganapathy Krishnamurthi and Luca Saba, Ganapathy Krishnamurthi and Nobutaka Ikeda, Ganapathy Krishnamurthi and Nicholas Ayache, Ganapathy Krishnamurthi and Bjoern H. Menze, Ganapathy Krishnamurthi and Aaron Carass, Ganapathy Krishnamurthi and D. Louis Collins, Ganapathy Krishnamurthi and Christian Barillot, Ganapathy Krishnamurthi and Tal Arbel, Ganapathy Krishnamurthi and Filippo Molinari, D. Louis Collins and Nicholas Ayache, D. Louis Collins and Bjoern H. Menze, D. Louis Collins and Aaron Carass, D. Louis Collins and Christian Barillot, D. Louis Collins and Tal Arbel, Nicholas Ayache and Bjoern H. Menze, Nicholas Ayache and Aaron Carass, Nicholas Ayache and Tal Arbel, Nicholas Ayache and Christian Barillot, Christian Barillot and Aaron Carass, Christian Barillot and Bjoern H. Menze, Christian Barillot and Tal Arbel, Aaron Carass and Bjoern H. Menze, Aaron Carass and Tal Arbel, Ajay Gupta and Andrew Nicolaides, Ajay Gupta and Jasjit S. Suri, Ajay Gupta and Filippo Molinari, Ajay Gupta and Luca Saba, Ajay Gupta and Nobutaka Ikeda, Nobutaka Ikeda and Andrew Nicolaides, Nobutaka Ikeda and Jasjit S. Suri, Nobutaka Ikeda and Luca Saba, Nobutaka Ikeda and Filippo Molinari, Filippo Molinari and Andrew Nicolaides, Filippo Molinari and Jasjit S. Suri, Filippo Molinari and Luca Saba, Tal Arbel and Bjoern H. Menze, Luca Saba and Andrew Nicolaides, Luca Saba and Jasjit S. Suri, Jasjit S. Suri and Andrew Nicolaides.\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\": \"Douglas L. Arnold\", \"id\": 10720}, {\"name\": \"Ganapathy Krishnamurthi\", \"id\": 807618}, {\"name\": \"D. Louis Collins\", \"id\": 10723}, {\"name\": \"Nicholas Ayache\", \"id\": 740}, {\"name\": \"Christian Barillot\", \"id\": 58213}, {\"name\": \"Aaron Carass\", \"id\": 3911}, {\"name\": \"Nobutaka Ikeda\", \"id\": 733355}, {\"name\": \"Filippo Molinari\", \"id\": 406735}, {\"name\": \"Tal Arbel\", \"id\": 60563}, {\"name\": \"Luca Saba\", \"id\": 440278}, {\"name\": \"Jasjit S. Suri\", \"id\": 290647}, {\"name\": \"Bjoern H. Menze\", \"id\": 1881}, {\"name\": \"Ajay Gupta\", \"id\": 159129}, {\"name\": \"Andrew Nicolaides\", \"id\": 231935}], \"links\": [{\"source\": 10720, \"target\": 3911}, {\"source\": 10720, \"target\": 740}, {\"source\": 10720, \"target\": 10723}, {\"source\": 10720, \"target\": 58213}, {\"source\": 10720, \"target\": 60563}, {\"source\": 10720, \"target\": 807618}, {\"source\": 807618, \"target\": 159129}, {\"source\": 807618, \"target\": 231935}, {\"source\": 807618, \"target\": 290647}, {\"source\": 807618, \"target\": 440278}, {\"source\": 807618, \"target\": 733355}, {\"source\": 807618, \"target\": 740}, {\"source\": 807618, \"target\": 1881}, {\"source\": 807618, \"target\": 3911}, {\"source\": 807618, \"target\": 10723}, {\"source\": 807618, \"target\": 58213}, {\"source\": 807618, \"target\": 60563}, {\"source\": 807618, \"target\": 406735}, {\"source\": 10723, \"target\": 740}, {\"source\": 10723, \"target\": 1881}, {\"source\": 10723, \"target\": 3911}, {\"source\": 10723, \"target\": 58213}, {\"source\": 10723, \"target\": 60563}, {\"source\": 740, \"target\": 1881}, {\"source\": 740, \"target\": 3911}, {\"source\": 740, \"target\": 60563}, {\"source\": 740, \"target\": 58213}, {\"source\": 58213, \"target\": 3911}, {\"source\": 58213, \"target\": 1881}, {\"source\": 58213, \"target\": 60563}, {\"source\": 3911, \"target\": 1881}, {\"source\": 3911, \"target\": 60563}, {\"source\": 733355, \"target\": 159129}, {\"source\": 733355, \"target\": 231935}, {\"source\": 733355, \"target\": 290647}, {\"source\": 733355, \"target\": 440278}, {\"source\": 733355, \"target\": 406735}, {\"source\": 406735, \"target\": 159129}, {\"source\": 406735, \"target\": 231935}, {\"source\": 406735, \"target\": 290647}, {\"source\": 406735, \"target\": 440278}, {\"source\": 60563, \"target\": 1881}, {\"source\": 440278, \"target\": 159129}, {\"source\": 440278, \"target\": 231935}, {\"source\": 440278, \"target\": 290647}, {\"source\": 290647, \"target\": 159129}, {\"source\": 290647, \"target\": 231935}, {\"source\": 159129, \"target\": 231935}]}",
"id": 1519,
"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: Douglas L. Arnold, Ganapathy Krishnamurthi, D. Louis Collins, Nicholas Ayache, Christian Barillot, Aaron Carass, Ajay Gupta, Nobutaka Ikeda, Filippo Molinari, Tal Arbel, Luca Saba, Jasjit S. Suri, Bjoern H. Menze, Andrew Nicolaides\n- Research collaborations between these authors: Douglas L. Arnold and Aaron Carass, Douglas L. Arnold and Nicholas Ayache, Douglas L. Arnold and D. Louis Collins, Douglas L. Arnold and Christian Barillot, Douglas L. Arnold and Tal Arbel, Douglas L. Arnold and Ganapathy Krishnamurthi, Ganapathy Krishnamurthi and Ajay Gupta, Ganapathy Krishnamurthi and Andrew Nicolaides, Ganapathy Krishnamurthi and Jasjit S. Suri, Ganapathy Krishnamurthi and Luca Saba, Ganapathy Krishnamurthi and Nobutaka Ikeda, Ganapathy Krishnamurthi and Nicholas Ayache, Ganapathy Krishnamurthi and Bjoern H. Menze, Ganapathy Krishnamurthi and Aaron Carass, Ganapathy Krishnamurthi and D. Louis Collins, Ganapathy Krishnamurthi and Christian Barillot, Ganapathy Krishnamurthi and Tal Arbel, Ganapathy Krishnamurthi and Filippo Molinari, D. Louis Collins and Nicholas Ayache, D. Louis Collins and Bjoern H. Menze, D. Louis Collins and Aaron Carass, D. Louis Collins and Christian Barillot, D. Louis Collins and Tal Arbel, Nicholas Ayache and Bjoern H. Menze, Nicholas Ayache and Aaron Carass, Nicholas Ayache and Tal Arbel, Nicholas Ayache and Christian Barillot, Christian Barillot and Aaron Carass, Christian Barillot and Bjoern H. Menze, Christian Barillot and Tal Arbel, Aaron Carass and Bjoern H. Menze, Aaron Carass and Tal Arbel, Ajay Gupta and Andrew Nicolaides, Ajay Gupta and Jasjit S. Suri, Ajay Gupta and Filippo Molinari, Ajay Gupta and Luca Saba, Ajay Gupta and Nobutaka Ikeda, Nobutaka Ikeda and Andrew Nicolaides, Nobutaka Ikeda and Jasjit S. Suri, Nobutaka Ikeda and Luca Saba, Nobutaka Ikeda and Filippo Molinari, Filippo Molinari and Andrew Nicolaides, Filippo Molinari and Jasjit S. Suri, Filippo Molinari and Luca Saba, Tal Arbel and Bjoern H. Menze, Luca Saba and Andrew Nicolaides, Luca Saba and Jasjit S. Suri, Jasjit S. Suri and Andrew Nicolaides.\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: Jannick P. Rolland, Moira B. Flanagan, Denise Nicholson, Cali M. Fidopiastis, Jack Maxwell Vice, Heiko Hecht, Chris Berka, Robert S. Kennedy, Kay M. Stanney, Lisa Rebenitsch, Charles B. Owen, Behrang Keshavarz, Ronald H. Stevens, J. Edward Swan\n- Research collaborations between these authors: Jannick P. Rolland and Cali M. Fidopiastis, Jannick P. Rolland and J. Edward Swan, Moira B. Flanagan and Behrang Keshavarz, Moira B. Flanagan and Heiko Hecht, Denise Nicholson and Cali M. Fidopiastis, Cali M. Fidopiastis and Chris Berka, Cali M. Fidopiastis and Kay M. Stanney, Jack Maxwell Vice and Chris Berka, Heiko Hecht and Behrang Keshavarz, Heiko Hecht and Lisa Rebenitsch, Heiko Hecht and Charles B. Owen, Heiko Hecht and Kay M. Stanney, Heiko Hecht and Robert S. Kennedy, Chris Berka and Ronald H. Stevens, Robert S. Kennedy and Behrang Keshavarz, Robert S. Kennedy and Kay M. Stanney, Kay M. Stanney and Behrang Keshavarz, Lisa Rebenitsch and Behrang Keshavarz, Charles B. Owen and J. Edward Swan, Charles B. Owen and Behrang Keshavarz.\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\": \"Jannick P. Rolland\", \"id\": 47872}, {\"name\": \"Moira B. Flanagan\", \"id\": 1030017}, {\"name\": \"Denise Nicholson\", \"id\": 155236}, {\"name\": \"Cali M. Fidopiastis\", \"id\": 8484}, {\"name\": \"Jack Maxwell Vice\", \"id\": 43911}, {\"name\": \"Heiko Hecht\", \"id\": 316808}, {\"name\": \"Chris Berka\", \"id\": 37451}, {\"name\": \"Robert S. Kennedy\", \"id\": 981420}, {\"name\": \"Kay M. Stanney\", \"id\": 101459}, {\"name\": \"Lisa Rebenitsch\", \"id\": 130199}, {\"name\": \"Charles B. Owen\", \"id\": 130200}, {\"name\": \"Behrang Keshavarz\", \"id\": 76441}, {\"name\": \"Ronald H. Stevens\", \"id\": 47070}, {\"name\": \"J. Edward Swan\", \"id\": 58687}], \"links\": [{\"source\": 47872, \"target\": 8484}, {\"source\": 47872, \"target\": 58687}, {\"source\": 1030017, \"target\": 76441}, {\"source\": 1030017, \"target\": 316808}, {\"source\": 155236, \"target\": 8484}, {\"source\": 8484, \"target\": 37451}, {\"source\": 8484, \"target\": 101459}, {\"source\": 43911, \"target\": 37451}, {\"source\": 316808, \"target\": 76441}, {\"source\": 316808, \"target\": 130199}, {\"source\": 316808, \"target\": 130200}, {\"source\": 316808, \"target\": 101459}, {\"source\": 316808, \"target\": 981420}, {\"source\": 37451, \"target\": 47070}, {\"source\": 981420, \"target\": 76441}, {\"source\": 981420, \"target\": 101459}, {\"source\": 101459, \"target\": 76441}, {\"source\": 130199, \"target\": 76441}, {\"source\": 130200, \"target\": 58687}, {\"source\": 130200, \"target\": 76441}]}",
"id": 2607,
"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: Jannick P. Rolland, Moira B. Flanagan, Denise Nicholson, Cali M. Fidopiastis, Jack Maxwell Vice, Heiko Hecht, Chris Berka, Robert S. Kennedy, Kay M. Stanney, Lisa Rebenitsch, Charles B. Owen, Behrang Keshavarz, Ronald H. Stevens, J. Edward Swan\n- Research collaborations between these authors: Jannick P. Rolland and Cali M. Fidopiastis, Jannick P. Rolland and J. Edward Swan, Moira B. Flanagan and Behrang Keshavarz, Moira B. Flanagan and Heiko Hecht, Denise Nicholson and Cali M. Fidopiastis, Cali M. Fidopiastis and Chris Berka, Cali M. Fidopiastis and Kay M. Stanney, Jack Maxwell Vice and Chris Berka, Heiko Hecht and Behrang Keshavarz, Heiko Hecht and Lisa Rebenitsch, Heiko Hecht and Charles B. Owen, Heiko Hecht and Kay M. Stanney, Heiko Hecht and Robert S. Kennedy, Chris Berka and Ronald H. Stevens, Robert S. Kennedy and Behrang Keshavarz, Robert S. Kennedy and Kay M. Stanney, Kay M. Stanney and Behrang Keshavarz, Lisa Rebenitsch and Behrang Keshavarz, Charles B. Owen and J. Edward Swan, Charles B. Owen and Behrang Keshavarz.\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: Juan A. Gómez-Pulido, Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Yun-Chia Liang, Olivier Goldschmidt, Hu-Gon Kim, Bahriye Basturk, Miguel A. Vega-Rodríguez, Juan Antonio Gómez Pulido, M. Fatih Tasgetiren, Jinjiang Yuan, Bahriye Akay, Eli V. Olinick, Juan M. Sánchez-Pérez\n- Research collaborations between these authors: Juan A. Gómez-Pulido and Miguel A. Vega-Rodríguez, Juan A. Gómez-Pulido and Juan M. Sánchez-Pérez, Juan A. Gómez-Pulido and Juan Antonio Gómez Pulido, Juan A. Gómez-Pulido and Anabela Moreira Bernardino, Juan A. Gómez-Pulido and Eugénia Moreira Bernardino, Juan A. Gómez-Pulido and M. Fatih Tasgetiren, Juan A. Gómez-Pulido and Bahriye Akay, Juan A. Gómez-Pulido and Jinjiang Yuan, Juan A. Gómez-Pulido and Yun-Chia Liang, Juan A. Gómez-Pulido and Eli V. Olinick, Juan A. Gómez-Pulido and Olivier Goldschmidt, Juan A. Gómez-Pulido and Hu-Gon Kim, Juan A. Gómez-Pulido and Bahriye Basturk, Anabela Moreira Bernardino and Miguel A. Vega-Rodríguez, Anabela Moreira Bernardino and Juan M. Sánchez-Pérez, Anabela Moreira Bernardino and Juan Antonio Gómez Pulido, Anabela Moreira Bernardino and Eugénia Moreira Bernardino, Anabela Moreira Bernardino and M. Fatih Tasgetiren, Anabela Moreira Bernardino and Bahriye Akay, Anabela Moreira Bernardino and Jinjiang Yuan, Anabela Moreira Bernardino and Yun-Chia Liang, Anabela Moreira Bernardino and Eli V. Olinick, Anabela Moreira Bernardino and Olivier Goldschmidt, Anabela Moreira Bernardino and Hu-Gon Kim, Anabela Moreira Bernardino and Bahriye Basturk, Eugénia Moreira Bernardino and Miguel A. Vega-Rodríguez, Eugénia Moreira Bernardino and Juan M. Sánchez-Pérez, Eugénia Moreira Bernardino and Juan Antonio Gómez Pulido, Eugénia Moreira Bernardino and M. Fatih Tasgetiren, Eugénia Moreira Bernardino and Bahriye Akay, Eugénia Moreira Bernardino and Jinjiang Yuan, Eugénia Moreira Bernardino and Yun-Chia Liang, Eugénia Moreira Bernardino and Eli V. Olinick, Eugénia Moreira Bernardino and Olivier Goldschmidt, Eugénia Moreira Bernardino and Hu-Gon Kim, Eugénia Moreira Bernardino and Bahriye Basturk, Yun-Chia Liang and Miguel A. Vega-Rodríguez, Yun-Chia Liang and Juan M. Sánchez-Pérez, Yun-Chia Liang and M. Fatih Tasgetiren, Yun-Chia Liang and Bahriye Basturk, Olivier Goldschmidt and Miguel A. Vega-Rodríguez, Olivier Goldschmidt and Juan M. Sánchez-Pérez, Hu-Gon Kim and Miguel A. Vega-Rodríguez, Hu-Gon Kim and Juan M. Sánchez-Pérez, Bahriye Basturk and Miguel A. Vega-Rodríguez, Bahriye Basturk and Juan M. Sánchez-Pérez, Bahriye Basturk and M. Fatih Tasgetiren, Bahriye Basturk and Bahriye Akay, Miguel A. Vega-Rodríguez and Juan M. Sánchez-Pérez, Miguel A. Vega-Rodríguez and Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez and M. Fatih Tasgetiren, Miguel A. Vega-Rodríguez and Bahriye Akay, Miguel A. Vega-Rodríguez and Jinjiang Yuan, Miguel A. Vega-Rodríguez and Eli V. Olinick, Juan Antonio Gómez Pulido and Juan M. Sánchez-Pérez, M. Fatih Tasgetiren and Juan M. Sánchez-Pérez, M. Fatih Tasgetiren and Bahriye Akay, Jinjiang Yuan and Juan M. Sánchez-Pérez, Bahriye Akay and Juan M. Sánchez-Pérez, Eli V. Olinick and Juan M. Sánchez-Pérez.\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\": \"Juan A. G\\u00f3mez-Pulido\", \"id\": 13280}, {\"name\": \"Anabela Moreira Bernardino\", \"id\": 50050}, {\"name\": \"Eug\\u00e9nia Moreira Bernardino\", \"id\": 50051}, {\"name\": \"Yun-Chia Liang\", \"id\": 290213}, {\"name\": \"Olivier Goldschmidt\", \"id\": 667816}, {\"name\": \"Hu-Gon Kim\", \"id\": 892747}, {\"name\": \"Bahriye Basturk\", \"id\": 1077325}, {\"name\": \"Miguel A. Vega-Rodr\\u00edguez\", \"id\": 11793}, {\"name\": \"Juan Antonio G\\u00f3mez Pulido\", \"id\": 42034}, {\"name\": \"M. Fatih Tasgetiren\", \"id\": 54963}, {\"name\": \"Jinjiang Yuan\", \"id\": 190424}, {\"name\": \"Bahriye Akay\", \"id\": 96859}, {\"name\": \"Eli V. Olinick\", \"id\": 555196}, {\"name\": \"Juan M. S\\u00e1nchez-P\\u00e9rez\", \"id\": 13279}], \"links\": [{\"source\": 13280, \"target\": 11793}, {\"source\": 13280, \"target\": 13279}, {\"source\": 13280, \"target\": 42034}, {\"source\": 13280, \"target\": 50050}, {\"source\": 13280, \"target\": 50051}, {\"source\": 13280, \"target\": 54963}, {\"source\": 13280, \"target\": 96859}, {\"source\": 13280, \"target\": 190424}, {\"source\": 13280, \"target\": 290213}, {\"source\": 13280, \"target\": 555196}, {\"source\": 13280, \"target\": 667816}, {\"source\": 13280, \"target\": 892747}, {\"source\": 13280, \"target\": 1077325}, {\"source\": 50050, \"target\": 11793}, {\"source\": 50050, \"target\": 13279}, {\"source\": 50050, \"target\": 42034}, {\"source\": 50050, \"target\": 50051}, {\"source\": 50050, \"target\": 54963}, {\"source\": 50050, \"target\": 96859}, {\"source\": 50050, \"target\": 190424}, {\"source\": 50050, \"target\": 290213}, {\"source\": 50050, \"target\": 555196}, {\"source\": 50050, \"target\": 667816}, {\"source\": 50050, \"target\": 892747}, {\"source\": 50050, \"target\": 1077325}, {\"source\": 50051, \"target\": 11793}, {\"source\": 50051, \"target\": 13279}, {\"source\": 50051, \"target\": 42034}, {\"source\": 50051, \"target\": 54963}, {\"source\": 50051, \"target\": 96859}, {\"source\": 50051, \"target\": 190424}, {\"source\": 50051, \"target\": 290213}, {\"source\": 50051, \"target\": 555196}, {\"source\": 50051, \"target\": 667816}, {\"source\": 50051, \"target\": 892747}, {\"source\": 50051, \"target\": 1077325}, {\"source\": 290213, \"target\": 11793}, {\"source\": 290213, \"target\": 13279}, {\"source\": 290213, \"target\": 54963}, {\"source\": 290213, \"target\": 1077325}, {\"source\": 667816, \"target\": 11793}, {\"source\": 667816, \"target\": 13279}, {\"source\": 892747, \"target\": 11793}, {\"source\": 892747, \"target\": 13279}, {\"source\": 1077325, \"target\": 11793}, {\"source\": 1077325, \"target\": 13279}, {\"source\": 1077325, \"target\": 54963}, {\"source\": 1077325, \"target\": 96859}, {\"source\": 11793, \"target\": 13279}, {\"source\": 11793, \"target\": 42034}, {\"source\": 11793, \"target\": 54963}, {\"source\": 11793, \"target\": 96859}, {\"source\": 11793, \"target\": 190424}, {\"source\": 11793, \"target\": 555196}, {\"source\": 42034, \"target\": 13279}, {\"source\": 54963, \"target\": 13279}, {\"source\": 54963, \"target\": 96859}, {\"source\": 190424, \"target\": 13279}, {\"source\": 96859, \"target\": 13279}, {\"source\": 555196, \"target\": 13279}]}",
"id": 1958,
"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: Juan A. Gómez-Pulido, Anabela Moreira Bernardino, Eugénia Moreira Bernardino, Yun-Chia Liang, Olivier Goldschmidt, Hu-Gon Kim, Bahriye Basturk, Miguel A. Vega-Rodríguez, Juan Antonio Gómez Pulido, M. Fatih Tasgetiren, Jinjiang Yuan, Bahriye Akay, Eli V. Olinick, Juan M. Sánchez-Pérez\n- Research collaborations between these authors: Juan A. Gómez-Pulido and Miguel A. Vega-Rodríguez, Juan A. Gómez-Pulido and Juan M. Sánchez-Pérez, Juan A. Gómez-Pulido and Juan Antonio Gómez Pulido, Juan A. Gómez-Pulido and Anabela Moreira Bernardino, Juan A. Gómez-Pulido and Eugénia Moreira Bernardino, Juan A. Gómez-Pulido and M. Fatih Tasgetiren, Juan A. Gómez-Pulido and Bahriye Akay, Juan A. Gómez-Pulido and Jinjiang Yuan, Juan A. Gómez-Pulido and Yun-Chia Liang, Juan A. Gómez-Pulido and Eli V. Olinick, Juan A. Gómez-Pulido and Olivier Goldschmidt, Juan A. Gómez-Pulido and Hu-Gon Kim, Juan A. Gómez-Pulido and Bahriye Basturk, Anabela Moreira Bernardino and Miguel A. Vega-Rodríguez, Anabela Moreira Bernardino and Juan M. Sánchez-Pérez, Anabela Moreira Bernardino and Juan Antonio Gómez Pulido, Anabela Moreira Bernardino and Eugénia Moreira Bernardino, Anabela Moreira Bernardino and M. Fatih Tasgetiren, Anabela Moreira Bernardino and Bahriye Akay, Anabela Moreira Bernardino and Jinjiang Yuan, Anabela Moreira Bernardino and Yun-Chia Liang, Anabela Moreira Bernardino and Eli V. Olinick, Anabela Moreira Bernardino and Olivier Goldschmidt, Anabela Moreira Bernardino and Hu-Gon Kim, Anabela Moreira Bernardino and Bahriye Basturk, Eugénia Moreira Bernardino and Miguel A. Vega-Rodríguez, Eugénia Moreira Bernardino and Juan M. Sánchez-Pérez, Eugénia Moreira Bernardino and Juan Antonio Gómez Pulido, Eugénia Moreira Bernardino and M. Fatih Tasgetiren, Eugénia Moreira Bernardino and Bahriye Akay, Eugénia Moreira Bernardino and Jinjiang Yuan, Eugénia Moreira Bernardino and Yun-Chia Liang, Eugénia Moreira Bernardino and Eli V. Olinick, Eugénia Moreira Bernardino and Olivier Goldschmidt, Eugénia Moreira Bernardino and Hu-Gon Kim, Eugénia Moreira Bernardino and Bahriye Basturk, Yun-Chia Liang and Miguel A. Vega-Rodríguez, Yun-Chia Liang and Juan M. Sánchez-Pérez, Yun-Chia Liang and M. Fatih Tasgetiren, Yun-Chia Liang and Bahriye Basturk, Olivier Goldschmidt and Miguel A. Vega-Rodríguez, Olivier Goldschmidt and Juan M. Sánchez-Pérez, Hu-Gon Kim and Miguel A. Vega-Rodríguez, Hu-Gon Kim and Juan M. Sánchez-Pérez, Bahriye Basturk and Miguel A. Vega-Rodríguez, Bahriye Basturk and Juan M. Sánchez-Pérez, Bahriye Basturk and M. Fatih Tasgetiren, Bahriye Basturk and Bahriye Akay, Miguel A. Vega-Rodríguez and Juan M. Sánchez-Pérez, Miguel A. Vega-Rodríguez and Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez and M. Fatih Tasgetiren, Miguel A. Vega-Rodríguez and Bahriye Akay, Miguel A. Vega-Rodríguez and Jinjiang Yuan, Miguel A. Vega-Rodríguez and Eli V. Olinick, Juan Antonio Gómez Pulido and Juan M. Sánchez-Pérez, M. Fatih Tasgetiren and Juan M. Sánchez-Pérez, M. Fatih Tasgetiren and Bahriye Akay, Jinjiang Yuan and Juan M. Sánchez-Pérez, Bahriye Akay and Juan M. Sánchez-Pérez, Eli V. Olinick and Juan M. Sánchez-Pérez.\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: Ido Roth, Eyal Kolman, Hirosato Seki, Masaharu Mizumoto, Sushmita Mitra, Yoichi Hayashi, Michael Margaliot, Chee Peng Lim, Shahaf Duenyas, José Manuel Benítez, Eviatar Tron, Juan Luis Castro, Carlos Javier Mantas, David Holcman\n- Research collaborations between these authors: Ido Roth and Michael Margaliot, Ido Roth and Eyal Kolman, Eyal Kolman and Chee Peng Lim, Eyal Kolman and Shahaf Duenyas, Eyal Kolman and Michael Margaliot, Eyal Kolman and Juan Luis Castro, Eyal Kolman and Carlos Javier Mantas, Eyal Kolman and José Manuel Benítez, Eyal Kolman and Yoichi Hayashi, Eyal Kolman and Sushmita Mitra, Eyal Kolman and Eviatar Tron, Eyal Kolman and Hirosato Seki, Eyal Kolman and Masaharu Mizumoto, Hirosato Seki and Chee Peng Lim, Hirosato Seki and Juan Luis Castro, Hirosato Seki and Carlos Javier Mantas, Hirosato Seki and José Manuel Benítez, Hirosato Seki and Michael Margaliot, Hirosato Seki and Masaharu Mizumoto, Masaharu Mizumoto and Chee Peng Lim, Masaharu Mizumoto and Juan Luis Castro, Masaharu Mizumoto and Carlos Javier Mantas, Masaharu Mizumoto and José Manuel Benítez, Masaharu Mizumoto and Michael Margaliot, Sushmita Mitra and Yoichi Hayashi, Sushmita Mitra and Michael Margaliot, Yoichi Hayashi and Michael Margaliot, Michael Margaliot and Chee Peng Lim, Michael Margaliot and Shahaf Duenyas, Michael Margaliot and Juan Luis Castro, Michael Margaliot and Carlos Javier Mantas, Michael Margaliot and José Manuel Benítez, Michael Margaliot and David Holcman, Michael Margaliot and Eviatar Tron, José Manuel Benítez and Carlos Javier Mantas, José Manuel Benítez and Juan Luis Castro, Juan Luis Castro and Carlos Javier Mantas.\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\": \"Ido Roth\", \"id\": 277217}, {\"name\": \"Eyal Kolman\", \"id\": 413281}, {\"name\": \"Hirosato Seki\", \"id\": 486116}, {\"name\": \"Masaharu Mizumoto\", \"id\": 486117}, {\"name\": \"Sushmita Mitra\", \"id\": 127593}, {\"name\": \"Yoichi Hayashi\", \"id\": 121614}, {\"name\": \"Michael Margaliot\", \"id\": 194639}, {\"name\": \"Chee Peng Lim\", \"id\": 110895}, {\"name\": \"Shahaf Duenyas\", \"id\": 194638}, {\"name\": \"Jos\\u00e9 Manuel Ben\\u00edtez\", \"id\": 60404}, {\"name\": \"Eviatar Tron\", \"id\": 941205}, {\"name\": \"Juan Luis Castro\", \"id\": 14613}, {\"name\": \"Carlos Javier Mantas\", \"id\": 14615}, {\"name\": \"David Holcman\", \"id\": 260602}], \"links\": [{\"source\": 277217, \"target\": 194639}, {\"source\": 277217, \"target\": 413281}, {\"source\": 413281, \"target\": 110895}, {\"source\": 413281, \"target\": 194638}, {\"source\": 413281, \"target\": 194639}, {\"source\": 413281, \"target\": 14613}, {\"source\": 413281, \"target\": 14615}, {\"source\": 413281, \"target\": 60404}, {\"source\": 413281, \"target\": 121614}, {\"source\": 413281, \"target\": 127593}, {\"source\": 413281, \"target\": 941205}, {\"source\": 413281, \"target\": 486116}, {\"source\": 413281, \"target\": 486117}, {\"source\": 486116, \"target\": 110895}, {\"source\": 486116, \"target\": 14613}, {\"source\": 486116, \"target\": 14615}, {\"source\": 486116, \"target\": 60404}, {\"source\": 486116, \"target\": 194639}, {\"source\": 486116, \"target\": 486117}, {\"source\": 486117, \"target\": 110895}, {\"source\": 486117, \"target\": 14613}, {\"source\": 486117, \"target\": 14615}, {\"source\": 486117, \"target\": 60404}, {\"source\": 486117, \"target\": 194639}, {\"source\": 127593, \"target\": 121614}, {\"source\": 127593, \"target\": 194639}, {\"source\": 121614, \"target\": 194639}, {\"source\": 194639, \"target\": 110895}, {\"source\": 194639, \"target\": 194638}, {\"source\": 194639, \"target\": 14613}, {\"source\": 194639, \"target\": 14615}, {\"source\": 194639, \"target\": 60404}, {\"source\": 194639, \"target\": 260602}, {\"source\": 194639, \"target\": 941205}, {\"source\": 60404, \"target\": 14615}, {\"source\": 60404, \"target\": 14613}, {\"source\": 14613, \"target\": 14615}]}",
"id": 2737,
"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: Ido Roth, Eyal Kolman, Hirosato Seki, Masaharu Mizumoto, Sushmita Mitra, Yoichi Hayashi, Michael Margaliot, Chee Peng Lim, Shahaf Duenyas, José Manuel Benítez, Eviatar Tron, Juan Luis Castro, Carlos Javier Mantas, David Holcman\n- Research collaborations between these authors: Ido Roth and Michael Margaliot, Ido Roth and Eyal Kolman, Eyal Kolman and Chee Peng Lim, Eyal Kolman and Shahaf Duenyas, Eyal Kolman and Michael Margaliot, Eyal Kolman and Juan Luis Castro, Eyal Kolman and Carlos Javier Mantas, Eyal Kolman and José Manuel Benítez, Eyal Kolman and Yoichi Hayashi, Eyal Kolman and Sushmita Mitra, Eyal Kolman and Eviatar Tron, Eyal Kolman and Hirosato Seki, Eyal Kolman and Masaharu Mizumoto, Hirosato Seki and Chee Peng Lim, Hirosato Seki and Juan Luis Castro, Hirosato Seki and Carlos Javier Mantas, Hirosato Seki and José Manuel Benítez, Hirosato Seki and Michael Margaliot, Hirosato Seki and Masaharu Mizumoto, Masaharu Mizumoto and Chee Peng Lim, Masaharu Mizumoto and Juan Luis Castro, Masaharu Mizumoto and Carlos Javier Mantas, Masaharu Mizumoto and José Manuel Benítez, Masaharu Mizumoto and Michael Margaliot, Sushmita Mitra and Yoichi Hayashi, Sushmita Mitra and Michael Margaliot, Yoichi Hayashi and Michael Margaliot, Michael Margaliot and Chee Peng Lim, Michael Margaliot and Shahaf Duenyas, Michael Margaliot and Juan Luis Castro, Michael Margaliot and Carlos Javier Mantas, Michael Margaliot and José Manuel Benítez, Michael Margaliot and David Holcman, Michael Margaliot and Eviatar Tron, José Manuel Benítez and Carlos Javier Mantas, José Manuel Benítez and Juan Luis Castro, Juan Luis Castro and Carlos Javier Mantas.\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: Yves Le Traon, Charles J. Colbourn, Paulo Cesar Masiero, Jackson A. Prado Lima, Christopher Henard, Mark Harman, Jacques Klein, Silvia Regina Vergilio, Aurora Pozo, Gilles Perrouin, Edmund K. Burke, Myra B. Cohen, Mike Papadakis, André Carlos Ponce Leon Ferreira de Carvalho\n- Research collaborations between these authors: Yves Le Traon and Mark Harman, Yves Le Traon and Silvia Regina Vergilio, Yves Le Traon and Aurora Pozo, Yves Le Traon and Charles J. Colbourn, Yves Le Traon and Mike Papadakis, Yves Le Traon and Myra B. Cohen, Yves Le Traon and Jacques Klein, Yves Le Traon and Christopher Henard, Yves Le Traon and Gilles Perrouin, Yves Le Traon and Paulo Cesar Masiero, Yves Le Traon and Jackson A. Prado Lima, Charles J. Colbourn and Myra B. Cohen, Charles J. Colbourn and Mark Harman, Charles J. Colbourn and Mike Papadakis, Charles J. Colbourn and Jacques Klein, Charles J. Colbourn and Christopher Henard, Charles J. Colbourn and Gilles Perrouin, Charles J. Colbourn and Edmund K. Burke, Paulo Cesar Masiero and Silvia Regina Vergilio, Paulo Cesar Masiero and Aurora Pozo, Jackson A. Prado Lima and Mark Harman, Jackson A. Prado Lima and Silvia Regina Vergilio, Jackson A. Prado Lima and Aurora Pozo, Jackson A. Prado Lima and Mike Papadakis, Jackson A. Prado Lima and Myra B. Cohen, Jackson A. Prado Lima and Jacques Klein, Jackson A. Prado Lima and Christopher Henard, Jackson A. Prado Lima and Gilles Perrouin, Jackson A. Prado Lima and Edmund K. Burke, Christopher Henard and Mark Harman, Christopher Henard and Silvia Regina Vergilio, Christopher Henard and Aurora Pozo, Christopher Henard and Mike Papadakis, Christopher Henard and Jacques Klein, Christopher Henard and Myra B. Cohen, Christopher Henard and Gilles Perrouin, Mark Harman and Silvia Regina Vergilio, Mark Harman and Aurora Pozo, Mark Harman and Mike Papadakis, Mark Harman and Myra B. Cohen, Mark Harman and Jacques Klein, Mark Harman and Gilles Perrouin, Mark Harman and Edmund K. Burke, Jacques Klein and Silvia Regina Vergilio, Jacques Klein and Aurora Pozo, Jacques Klein and Mike Papadakis, Jacques Klein and Myra B. Cohen, Jacques Klein and Gilles Perrouin, Silvia Regina Vergilio and Aurora Pozo, Silvia Regina Vergilio and Mike Papadakis, Silvia Regina Vergilio and Myra B. Cohen, Silvia Regina Vergilio and André Carlos Ponce Leon Ferreira de Carvalho, Silvia Regina Vergilio and Gilles Perrouin, Silvia Regina Vergilio and Edmund K. Burke, Aurora Pozo and Mike Papadakis, Aurora Pozo and Myra B. Cohen, Aurora Pozo and André Carlos Ponce Leon Ferreira de Carvalho, Aurora Pozo and Gilles Perrouin, Aurora Pozo and Edmund K. Burke, Gilles Perrouin and Mike Papadakis, Gilles Perrouin and Myra B. Cohen, Edmund K. Burke and Myra B. Cohen, Myra B. Cohen and Mike Papadakis.\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\": \"Yves Le Traon\", \"id\": 27233}, {\"name\": \"Charles J. Colbourn\", \"id\": 6884}, {\"name\": \"Paulo Cesar Masiero\", \"id\": 110248}, {\"name\": \"Jackson A. Prado Lima\", \"id\": 1282058}, {\"name\": \"Christopher Henard\", \"id\": 106986}, {\"name\": \"Mark Harman\", \"id\": 15308}, {\"name\": \"Jacques Klein\", \"id\": 63178}, {\"name\": \"Silvia Regina Vergilio\", \"id\": 27181}, {\"name\": \"Aurora Pozo\", \"id\": 27182}, {\"name\": \"Gilles Perrouin\", \"id\": 139376}, {\"name\": \"Edmund K. Burke\", \"id\": 162067}, {\"name\": \"Myra B. Cohen\", \"id\": 61077}, {\"name\": \"Mike Papadakis\", \"id\": 42326}, {\"name\": \"Andr\\u00e9 Carlos Ponce Leon Ferreira de Carvalho\", \"id\": 76348}], \"links\": [{\"source\": 27233, \"target\": 15308}, {\"source\": 27233, \"target\": 27181}, {\"source\": 27233, \"target\": 27182}, {\"source\": 27233, \"target\": 6884}, {\"source\": 27233, \"target\": 42326}, {\"source\": 27233, \"target\": 61077}, {\"source\": 27233, \"target\": 63178}, {\"source\": 27233, \"target\": 106986}, {\"source\": 27233, \"target\": 139376}, {\"source\": 27233, \"target\": 110248}, {\"source\": 27233, \"target\": 1282058}, {\"source\": 6884, \"target\": 61077}, {\"source\": 6884, \"target\": 15308}, {\"source\": 6884, \"target\": 42326}, {\"source\": 6884, \"target\": 63178}, {\"source\": 6884, \"target\": 106986}, {\"source\": 6884, \"target\": 139376}, {\"source\": 6884, \"target\": 162067}, {\"source\": 110248, \"target\": 27181}, {\"source\": 110248, \"target\": 27182}, {\"source\": 1282058, \"target\": 15308}, {\"source\": 1282058, \"target\": 27181}, {\"source\": 1282058, \"target\": 27182}, {\"source\": 1282058, \"target\": 42326}, {\"source\": 1282058, \"target\": 61077}, {\"source\": 1282058, \"target\": 63178}, {\"source\": 1282058, \"target\": 106986}, {\"source\": 1282058, \"target\": 139376}, {\"source\": 1282058, \"target\": 162067}, {\"source\": 106986, \"target\": 15308}, {\"source\": 106986, \"target\": 27181}, {\"source\": 106986, \"target\": 27182}, {\"source\": 106986, \"target\": 42326}, {\"source\": 106986, \"target\": 63178}, {\"source\": 106986, \"target\": 61077}, {\"source\": 106986, \"target\": 139376}, {\"source\": 15308, \"target\": 27181}, {\"source\": 15308, \"target\": 27182}, {\"source\": 15308, \"target\": 42326}, {\"source\": 15308, \"target\": 61077}, {\"source\": 15308, \"target\": 63178}, {\"source\": 15308, \"target\": 139376}, {\"source\": 15308, \"target\": 162067}, {\"source\": 63178, \"target\": 27181}, {\"source\": 63178, \"target\": 27182}, {\"source\": 63178, \"target\": 42326}, {\"source\": 63178, \"target\": 61077}, {\"source\": 63178, \"target\": 139376}, {\"source\": 27181, \"target\": 27182}, {\"source\": 27181, \"target\": 42326}, {\"source\": 27181, \"target\": 61077}, {\"source\": 27181, \"target\": 76348}, {\"source\": 27181, \"target\": 139376}, {\"source\": 27181, \"target\": 162067}, {\"source\": 27182, \"target\": 42326}, {\"source\": 27182, \"target\": 61077}, {\"source\": 27182, \"target\": 76348}, {\"source\": 27182, \"target\": 139376}, {\"source\": 27182, \"target\": 162067}, {\"source\": 139376, \"target\": 42326}, {\"source\": 139376, \"target\": 61077}, {\"source\": 162067, \"target\": 61077}, {\"source\": 61077, \"target\": 42326}]}",
"id": 1527,
"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: Yves Le Traon, Charles J. Colbourn, Paulo Cesar Masiero, Jackson A. Prado Lima, Christopher Henard, Mark Harman, Jacques Klein, Silvia Regina Vergilio, Aurora Pozo, Gilles Perrouin, Edmund K. Burke, Myra B. Cohen, Mike Papadakis, André Carlos Ponce Leon Ferreira de Carvalho\n- Research collaborations between these authors: Yves Le Traon and Mark Harman, Yves Le Traon and Silvia Regina Vergilio, Yves Le Traon and Aurora Pozo, Yves Le Traon and Charles J. Colbourn, Yves Le Traon and Mike Papadakis, Yves Le Traon and Myra B. Cohen, Yves Le Traon and Jacques Klein, Yves Le Traon and Christopher Henard, Yves Le Traon and Gilles Perrouin, Yves Le Traon and Paulo Cesar Masiero, Yves Le Traon and Jackson A. Prado Lima, Charles J. Colbourn and Myra B. Cohen, Charles J. Colbourn and Mark Harman, Charles J. Colbourn and Mike Papadakis, Charles J. Colbourn and Jacques Klein, Charles J. Colbourn and Christopher Henard, Charles J. Colbourn and Gilles Perrouin, Charles J. Colbourn and Edmund K. Burke, Paulo Cesar Masiero and Silvia Regina Vergilio, Paulo Cesar Masiero and Aurora Pozo, Jackson A. Prado Lima and Mark Harman, Jackson A. Prado Lima and Silvia Regina Vergilio, Jackson A. Prado Lima and Aurora Pozo, Jackson A. Prado Lima and Mike Papadakis, Jackson A. Prado Lima and Myra B. Cohen, Jackson A. Prado Lima and Jacques Klein, Jackson A. Prado Lima and Christopher Henard, Jackson A. Prado Lima and Gilles Perrouin, Jackson A. Prado Lima and Edmund K. Burke, Christopher Henard and Mark Harman, Christopher Henard and Silvia Regina Vergilio, Christopher Henard and Aurora Pozo, Christopher Henard and Mike Papadakis, Christopher Henard and Jacques Klein, Christopher Henard and Myra B. Cohen, Christopher Henard and Gilles Perrouin, Mark Harman and Silvia Regina Vergilio, Mark Harman and Aurora Pozo, Mark Harman and Mike Papadakis, Mark Harman and Myra B. Cohen, Mark Harman and Jacques Klein, Mark Harman and Gilles Perrouin, Mark Harman and Edmund K. Burke, Jacques Klein and Silvia Regina Vergilio, Jacques Klein and Aurora Pozo, Jacques Klein and Mike Papadakis, Jacques Klein and Myra B. Cohen, Jacques Klein and Gilles Perrouin, Silvia Regina Vergilio and Aurora Pozo, Silvia Regina Vergilio and Mike Papadakis, Silvia Regina Vergilio and Myra B. Cohen, Silvia Regina Vergilio and André Carlos Ponce Leon Ferreira de Carvalho, Silvia Regina Vergilio and Gilles Perrouin, Silvia Regina Vergilio and Edmund K. Burke, Aurora Pozo and Mike Papadakis, Aurora Pozo and Myra B. Cohen, Aurora Pozo and André Carlos Ponce Leon Ferreira de Carvalho, Aurora Pozo and Gilles Perrouin, Aurora Pozo and Edmund K. Burke, Gilles Perrouin and Mike Papadakis, Gilles Perrouin and Myra B. Cohen, Edmund K. Burke and Myra B. Cohen, Myra B. Cohen and Mike Papadakis.\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: Xuanqin Mou, Yuming Fang, Alejandro F. Frangi, Alan C. Bovik, David S. Doermann, Licheng Jiao, Hua Huang, Shanshan Wang, Roman V. Yampolskiy, Hamid Rahim Sheikh, Jaakko Astola, Ke Gu, Lina Jin, Lei Zhang\n- Research collaborations between these authors: Xuanqin Mou and Lei Zhang, Xuanqin Mou and Alejandro F. Frangi, Xuanqin Mou and Licheng Jiao, Xuanqin Mou and David S. Doermann, Xuanqin Mou and Roman V. Yampolskiy, Xuanqin Mou and Shanshan Wang, Xuanqin Mou and Alan C. Bovik, Xuanqin Mou and Lina Jin, Xuanqin Mou and Jaakko Astola, Xuanqin Mou and Hamid Rahim Sheikh, Xuanqin Mou and Hua Huang, Xuanqin Mou and Yuming Fang, Xuanqin Mou and Ke Gu, Yuming Fang and Alan C. Bovik, Yuming Fang and Lei Zhang, Yuming Fang and David S. Doermann, Yuming Fang and Lina Jin, Yuming Fang and Jaakko Astola, Yuming Fang and Ke Gu, Yuming Fang and Hamid Rahim Sheikh, Alejandro F. Frangi and Lei Zhang, Alejandro F. Frangi and David S. Doermann, Alejandro F. Frangi and Alan C. Bovik, Alejandro F. Frangi and Hamid Rahim Sheikh, Alan C. Bovik and Lei Zhang, Alan C. Bovik and Licheng Jiao, Alan C. Bovik and David S. Doermann, Alan C. Bovik and Shanshan Wang, Alan C. Bovik and Lina Jin, Alan C. Bovik and Jaakko Astola, Alan C. Bovik and Ke Gu, Alan C. Bovik and Hamid Rahim Sheikh, Alan C. Bovik and Hua Huang, David S. Doermann and Lei Zhang, David S. Doermann and Hamid Rahim Sheikh, David S. Doermann and Ke Gu, Licheng Jiao and Lei Zhang, Licheng Jiao and Hamid Rahim Sheikh, Hua Huang and Lei Zhang, Hua Huang and Hamid Rahim Sheikh, Shanshan Wang and Lei Zhang, Shanshan Wang and Ke Gu, Shanshan Wang and Hamid Rahim Sheikh, Roman V. Yampolskiy and Lei Zhang, Hamid Rahim Sheikh and Lei Zhang, Hamid Rahim Sheikh and Lina Jin, Hamid Rahim Sheikh and Jaakko Astola, Hamid Rahim Sheikh and Ke Gu, Jaakko Astola and Lei Zhang, Jaakko Astola and Lina Jin, Jaakko Astola and Ke Gu, Ke Gu and Lei Zhang, Ke Gu and Lina Jin, Lina Jin and Lei Zhang.\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\": \"Xuanqin Mou\", \"id\": 113408}, {\"name\": \"Yuming Fang\", \"id\": 167264}, {\"name\": \"Alejandro F. Frangi\", \"id\": 546}, {\"name\": \"Alan C. Bovik\", \"id\": 77799}, {\"name\": \"David S. Doermann\", \"id\": 33832}, {\"name\": \"Licheng Jiao\", \"id\": 1415}, {\"name\": \"Hua Huang\", \"id\": 162155}, {\"name\": \"Shanshan Wang\", \"id\": 39756}, {\"name\": \"Roman V. Yampolskiy\", \"id\": 34381}, {\"name\": \"Hamid Rahim Sheikh\", \"id\": 308624}, {\"name\": \"Jaakko Astola\", \"id\": 153491}, {\"name\": \"Ke Gu\", \"id\": 289049}, {\"name\": \"Lina Jin\", \"id\": 93947}, {\"name\": \"Lei Zhang\", \"id\": 412}], \"links\": [{\"source\": 113408, \"target\": 412}, {\"source\": 113408, \"target\": 546}, {\"source\": 113408, \"target\": 1415}, {\"source\": 113408, \"target\": 33832}, {\"source\": 113408, \"target\": 34381}, {\"source\": 113408, \"target\": 39756}, {\"source\": 113408, \"target\": 77799}, {\"source\": 113408, \"target\": 93947}, {\"source\": 113408, \"target\": 153491}, {\"source\": 113408, \"target\": 308624}, {\"source\": 113408, \"target\": 162155}, {\"source\": 113408, \"target\": 167264}, {\"source\": 113408, \"target\": 289049}, {\"source\": 167264, \"target\": 77799}, {\"source\": 167264, \"target\": 412}, {\"source\": 167264, \"target\": 33832}, {\"source\": 167264, \"target\": 93947}, {\"source\": 167264, \"target\": 153491}, {\"source\": 167264, \"target\": 289049}, {\"source\": 167264, \"target\": 308624}, {\"source\": 546, \"target\": 412}, {\"source\": 546, \"target\": 33832}, {\"source\": 546, \"target\": 77799}, {\"source\": 546, \"target\": 308624}, {\"source\": 77799, \"target\": 412}, {\"source\": 77799, \"target\": 1415}, {\"source\": 77799, \"target\": 33832}, {\"source\": 77799, \"target\": 39756}, {\"source\": 77799, \"target\": 93947}, {\"source\": 77799, \"target\": 153491}, {\"source\": 77799, \"target\": 289049}, {\"source\": 77799, \"target\": 308624}, {\"source\": 77799, \"target\": 162155}, {\"source\": 33832, \"target\": 412}, {\"source\": 33832, \"target\": 308624}, {\"source\": 33832, \"target\": 289049}, {\"source\": 1415, \"target\": 412}, {\"source\": 1415, \"target\": 308624}, {\"source\": 162155, \"target\": 412}, {\"source\": 162155, \"target\": 308624}, {\"source\": 39756, \"target\": 412}, {\"source\": 39756, \"target\": 289049}, {\"source\": 39756, \"target\": 308624}, {\"source\": 34381, \"target\": 412}, {\"source\": 308624, \"target\": 412}, {\"source\": 308624, \"target\": 93947}, {\"source\": 308624, \"target\": 153491}, {\"source\": 308624, \"target\": 289049}, {\"source\": 153491, \"target\": 412}, {\"source\": 153491, \"target\": 93947}, {\"source\": 153491, \"target\": 289049}, {\"source\": 289049, \"target\": 412}, {\"source\": 289049, \"target\": 93947}, {\"source\": 93947, \"target\": 412}]}",
"id": 2986,
"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: Xuanqin Mou, Yuming Fang, Alejandro F. Frangi, Alan C. Bovik, David S. Doermann, Licheng Jiao, Hua Huang, Shanshan Wang, Roman V. Yampolskiy, Hamid Rahim Sheikh, Jaakko Astola, Ke Gu, Lina Jin, Lei Zhang\n- Research collaborations between these authors: Xuanqin Mou and Lei Zhang, Xuanqin Mou and Alejandro F. Frangi, Xuanqin Mou and Licheng Jiao, Xuanqin Mou and David S. Doermann, Xuanqin Mou and Roman V. Yampolskiy, Xuanqin Mou and Shanshan Wang, Xuanqin Mou and Alan C. Bovik, Xuanqin Mou and Lina Jin, Xuanqin Mou and Jaakko Astola, Xuanqin Mou and Hamid Rahim Sheikh, Xuanqin Mou and Hua Huang, Xuanqin Mou and Yuming Fang, Xuanqin Mou and Ke Gu, Yuming Fang and Alan C. Bovik, Yuming Fang and Lei Zhang, Yuming Fang and David S. Doermann, Yuming Fang and Lina Jin, Yuming Fang and Jaakko Astola, Yuming Fang and Ke Gu, Yuming Fang and Hamid Rahim Sheikh, Alejandro F. Frangi and Lei Zhang, Alejandro F. Frangi and David S. Doermann, Alejandro F. Frangi and Alan C. Bovik, Alejandro F. Frangi and Hamid Rahim Sheikh, Alan C. Bovik and Lei Zhang, Alan C. Bovik and Licheng Jiao, Alan C. Bovik and David S. Doermann, Alan C. Bovik and Shanshan Wang, Alan C. Bovik and Lina Jin, Alan C. Bovik and Jaakko Astola, Alan C. Bovik and Ke Gu, Alan C. Bovik and Hamid Rahim Sheikh, Alan C. Bovik and Hua Huang, David S. Doermann and Lei Zhang, David S. Doermann and Hamid Rahim Sheikh, David S. Doermann and Ke Gu, Licheng Jiao and Lei Zhang, Licheng Jiao and Hamid Rahim Sheikh, Hua Huang and Lei Zhang, Hua Huang and Hamid Rahim Sheikh, Shanshan Wang and Lei Zhang, Shanshan Wang and Ke Gu, Shanshan Wang and Hamid Rahim Sheikh, Roman V. Yampolskiy and Lei Zhang, Hamid Rahim Sheikh and Lei Zhang, Hamid Rahim Sheikh and Lina Jin, Hamid Rahim Sheikh and Jaakko Astola, Hamid Rahim Sheikh and Ke Gu, Jaakko Astola and Lei Zhang, Jaakko Astola and Lina Jin, Jaakko Astola and Ke Gu, Ke Gu and Lei Zhang, Ke Gu and Lina Jin, Lina Jin and Lei Zhang.\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: Anukool Lakhina, Christian Henke, Carsten Schmoll, Tanja Zseby, Nick G. Duffield, Alistair King, Philipp Svoboda, Solange Rito Lima, Ion Stoica, Joachim Fabini, Marco Mellia, Thomas Zinner, Nevil Brownlee, Félix Iglesias\n- Research collaborations between these authors: Anukool Lakhina and Tanja Zseby, Anukool Lakhina and Nick G. Duffield, Christian Henke and Tanja Zseby, Christian Henke and Carsten Schmoll, Carsten Schmoll and Tanja Zseby, Tanja Zseby and Thomas Zinner, Tanja Zseby and Ion Stoica, Tanja Zseby and Joachim Fabini, Tanja Zseby and Nick G. Duffield, Tanja Zseby and Alistair King, Tanja Zseby and Nevil Brownlee, Tanja Zseby and Philipp Svoboda, Tanja Zseby and Marco Mellia, Tanja Zseby and Solange Rito Lima, Tanja Zseby and Félix Iglesias, Nick G. Duffield and Solange Rito Lima, Nick G. Duffield and Marco Mellia, Alistair King and Félix Iglesias, Philipp Svoboda and Joachim Fabini, Philipp Svoboda and Marco Mellia, Solange Rito Lima and Ion Stoica, Ion Stoica and Thomas Zinner, Ion Stoica and Marco Mellia, Marco Mellia and Thomas Zinner, Marco Mellia and Nevil Brownlee, Nevil Brownlee and Félix Iglesias.\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\": \"Christian Henke\", \"id\": 154755}, {\"name\": \"Carsten Schmoll\", \"id\": 154756}, {\"name\": \"Tanja Zseby\", \"id\": 32326}, {\"name\": \"Nick G. Duffield\", \"id\": 65575}, {\"name\": \"Alistair King\", \"id\": 76432}, {\"name\": \"Philipp Svoboda\", \"id\": 107473}, {\"name\": \"Solange Rito Lima\", \"id\": 90162}, {\"name\": \"Ion Stoica\", \"id\": 19443}, {\"name\": \"Joachim Fabini\", \"id\": 36820}, {\"name\": \"Marco Mellia\", \"id\": 128852}, {\"name\": \"Thomas Zinner\", \"id\": 13942}, {\"name\": \"Nevil Brownlee\", \"id\": 76433}, {\"name\": \"F\\u00e9lix Iglesias\", \"id\": 659034}, {\"name\": \"Anukool Lakhina\", \"id\": 472058}], \"links\": [{\"source\": 154755, \"target\": 32326}, {\"source\": 154755, \"target\": 154756}, {\"source\": 154756, \"target\": 32326}, {\"source\": 32326, \"target\": 13942}, {\"source\": 32326, \"target\": 19443}, {\"source\": 32326, \"target\": 36820}, {\"source\": 32326, \"target\": 65575}, {\"source\": 32326, \"target\": 76432}, {\"source\": 32326, \"target\": 76433}, {\"source\": 32326, \"target\": 107473}, {\"source\": 32326, \"target\": 128852}, {\"source\": 32326, \"target\": 472058}, {\"source\": 32326, \"target\": 90162}, {\"source\": 32326, \"target\": 659034}, {\"source\": 65575, \"target\": 472058}, {\"source\": 65575, \"target\": 90162}, {\"source\": 65575, \"target\": 128852}, {\"source\": 76432, \"target\": 659034}, {\"source\": 107473, \"target\": 36820}, {\"source\": 107473, \"target\": 128852}, {\"source\": 90162, \"target\": 19443}, {\"source\": 19443, \"target\": 13942}, {\"source\": 19443, \"target\": 128852}, {\"source\": 128852, \"target\": 13942}, {\"source\": 128852, \"target\": 76433}, {\"source\": 76433, \"target\": 659034}]}",
"id": 975,
"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: Anukool Lakhina, Christian Henke, Carsten Schmoll, Tanja Zseby, Nick G. Duffield, Alistair King, Philipp Svoboda, Solange Rito Lima, Ion Stoica, Joachim Fabini, Marco Mellia, Thomas Zinner, Nevil Brownlee, Félix Iglesias\n- Research collaborations between these authors: Anukool Lakhina and Tanja Zseby, Anukool Lakhina and Nick G. Duffield, Christian Henke and Tanja Zseby, Christian Henke and Carsten Schmoll, Carsten Schmoll and Tanja Zseby, Tanja Zseby and Thomas Zinner, Tanja Zseby and Ion Stoica, Tanja Zseby and Joachim Fabini, Tanja Zseby and Nick G. Duffield, Tanja Zseby and Alistair King, Tanja Zseby and Nevil Brownlee, Tanja Zseby and Philipp Svoboda, Tanja Zseby and Marco Mellia, Tanja Zseby and Solange Rito Lima, Tanja Zseby and Félix Iglesias, Nick G. Duffield and Solange Rito Lima, Nick G. Duffield and Marco Mellia, Alistair King and Félix Iglesias, Philipp Svoboda and Joachim Fabini, Philipp Svoboda and Marco Mellia, Solange Rito Lima and Ion Stoica, Ion Stoica and Thomas Zinner, Ion Stoica and Marco Mellia, Marco Mellia and Thomas Zinner, Marco Mellia and Nevil Brownlee, Nevil Brownlee and Félix Iglesias.\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.