[ { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the wedding coordinator decided to make a carefully spaced display of centerpieces: pick as many tables to dress as possible but avoid picking any tables that are next to each other on the floor map. Success is just the number of dressed tables — add them up — and no table gets picked twice or left in an ambiguous state. The detailed layout is provided below.\n\nThere are 18 tables and 35 adjacency pairs in the layout below.\nTables E and B are adjacent and cannot both be dressed.\nTables E and I are adjacent and cannot both be dressed.\nTables E and J are adjacent and cannot both be dressed.\nTables E and L are adjacent and cannot both be dressed.\nTables E and Q are adjacent and cannot both be dressed.\nTables E and R are adjacent and cannot both be dressed.\nTables D and G are adjacent and cannot both be dressed.\nTables D and H are adjacent and cannot both be dressed.\nTables D and K are adjacent and cannot both be dressed.\nTables D and O are adjacent and cannot both be dressed.\nTables D and P are adjacent and cannot both be dressed.\nTables I and A are adjacent and cannot both be dressed.\nTables I and G are adjacent and cannot both be dressed.\nTables I and L are adjacent and cannot both be dressed.\nTables I and M are adjacent and cannot both be dressed.\nTables I and O are adjacent and cannot both be dressed.\nTables I and Q are adjacent and cannot both be dressed.\nTables F and J are adjacent and cannot both be dressed.\nTables A and L are adjacent and cannot both be dressed.\nTables R and J are adjacent and cannot both be dressed.\nTables R and K are adjacent and cannot both be dressed.\nTables R and M are adjacent and cannot both be dressed.\nTables B and C are adjacent and cannot both be dressed.\nTables M and K are adjacent and cannot both be dressed.\nTables M and O are adjacent and cannot both be dressed.\nTables N and H are adjacent and cannot both be dressed.\nTables H and J are adjacent and cannot both be dressed.\nTables H and K are adjacent and cannot both be dressed.\nTables H and P are adjacent and cannot both be dressed.\nTables C and J are adjacent and cannot both be dressed.\nTables J and K are adjacent and cannot both be dressed.\nTables K and O are adjacent and cannot both be dressed.\nTables O and G are adjacent and cannot both be dressed.\nTables G and P are adjacent and cannot both be dressed.\nTables Q and L are adjacent and cannot both be dressed.\nRefer to the 18 tables and 35 adjacency pairs to choose a maximal set of non-adjacent tables.\n\nAlso, when you send back which tables you picked, just put them in a tiny JSON snippet like this so it's clear and easy to check:\n\n{\n \"solution\": [\"table_id\", \"table_id\", ...]\n}\n\nQuick note: \"solution\" is the list of table identifiers you chose to dress for the display. Each entry in that array should be a single table id from the floor plan (the \"table_id\" placeholders above just show the shape — replace them with the actual ids). The little ellipsis means you can list as many ids as needed.\n\nThis JSON is just a sketch of the expected shape, not the actual answer itself — please return the real ids from the instance.\n\nUse the identifiers exactly as they appear in the instance input — no renaming and no new labels.\nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 35, "edges": [ { "u": 5, "v": 2 }, { "u": 5, "v": 9 }, { "u": 5, "v": 10 }, { "u": 5, "v": 12 }, { "u": 5, "v": 17 }, { "u": 5, "v": 18 }, { "u": 4, "v": 7 }, { "u": 4, "v": 8 }, { "u": 4, "v": 11 }, { "u": 4, "v": 15 }, { "u": 4, "v": 16 }, { "u": 9, "v": 1 }, { "u": 9, "v": 7 }, { "u": 9, "v": 12 }, { "u": 9, "v": 13 }, { "u": 9, "v": 15 }, { "u": 9, "v": 17 }, { "u": 6, "v": 10 }, { "u": 1, "v": 12 }, { "u": 18, "v": 10 }, { "u": 18, "v": 11 }, { "u": 18, "v": 13 }, { "u": 2, "v": 3 }, { "u": 13, "v": 11 }, { "u": 13, "v": 15 }, { "u": 14, "v": 8 }, { "u": 8, "v": 10 }, { "u": 8, "v": 11 }, { "u": 8, "v": 16 }, { "u": 3, "v": 10 }, { "u": 10, "v": 11 }, { "u": 11, "v": 15 }, { "u": 15, "v": 7 }, { "u": 7, "v": 16 }, { "u": 17, "v": 12 } ], "source_file": "vt2010.mtx", "density": 0.22875816993464052, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0000.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0000.png", "edge_connectivity": 1 }, "solution": [ 1, 3, 6, 14, 15, 16, 17, 18 ], "obj": 8.0, "instance_variant": { "num_nodes": 18, "num_edges": 35, "edges": [ { "u": "E", "v": "B" }, { "u": "E", "v": "I" }, { "u": "E", "v": "J" }, { "u": "E", "v": "L" }, { "u": "E", "v": "Q" }, { "u": "E", "v": "R" }, { "u": "D", "v": "G" }, { "u": "D", "v": "H" }, { "u": "D", "v": "K" }, { "u": "D", "v": "O" }, { "u": "D", "v": "P" }, { "u": "I", "v": "A" }, { "u": "I", "v": "G" }, { "u": "I", "v": "L" }, { "u": "I", "v": "M" }, { "u": "I", "v": "O" }, { "u": "I", "v": "Q" }, { "u": "F", "v": "J" }, { "u": "A", "v": "L" }, { "u": "R", "v": "J" }, { "u": "R", "v": "K" }, { "u": "R", "v": "M" }, { "u": "B", "v": "C" }, { "u": "M", "v": "K" }, { "u": "M", "v": "O" }, { "u": "N", "v": "H" }, { "u": "H", "v": "J" }, { "u": "H", "v": "K" }, { "u": "H", "v": "P" }, { "u": "C", "v": "J" }, { "u": "J", "v": "K" }, { "u": "K", "v": "O" }, { "u": "O", "v": "G" }, { "u": "G", "v": "P" }, { "u": "Q", "v": "L" } ] }, "solution_variant": [ "A", "C", "F", "N", "O", "P", "Q", "R" ], "context_index": 1, "input_format": "nl", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m setting up the front display at the library and want to pick as many interesting books as I can, but I’m careful not to put two chosen books right next to each other on the shelf. The better a selection is, the more books end up on that display — so the simple way to judge a pick is to count how many distinct books are placed there. Each book can only be chosen once and every choice must respect the “no neighbors” rule on the shelf. The exact shelf layout and details are shown below.\n\n{\n \"total_books_on_shelf\": 13,\n \"num_adjacent_book_pairs\": 26,\n \"edges\": [\n {\n \"book_id_a\": 5,\n \"book_id_b\": 3\n },\n {\n \"book_id_a\": 5,\n \"book_id_b\": 10\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 1\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 2\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 6\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 8\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 10\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 12\n },\n {\n \"book_id_a\": 3,\n \"book_id_b\": 13\n },\n {\n \"book_id_a\": 8,\n \"book_id_b\": 1\n },\n {\n \"book_id_a\": 8,\n \"book_id_b\": 2\n },\n {\n \"book_id_a\": 8,\n \"book_id_b\": 4\n },\n {\n \"book_id_a\": 8,\n \"book_id_b\": 7\n },\n {\n \"book_id_a\": 8,\n \"book_id_b\": 10\n },\n {\n \"book_id_a\": 8,\n \"book_id_b\": 11\n },\n {\n \"book_id_a\": 12,\n \"book_id_b\": 1\n },\n {\n \"book_id_a\": 12,\n \"book_id_b\": 6\n },\n {\n \"book_id_a\": 12,\n \"book_id_b\": 9\n },\n {\n \"book_id_a\": 9,\n \"book_id_b\": 1\n },\n {\n \"book_id_a\": 9,\n \"book_id_b\": 6\n },\n {\n \"book_id_a\": 4,\n \"book_id_b\": 10\n },\n {\n \"book_id_a\": 1,\n \"book_id_b\": 7\n },\n {\n \"book_id_a\": 1,\n \"book_id_b\": 13\n },\n {\n \"book_id_a\": 11,\n \"book_id_b\": 7\n },\n {\n \"book_id_a\": 13,\n \"book_id_b\": 2\n },\n {\n \"book_id_a\": 7,\n \"book_id_b\": 6\n }\n ]\n}\n\nIf you want to pass me the selection in a neat, machine-friendly way, you can just use a little JSON like this:\n\n{\n \"solution\": [\"book_id\", \"book_id\", ...]\n}\n\nHere \"solution\" is the list of the books you put on the front display — each entry should be the exact ID for a book from the instance (so one entry per chosen book, and don't list two books that are neighbors). This JSON is just a sketch of the shape I expect, not the actual final answer.\n\nAll identifiers must be used exactly as they appear in the instance input — no renaming and no new labels. \nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 26, "edges": [ { "u": 5, "v": 3 }, { "u": 5, "v": 10 }, { "u": 3, "v": 1 }, { "u": 3, "v": 2 }, { "u": 3, "v": 6 }, { "u": 3, "v": 8 }, { "u": 3, "v": 10 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 8, "v": 1 }, { "u": 8, "v": 2 }, { "u": 8, "v": 4 }, { "u": 8, "v": 7 }, { "u": 8, "v": 10 }, { "u": 8, "v": 11 }, { "u": 12, "v": 1 }, { "u": 12, "v": 6 }, { "u": 12, "v": 9 }, { "u": 9, "v": 1 }, { "u": 9, "v": 6 }, { "u": 4, "v": 10 }, { "u": 1, "v": 7 }, { "u": 1, "v": 13 }, { "u": 11, "v": 7 }, { "u": 13, "v": 2 }, { "u": 7, "v": 6 } ], "source_file": "wi2010.mtx", "density": 0.3333333333333333, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0001.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0001.png", "edge_connectivity": 2 }, "solution": [ 1, 2, 4, 5, 6, 11 ], "obj": 6.0, "instance_variant": { "num_nodes": 13, "num_edges": 26, "edges": [ { "u": 5, "v": 3 }, { "u": 5, "v": 10 }, { "u": 3, "v": 1 }, { "u": 3, "v": 2 }, { "u": 3, "v": 6 }, { "u": 3, "v": 8 }, { "u": 3, "v": 10 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 8, "v": 1 }, { "u": 8, "v": 2 }, { "u": 8, "v": 4 }, { "u": 8, "v": 7 }, { "u": 8, "v": 10 }, { "u": 8, "v": 11 }, { "u": 12, "v": 1 }, { "u": 12, "v": 6 }, { "u": 12, "v": 9 }, { "u": 9, "v": 1 }, { "u": 9, "v": 6 }, { "u": 4, "v": 10 }, { "u": 1, "v": 7 }, { "u": 1, "v": 13 }, { "u": 11, "v": 7 }, { "u": 13, "v": 2 }, { "u": 7, "v": 6 } ] }, "solution_variant": [ 1, 2, 4, 5, 6, 11 ], "context_index": 2, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m the radio tech staring at a wall of channel knobs: each one can be switched on or left off, but some pairs clash and can’t be on at the same time. The job is to flip as many knobs to “on” as possible without ever turning on two channels that interfere with each other. How to tell which plan is better? Just count how many channels are on — the higher the count, the better. Every channel is decided once (on or off) and can’t be duplicated, and the specific interference pairs and channels are listed below.\n\n{\n \"total_channels\": 13,\n \"total_interference_pairs\": 22,\n \"edges\": [\n {\n \"channel_one\": 13,\n \"channel_two\": 3\n },\n {\n \"channel_one\": 13,\n \"channel_two\": 4\n },\n {\n \"channel_one\": 13,\n \"channel_two\": 7\n },\n {\n \"channel_one\": 13,\n \"channel_two\": 8\n },\n {\n \"channel_one\": 13,\n \"channel_two\": 9\n },\n {\n \"channel_one\": 13,\n \"channel_two\": 11\n },\n {\n \"channel_one\": 13,\n \"channel_two\": 12\n },\n {\n \"channel_one\": 1,\n \"channel_two\": 3\n },\n {\n \"channel_one\": 1,\n \"channel_two\": 10\n },\n {\n \"channel_one\": 9,\n \"channel_two\": 6\n },\n {\n \"channel_one\": 9,\n \"channel_two\": 7\n },\n {\n \"channel_one\": 9,\n \"channel_two\": 11\n },\n {\n \"channel_one\": 2,\n \"channel_two\": 4\n },\n {\n \"channel_one\": 2,\n \"channel_two\": 5\n },\n {\n \"channel_one\": 2,\n \"channel_two\": 8\n },\n {\n \"channel_one\": 5,\n \"channel_two\": 3\n },\n {\n \"channel_one\": 11,\n \"channel_two\": 10\n },\n {\n \"channel_one\": 6,\n \"channel_two\": 7\n },\n {\n \"channel_one\": 3,\n \"channel_two\": 8\n },\n {\n \"channel_one\": 3,\n \"channel_two\": 10\n },\n {\n \"channel_one\": 3,\n \"channel_two\": 12\n },\n {\n \"channel_one\": 8,\n \"channel_two\": 12\n }\n ]\n}\n\nOh, and when you give the answer, just put it in this little JSON shape so it's easy to read and parse:\n\n{\n \"solution\": [\"channel_id\", \"channel_id\", ...]\n}\n\nPretty straightforward: \"solution\" is the list of channels you want switched on (one entry per channel). The example uses the placeholder \"channel_id\" to show the format — replace those placeholders with the actual channel identifiers from the instance when you answer. This JSON is just a sketch of the shape I expect, not the final selection.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 22, "edges": [ { "u": 13, "v": 3 }, { "u": 13, "v": 4 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 13, "v": 9 }, { "u": 13, "v": 11 }, { "u": 13, "v": 12 }, { "u": 1, "v": 3 }, { "u": 1, "v": 10 }, { "u": 9, "v": 6 }, { "u": 9, "v": 7 }, { "u": 9, "v": 11 }, { "u": 2, "v": 4 }, { "u": 2, "v": 5 }, { "u": 2, "v": 8 }, { "u": 5, "v": 3 }, { "u": 11, "v": 10 }, { "u": 6, "v": 7 }, { "u": 3, "v": 8 }, { "u": 3, "v": 10 }, { "u": 3, "v": 12 }, { "u": 8, "v": 12 } ], "source_file": "wa2010.mtx", "density": 0.28205128205128205, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0002.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0002.png", "edge_connectivity": 2 }, "solution": [ 1, 4, 5, 6, 11, 12 ], "obj": 6.0, "instance_variant": { "num_nodes": 13, "num_edges": 22, "edges": [ { "u": 13, "v": 3 }, { "u": 13, "v": 4 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 13, "v": 9 }, { "u": 13, "v": 11 }, { "u": 13, "v": 12 }, { "u": 1, "v": 3 }, { "u": 1, "v": 10 }, { "u": 9, "v": 6 }, { "u": 9, "v": 7 }, { "u": 9, "v": 11 }, { "u": 2, "v": 4 }, { "u": 2, "v": 5 }, { "u": 2, "v": 8 }, { "u": 5, "v": 3 }, { "u": 11, "v": 10 }, { "u": 6, "v": 7 }, { "u": 3, "v": 8 }, { "u": 3, "v": 10 }, { "u": 3, "v": 12 }, { "u": 8, "v": 12 } ] }, "solution_variant": [ 1, 4, 5, 6, 11, 12 ], "context_index": 3, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "We had a small exhibition to plan and the curatorial team was trying to squeeze in as many pieces as they could. The idea was simple: choose the biggest collection of paintings to display, while making sure none of the selected works are placed on panels that are next to each other. How well the team did is measured by the final count of displayed paintings — just add them up — and each piece can only be used once and must occupy its own panel. The specific panel map and the list of paintings are shown below.\n\nThere are 18 panels and 39 adjacent panel pairs in the layout.\nPanels 12 and 5 are adjacent, so they cannot both hold paintings.\nPanels 12 and 9 are adjacent, so they cannot both hold paintings.\nPanels 12 and 11 are adjacent, so they cannot both hold paintings.\nPanels 9 and 0 are adjacent, so they cannot both hold paintings.\nPanels 9 and 2 are adjacent, so they cannot both hold paintings.\nPanels 9 and 5 are adjacent, so they cannot both hold paintings.\nPanels 9 and 10 are adjacent, so they cannot both hold paintings.\nPanels 9 and 14 are adjacent, so they cannot both hold paintings.\nPanels 9 and 16 are adjacent, so they cannot both hold paintings.\nPanels 13 and 0 are adjacent, so they cannot both hold paintings.\nPanels 13 and 1 are adjacent, so they cannot both hold paintings.\nPanels 13 and 2 are adjacent, so they cannot both hold paintings.\nPanels 13 and 8 are adjacent, so they cannot both hold paintings.\nPanels 13 and 10 are adjacent, so they cannot both hold paintings.\nPanels 14 and 16 are adjacent, so they cannot both hold paintings.\nPanels 17 and 4 are adjacent, so they cannot both hold paintings.\nPanels 17 and 6 are adjacent, so they cannot both hold paintings.\nPanels 17 and 7 are adjacent, so they cannot both hold paintings.\nPanels 17 and 15 are adjacent, so they cannot both hold paintings.\nPanels 1 and 2 are adjacent, so they cannot both hold paintings.\nPanels 1 and 3 are adjacent, so they cannot both hold paintings.\nPanels 1 and 4 are adjacent, so they cannot both hold paintings.\nPanels 1 and 8 are adjacent, so they cannot both hold paintings.\nPanels 1 and 10 are adjacent, so they cannot both hold paintings.\nPanels 2 and 4 are adjacent, so they cannot both hold paintings.\nPanels 2 and 5 are adjacent, so they cannot both hold paintings.\nPanels 2 and 8 are adjacent, so they cannot both hold paintings.\nPanels 3 and 4 are adjacent, so they cannot both hold paintings.\nPanels 3 and 16 are adjacent, so they cannot both hold paintings.\nPanels 15 and 4 are adjacent, so they cannot both hold paintings.\nPanels 16 and 4 are adjacent, so they cannot both hold paintings.\nPanels 16 and 6 are adjacent, so they cannot both hold paintings.\nPanels 16 and 10 are adjacent, so they cannot both hold paintings.\nPanels 4 and 5 are adjacent, so they cannot both hold paintings.\nPanels 4 and 6 are adjacent, so they cannot both hold paintings.\nPanels 4 and 7 are adjacent, so they cannot both hold paintings.\nPanels 4 and 11 are adjacent, so they cannot both hold paintings.\nPanels 6 and 7 are adjacent, so they cannot both hold paintings.\nPanels 5 and 11 are adjacent, so they cannot both hold paintings.\nWe will use this map to choose the largest non-adjacent set of paintings.\n\nIf you want to hand me the chosen panels in a neat, machine-friendly way, just return them in this little JSON shape.\n\n{\n \"solution\": [\"vertex_id\", \"vertex_id\", ...]\n}\n\nThink of \"solution\" as the list of panels where the chosen paintings will hang — just put each panel's identifier in that array. It's just a sketch of the shape I expect, not the final answer itself.\n\nPlease make sure you use the exact identifiers from the instance input — no renaming, no new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 39, "edges": [ { "u": 13, "v": 6 }, { "u": 13, "v": 10 }, { "u": 13, "v": 12 }, { "u": 10, "v": 1 }, { "u": 10, "v": 3 }, { "u": 10, "v": 6 }, { "u": 10, "v": 11 }, { "u": 10, "v": 15 }, { "u": 10, "v": 17 }, { "u": 14, "v": 1 }, { "u": 14, "v": 2 }, { "u": 14, "v": 3 }, { "u": 14, "v": 9 }, { "u": 14, "v": 11 }, { "u": 15, "v": 17 }, { "u": 18, "v": 5 }, { "u": 18, "v": 7 }, { "u": 18, "v": 8 }, { "u": 18, "v": 16 }, { "u": 2, "v": 3 }, { "u": 2, "v": 4 }, { "u": 2, "v": 5 }, { "u": 2, "v": 9 }, { "u": 2, "v": 11 }, { "u": 3, "v": 5 }, { "u": 3, "v": 6 }, { "u": 3, "v": 9 }, { "u": 4, "v": 5 }, { "u": 4, "v": 17 }, { "u": 16, "v": 5 }, { "u": 17, "v": 5 }, { "u": 17, "v": 7 }, { "u": 17, "v": 11 }, { "u": 5, "v": 6 }, { "u": 5, "v": 7 }, { "u": 5, "v": 8 }, { "u": 5, "v": 12 }, { "u": 7, "v": 8 }, { "u": 6, "v": 12 } ], "source_file": "wy2010.mtx", "density": 0.2549019607843137, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0003.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0003.png", "edge_connectivity": 2 }, "solution": [ 1, 4, 8, 9, 11, 13, 15, 16 ], "obj": 8.0, "instance_variant": { "num_nodes": 18, "num_edges": 39, "edges": [ { "u": 12, "v": 5 }, { "u": 12, "v": 9 }, { "u": 12, "v": 11 }, { "u": 9, "v": 0 }, { "u": 9, "v": 2 }, { "u": 9, "v": 5 }, { "u": 9, "v": 10 }, { "u": 9, "v": 14 }, { "u": 9, "v": 16 }, { "u": 13, "v": 0 }, { "u": 13, "v": 1 }, { "u": 13, "v": 2 }, { "u": 13, "v": 8 }, { "u": 13, "v": 10 }, { "u": 14, "v": 16 }, { "u": 17, "v": 4 }, { "u": 17, "v": 6 }, { "u": 17, "v": 7 }, { "u": 17, "v": 15 }, { "u": 1, "v": 2 }, { "u": 1, "v": 3 }, { "u": 1, "v": 4 }, { "u": 1, "v": 8 }, { "u": 1, "v": 10 }, { "u": 2, "v": 4 }, { "u": 2, "v": 5 }, { "u": 2, "v": 8 }, { "u": 3, "v": 4 }, { "u": 3, "v": 16 }, { "u": 15, "v": 4 }, { "u": 16, "v": 4 }, { "u": 16, "v": 6 }, { "u": 16, "v": 10 }, { "u": 4, "v": 5 }, { "u": 4, "v": 6 }, { "u": 4, "v": 7 }, { "u": 4, "v": 11 }, { "u": 6, "v": 7 }, { "u": 5, "v": 11 } ] }, "solution_variant": [ 0, 3, 7, 8, 10, 12, 14, 15 ], "context_index": 4, "input_format": "nl", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the neighborhood organizer took on the task of assembling a guest list for a street party, aiming to invite as many households as possible but not having any invited homes be next-door neighbors. The decision involves picking which households to put on the list; a superior choice is simply the list with the most invited homes — count them to compare — and every chosen pair must avoid being adjacent. Each household must be handled once and only once, so nothing is duplicated or overlooked. The detailed map and instance info are shown below.\n\n{\n \"total_households\": 15,\n \"total_adjacent_pairs\": 29,\n \"edges\": [\n {\n \"household_a\": 7,\n \"household_b\": 4\n },\n {\n \"household_a\": 7,\n \"household_b\": 6\n },\n {\n \"household_a\": 7,\n \"household_b\": 11\n },\n {\n \"household_a\": 10,\n \"household_b\": 3\n },\n {\n \"household_a\": 10,\n \"household_b\": 5\n },\n {\n \"household_a\": 10,\n \"household_b\": 11\n },\n {\n \"household_a\": 3,\n \"household_b\": 1\n },\n {\n \"household_a\": 3,\n \"household_b\": 5\n },\n {\n \"household_a\": 3,\n \"household_b\": 12\n },\n {\n \"household_a\": 3,\n \"household_b\": 14\n },\n {\n \"household_a\": 3,\n \"household_b\": 15\n },\n {\n \"household_a\": 4,\n \"household_b\": 6\n },\n {\n \"household_a\": 4,\n \"household_b\": 8\n },\n {\n \"household_a\": 4,\n \"household_b\": 9\n },\n {\n \"household_a\": 11,\n \"household_b\": 2\n },\n {\n \"household_a\": 11,\n \"household_b\": 5\n },\n {\n \"household_a\": 11,\n \"household_b\": 6\n },\n {\n \"household_a\": 11,\n \"household_b\": 8\n },\n {\n \"household_a\": 11,\n \"household_b\": 9\n },\n {\n \"household_a\": 11,\n \"household_b\": 12\n },\n {\n \"household_a\": 11,\n \"household_b\": 13\n },\n {\n \"household_a\": 11,\n \"household_b\": 14\n },\n {\n \"household_a\": 11,\n \"household_b\": 15\n },\n {\n \"household_a\": 13,\n \"household_b\": 8\n },\n {\n \"household_a\": 9,\n \"household_b\": 1\n },\n {\n \"household_a\": 8,\n \"household_b\": 6\n },\n {\n \"household_a\": 14,\n \"household_b\": 15\n },\n {\n \"household_a\": 12,\n \"household_b\": 2\n },\n {\n \"household_a\": 2,\n \"household_b\": 1\n }\n ]\n}\n\nAlso, feel free to return the final guest list in this simple JSON layout so it's easy to read programmatically:\n\n{\n \"solution\": [\"household_id\", \"household_id\", ...]\n}\n\nHere \"solution\" is just the list of households you've chosen to invite — each entry should be the exact household identifier from the instance (so think of these placeholders as where the real IDs go). This JSON is just a sketch of the shape I need, not the actual answer itself.\n\nPlease be sure to use the identifiers exactly as they appear in the instance input — do not rename them or invent new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 29, "edges": [ { "u": 7, "v": 4 }, { "u": 7, "v": 6 }, { "u": 7, "v": 11 }, { "u": 10, "v": 3 }, { "u": 10, "v": 5 }, { "u": 10, "v": 11 }, { "u": 3, "v": 1 }, { "u": 3, "v": 5 }, { "u": 3, "v": 12 }, { "u": 3, "v": 14 }, { "u": 3, "v": 15 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 9 }, { "u": 11, "v": 2 }, { "u": 11, "v": 5 }, { "u": 11, "v": 6 }, { "u": 11, "v": 8 }, { "u": 11, "v": 9 }, { "u": 11, "v": 12 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 11, "v": 15 }, { "u": 13, "v": 8 }, { "u": 9, "v": 1 }, { "u": 8, "v": 6 }, { "u": 14, "v": 15 }, { "u": 12, "v": 2 }, { "u": 2, "v": 1 } ], "source_file": "wv2010.mtx", "density": 0.2761904761904762, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0004.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0004.png", "edge_connectivity": 2 }, "solution": [ 7, 9, 10, 12, 13, 14 ], "obj": 6.0, "instance_variant": { "num_nodes": 15, "num_edges": 29, "edges": [ { "u": 7, "v": 4 }, { "u": 7, "v": 6 }, { "u": 7, "v": 11 }, { "u": 10, "v": 3 }, { "u": 10, "v": 5 }, { "u": 10, "v": 11 }, { "u": 3, "v": 1 }, { "u": 3, "v": 5 }, { "u": 3, "v": 12 }, { "u": 3, "v": 14 }, { "u": 3, "v": 15 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 9 }, { "u": 11, "v": 2 }, { "u": 11, "v": 5 }, { "u": 11, "v": 6 }, { "u": 11, "v": 8 }, { "u": 11, "v": 9 }, { "u": 11, "v": 12 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 11, "v": 15 }, { "u": 13, "v": 8 }, { "u": 9, "v": 1 }, { "u": 8, "v": 6 }, { "u": 14, "v": 15 }, { "u": 12, "v": 2 }, { "u": 2, "v": 1 } ] }, "solution_variant": [ 7, 9, 10, 12, 13, 14 ], "context_index": 5, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a classroom full of kids and the teacher needs to decide who gets solo presentation slots so that no two chosen students are adjacent. The goal is to end up with as many solo presenters as possible; you judge a selection by counting the number of different students in it, and the bigger that number the better. Practical rules: pick distinct students only, and don’t pick any pair that are seated next to each other. The detailed seating chart and options are shown below.\n\nThere are 14 students in total and 25 adjacent pairs count.\n\n| student_u_id | student_v_id |\n|---|---|\n| 7 | 0 |\n| 7 | 1 |\n| 7 | 2 |\n| 7 | 3 |\n| 7 | 6 |\n| 7 | 9 |\n| 7 | 10 |\n| 7 | 12 |\n| 7 | 13 |\n| 8 | 0 |\n| 8 | 12 |\n| 0 | 3 |\n| 0 | 4 |\n| 0 | 11 |\n| 5 | 6 |\n| 5 | 12 |\n| 9 | 6 |\n| 9 | 13 |\n| 10 | 3 |\n| 4 | 11 |\n| 11 | 3 |\n| 6 | 2 |\n| 6 | 12 |\n| 6 | 13 |\n| 13 | 2 |\n\nIf you're going to send me a selection, please use this simple JSON layout so I can pick it up reliably. Just list the chosen seats in the array — nothing fancy.\n\n{\n \"solution\": [\"seat_id\", \"seat_id\", ...]\n}\n\nPretty straightforward: the \"solution\" field is an array with one placeholder per chosen solo presenter (replace each placeholder with the actual seat identifier from the instance). This is just a template to show the shape I expect, not your final answer.\n\nPlease make sure you use the exact identifiers given in the instance input — don't rename them or invent new labels. \n\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 25, "edges": [ { "u": 8, "v": 1 }, { "u": 8, "v": 2 }, { "u": 8, "v": 3 }, { "u": 8, "v": 4 }, { "u": 8, "v": 7 }, { "u": 8, "v": 10 }, { "u": 8, "v": 11 }, { "u": 8, "v": 13 }, { "u": 8, "v": 14 }, { "u": 9, "v": 1 }, { "u": 9, "v": 13 }, { "u": 1, "v": 4 }, { "u": 1, "v": 5 }, { "u": 1, "v": 12 }, { "u": 6, "v": 7 }, { "u": 6, "v": 13 }, { "u": 10, "v": 7 }, { "u": 10, "v": 14 }, { "u": 11, "v": 4 }, { "u": 5, "v": 12 }, { "u": 12, "v": 4 }, { "u": 7, "v": 3 }, { "u": 7, "v": 13 }, { "u": 7, "v": 14 }, { "u": 14, "v": 3 } ], "source_file": "vt2010.mtx", "density": 0.27472527472527475, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0005.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0005.png", "edge_connectivity": 1 }, "solution": [ 2, 3, 5, 6, 9, 10, 11 ], "obj": 7.0, "instance_variant": { "num_nodes": 14, "num_edges": 25, "edges": [ { "u": 7, "v": 0 }, { "u": 7, "v": 1 }, { "u": 7, "v": 2 }, { "u": 7, "v": 3 }, { "u": 7, "v": 6 }, { "u": 7, "v": 9 }, { "u": 7, "v": 10 }, { "u": 7, "v": 12 }, { "u": 7, "v": 13 }, { "u": 8, "v": 0 }, { "u": 8, "v": 12 }, { "u": 0, "v": 3 }, { "u": 0, "v": 4 }, { "u": 0, "v": 11 }, { "u": 5, "v": 6 }, { "u": 5, "v": 12 }, { "u": 9, "v": 6 }, { "u": 9, "v": 13 }, { "u": 10, "v": 3 }, { "u": 4, "v": 11 }, { "u": 11, "v": 3 }, { "u": 6, "v": 2 }, { "u": 6, "v": 12 }, { "u": 6, "v": 13 }, { "u": 13, "v": 2 } ] }, "solution_variant": [ 1, 2, 4, 5, 8, 9, 10 ], "context_index": 6, "input_format": "markdown_table", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone at the shop needs to power up a subset of machines so the system has maximum capacity, while making sure no two powered machines are linked by a cable. What makes one choice better than another is purely the total number of servers left running — count them and the larger total is preferable. Each server gets a single decision (on or off) and the exact connectivity details are shown below.\n\n{\n \"total_servers\": 14,\n \"total_cables\": 29,\n \"edges\": [\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"A\"\n },\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"B\"\n },\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"D\"\n },\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"F\"\n },\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"G\"\n },\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"J\"\n },\n {\n \"server_endpoint_u\": \"M\",\n \"server_endpoint_v\": \"K\"\n },\n {\n \"server_endpoint_u\": \"A\",\n \"server_endpoint_v\": \"B\"\n },\n {\n \"server_endpoint_u\": \"A\",\n \"server_endpoint_v\": \"E\"\n },\n {\n \"server_endpoint_u\": \"A\",\n \"server_endpoint_v\": \"L\"\n },\n {\n \"server_endpoint_u\": \"C\",\n \"server_endpoint_v\": \"D\"\n },\n {\n \"server_endpoint_u\": \"C\",\n \"server_endpoint_v\": \"G\"\n },\n {\n \"server_endpoint_u\": \"G\",\n \"server_endpoint_v\": \"D\"\n },\n {\n \"server_endpoint_u\": \"G\",\n \"server_endpoint_v\": \"I\"\n },\n {\n \"server_endpoint_u\": \"G\",\n \"server_endpoint_v\": \"N\"\n },\n {\n \"server_endpoint_u\": \"J\",\n \"server_endpoint_v\": \"E\"\n },\n {\n \"server_endpoint_u\": \"J\",\n \"server_endpoint_v\": \"I\"\n },\n {\n \"server_endpoint_u\": \"H\",\n \"server_endpoint_v\": \"D\"\n },\n {\n \"server_endpoint_u\": \"H\",\n \"server_endpoint_v\": \"I\"\n },\n {\n \"server_endpoint_u\": \"N\",\n \"server_endpoint_v\": \"B\"\n },\n {\n \"server_endpoint_u\": \"N\",\n \"server_endpoint_v\": \"I\"\n },\n {\n \"server_endpoint_u\": \"N\",\n \"server_endpoint_v\": \"L\"\n },\n {\n \"server_endpoint_u\": \"K\",\n \"server_endpoint_v\": \"D\"\n },\n {\n \"server_endpoint_u\": \"K\",\n \"server_endpoint_v\": \"F\"\n },\n {\n \"server_endpoint_u\": \"B\",\n \"server_endpoint_v\": \"L\"\n },\n {\n \"server_endpoint_u\": \"D\",\n \"server_endpoint_v\": \"I\"\n },\n {\n \"server_endpoint_u\": \"L\",\n \"server_endpoint_v\": \"I\"\n },\n {\n \"server_endpoint_u\": \"I\",\n \"server_endpoint_v\": \"E\"\n },\n {\n \"server_endpoint_u\": \"I\",\n \"server_endpoint_v\": \"F\"\n }\n ]\n}\n\nIf you want to give the answer, just use this little JSON shape so I can read it easily — nothing fancy, just a list of the machines you leave on.\n\n{\n \"solution\": [\"server_id\", \"server_id\", ...]\n}\n\nsolution: an array with the IDs of the servers you decide to power up (one ID per server). Think of it as ticking boxes on a form — each entry is a machine you left running.\n\nThis JSON is just a sketch of the shape I expect, not the actual solution — replace the placeholders with the exact IDs from the instance.\n\nPlease use the identifiers exactly as they appear in the problem input — do not rename them or invent new labels.\nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 29, "edges": [ { "u": 13, "v": 1 }, { "u": 13, "v": 2 }, { "u": 13, "v": 4 }, { "u": 13, "v": 6 }, { "u": 13, "v": 7 }, { "u": 13, "v": 10 }, { "u": 13, "v": 11 }, { "u": 1, "v": 2 }, { "u": 1, "v": 5 }, { "u": 1, "v": 12 }, { "u": 3, "v": 4 }, { "u": 3, "v": 7 }, { "u": 7, "v": 4 }, { "u": 7, "v": 9 }, { "u": 7, "v": 14 }, { "u": 10, "v": 5 }, { "u": 10, "v": 9 }, { "u": 8, "v": 4 }, { "u": 8, "v": 9 }, { "u": 14, "v": 2 }, { "u": 14, "v": 9 }, { "u": 14, "v": 12 }, { "u": 11, "v": 4 }, { "u": 11, "v": 6 }, { "u": 2, "v": 12 }, { "u": 4, "v": 9 }, { "u": 12, "v": 9 }, { "u": 9, "v": 5 }, { "u": 9, "v": 6 } ], "source_file": "wy2010.mtx", "density": 0.31868131868131866, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0006.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0006.png", "edge_connectivity": 2 }, "solution": [ 1, 3, 8, 10, 11, 14 ], "obj": 6.0, "instance_variant": { "num_nodes": 14, "num_edges": 29, "edges": [ { "u": "M", "v": "A" }, { "u": "M", "v": "B" }, { "u": "M", "v": "D" }, { "u": "M", "v": "F" }, { "u": "M", "v": "G" }, { "u": "M", "v": "J" }, { "u": "M", "v": "K" }, { "u": "A", "v": "B" }, { "u": "A", "v": "E" }, { "u": "A", "v": "L" }, { "u": "C", "v": "D" }, { "u": "C", "v": "G" }, { "u": "G", "v": "D" }, { "u": "G", "v": "I" }, { "u": "G", "v": "N" }, { "u": "J", "v": "E" }, { "u": "J", "v": "I" }, { "u": "H", "v": "D" }, { "u": "H", "v": "I" }, { "u": "N", "v": "B" }, { "u": "N", "v": "I" }, { "u": "N", "v": "L" }, { "u": "K", "v": "D" }, { "u": "K", "v": "F" }, { "u": "B", "v": "L" }, { "u": "D", "v": "I" }, { "u": "L", "v": "I" }, { "u": "I", "v": "E" }, { "u": "I", "v": "F" } ] }, "solution_variant": [ "A", "C", "H", "J", "K", "N" ], "context_index": 7, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "On a busy morning the boutique team debated which outfits to put in the window; the rule everyone agreed on was to show as many different garments as possible while avoiding any two chosen items on neighboring hangers. The way to judge a setup is straightforward: count how many garments made it into the window — higher counts are better — and follow the simple ground rules that each chosen hanger shows one unique piece and nothing is doubled. The concrete hanger-by-hanger details are shown below.\n\n{\n \"total_hangers\": 14,\n \"adjacent_hanger_pairs\": 28,\n \"edges\": [\n {\n \"hanger_a\": \"N\",\n \"hanger_b\": \"B\"\n },\n {\n \"hanger_a\": \"N\",\n \"hanger_b\": \"I\"\n },\n {\n \"hanger_a\": \"L\",\n \"hanger_b\": \"F\"\n },\n {\n \"hanger_a\": \"L\",\n \"hanger_b\": \"K\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"A\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"B\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"C\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"E\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"F\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"G\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"H\"\n },\n {\n \"hanger_a\": \"J\",\n \"hanger_b\": \"I\"\n },\n {\n \"hanger_a\": \"H\",\n \"hanger_b\": \"A\"\n },\n {\n \"hanger_a\": \"H\",\n \"hanger_b\": \"F\"\n },\n {\n \"hanger_a\": \"G\",\n \"hanger_b\": \"B\"\n },\n {\n \"hanger_a\": \"G\",\n \"hanger_b\": \"C\"\n },\n {\n \"hanger_a\": \"G\",\n \"hanger_b\": \"E\"\n },\n {\n \"hanger_a\": \"G\",\n \"hanger_b\": \"F\"\n },\n {\n \"hanger_a\": \"G\",\n \"hanger_b\": \"K\"\n },\n {\n \"hanger_a\": \"E\",\n \"hanger_b\": \"B\"\n },\n {\n \"hanger_a\": \"B\",\n \"hanger_b\": \"I\"\n },\n {\n \"hanger_a\": \"B\",\n \"hanger_b\": \"K\"\n },\n {\n \"hanger_a\": \"B\",\n \"hanger_b\": \"M\"\n },\n {\n \"hanger_a\": \"I\",\n \"hanger_b\": \"A\"\n },\n {\n \"hanger_a\": \"F\",\n \"hanger_b\": \"C\"\n },\n {\n \"hanger_a\": \"F\",\n \"hanger_b\": \"K\"\n },\n {\n \"hanger_a\": \"K\",\n \"hanger_b\": \"D\"\n },\n {\n \"hanger_a\": \"K\",\n \"hanger_b\": \"M\"\n }\n ]\n}\n\nIf you want to send back which hangers make the window, just use this simple JSON shape so everything’s predictable:\n\n{\n \"solution\": [\"hanger_id\", \"hanger_id\", ...]\n}\n\nThink of \"solution\" as the list of hangers you picked to display — one entry per hanger, in the same identifier format the instance uses. This JSON is just a sketch of the expected shape, not the actual answer; fill it with the exact hanger identifiers from the instance when you respond.\n\nPlease use the identifiers exactly as they appear in the instance input — no renaming and no new labels. \n\nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 28, "edges": [ { "u": 14, "v": 2 }, { "u": 14, "v": 9 }, { "u": 12, "v": 6 }, { "u": 12, "v": 11 }, { "u": 10, "v": 1 }, { "u": 10, "v": 2 }, { "u": 10, "v": 3 }, { "u": 10, "v": 5 }, { "u": 10, "v": 6 }, { "u": 10, "v": 7 }, { "u": 10, "v": 8 }, { "u": 10, "v": 9 }, { "u": 8, "v": 1 }, { "u": 8, "v": 6 }, { "u": 7, "v": 2 }, { "u": 7, "v": 3 }, { "u": 7, "v": 5 }, { "u": 7, "v": 6 }, { "u": 7, "v": 11 }, { "u": 5, "v": 2 }, { "u": 2, "v": 9 }, { "u": 2, "v": 11 }, { "u": 2, "v": 13 }, { "u": 9, "v": 1 }, { "u": 6, "v": 3 }, { "u": 6, "v": 11 }, { "u": 11, "v": 4 }, { "u": 11, "v": 13 } ], "source_file": "wy2010.mtx", "density": 0.3076923076923077, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0007.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0007.png", "edge_connectivity": 1 }, "solution": [ 3, 4, 5, 8, 12, 13, 14 ], "obj": 7.0, "instance_variant": { "num_nodes": 14, "num_edges": 28, "edges": [ { "u": "N", "v": "B" }, { "u": "N", "v": "I" }, { "u": "L", "v": "F" }, { "u": "L", "v": "K" }, { "u": "J", "v": "A" }, { "u": "J", "v": "B" }, { "u": "J", "v": "C" }, { "u": "J", "v": "E" }, { "u": "J", "v": "F" }, { "u": "J", "v": "G" }, { "u": "J", "v": "H" }, { "u": "J", "v": "I" }, { "u": "H", "v": "A" }, { "u": "H", "v": "F" }, { "u": "G", "v": "B" }, { "u": "G", "v": "C" }, { "u": "G", "v": "E" }, { "u": "G", "v": "F" }, { "u": "G", "v": "K" }, { "u": "E", "v": "B" }, { "u": "B", "v": "I" }, { "u": "B", "v": "K" }, { "u": "B", "v": "M" }, { "u": "I", "v": "A" }, { "u": "F", "v": "C" }, { "u": "F", "v": "K" }, { "u": "K", "v": "D" }, { "u": "K", "v": "M" } ] }, "solution_variant": [ "C", "D", "E", "H", "L", "M", "N" ], "context_index": 8, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "We’ve been asked to schedule bench refurbishments along the waterfront, and the idea is to mark as many benches for work as we can. Plans are judged by how many benches get selected — simply tally the chosen benches, and more is better. One rule: don’t pick a bench that sits next to another picked bench, and every bench can only be chosen once. The concrete details of the promenade are shown below.\n\nThere are 18 benches along the promenade and 37 adjacency pairs between them.\nBenches M and C sit next to each other.\nBenches M and G sit next to each other.\nBenches M and H sit next to each other.\nBenches M and I sit next to each other.\nBenches M and J sit next to each other.\nBenches M and K sit next to each other.\nBenches M and Q sit next to each other.\nBenches O and A sit next to each other.\nBenches O and B sit next to each other.\nBenches O and D sit next to each other.\nBenches O and E sit next to each other.\nBenches L and G sit next to each other.\nBenches L and J sit next to each other.\nBenches L and N sit next to each other.\nBenches P and A sit next to each other.\nBenches P and B sit next to each other.\nBenches P and C sit next to each other.\nBenches P and D sit next to each other.\nBenches P and N sit next to each other.\nBenches P and R sit next to each other.\nBenches F and B sit next to each other.\nBenches F and E sit next to each other.\nBenches F and H sit next to each other.\nBenches H and B sit next to each other.\nBenches H and C sit next to each other.\nBenches H and Q sit next to each other.\nBenches G and C sit next to each other.\nBenches G and R sit next to each other.\nBenches Q and I sit next to each other.\nBenches Q and K sit next to each other.\nBenches I and K sit next to each other.\nBenches D and N sit next to each other.\nBenches N and R sit next to each other.\nBenches E and B sit next to each other.\nBenches C and B sit next to each other.\nBenches C and R sit next to each other.\nBenches A and B sit next to each other.\nWe should aim to mark as many of the 18 benches as possible while avoiding any adjacent picks.\n\nWhen you send the plan back, just stick to this simple JSON shape so I can read it automatically:\n\n{\n \"solution\": [\"bench_id\", \"bench_id\", ...]\n}\n\nThink of it as a short form: \"solution\" is the list of benches you want refurbished. The strings in the array are the bench identifiers — in the example above I used the placeholder bench_id so it matches the bench story, but in your reply you should list the actual IDs from the instance. This block is just the expected shape, not the actual answer.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 37, "edges": [ { "u": 13, "v": 3 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 13, "v": 9 }, { "u": 13, "v": 10 }, { "u": 13, "v": 11 }, { "u": 13, "v": 17 }, { "u": 15, "v": 1 }, { "u": 15, "v": 2 }, { "u": 15, "v": 4 }, { "u": 15, "v": 5 }, { "u": 12, "v": 7 }, { "u": 12, "v": 10 }, { "u": 12, "v": 14 }, { "u": 16, "v": 1 }, { "u": 16, "v": 2 }, { "u": 16, "v": 3 }, { "u": 16, "v": 4 }, { "u": 16, "v": 14 }, { "u": 16, "v": 18 }, { "u": 6, "v": 2 }, { "u": 6, "v": 5 }, { "u": 6, "v": 8 }, { "u": 8, "v": 2 }, { "u": 8, "v": 3 }, { "u": 8, "v": 17 }, { "u": 7, "v": 3 }, { "u": 7, "v": 18 }, { "u": 17, "v": 9 }, { "u": 17, "v": 11 }, { "u": 9, "v": 11 }, { "u": 4, "v": 14 }, { "u": 14, "v": 18 }, { "u": 5, "v": 2 }, { "u": 3, "v": 2 }, { "u": 3, "v": 18 }, { "u": 1, "v": 2 } ], "source_file": "wy2010.mtx", "density": 0.24183006535947713, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0008.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0008.png", "edge_connectivity": 2 }, "solution": [ 1, 5, 7, 8, 10, 11, 14 ], "obj": 7.0, "instance_variant": { "num_nodes": 18, "num_edges": 37, "edges": [ { "u": "M", "v": "C" }, { "u": "M", "v": "G" }, { "u": "M", "v": "H" }, { "u": "M", "v": "I" }, { "u": "M", "v": "J" }, { "u": "M", "v": "K" }, { "u": "M", "v": "Q" }, { "u": "O", "v": "A" }, { "u": "O", "v": "B" }, { "u": "O", "v": "D" }, { "u": "O", "v": "E" }, { "u": "L", "v": "G" }, { "u": "L", "v": "J" }, { "u": "L", "v": "N" }, { "u": "P", "v": "A" }, { "u": "P", "v": "B" }, { "u": "P", "v": "C" }, { "u": "P", "v": "D" }, { "u": "P", "v": "N" }, { "u": "P", "v": "R" }, { "u": "F", "v": "B" }, { "u": "F", "v": "E" }, { "u": "F", "v": "H" }, { "u": "H", "v": "B" }, { "u": "H", "v": "C" }, { "u": "H", "v": "Q" }, { "u": "G", "v": "C" }, { "u": "G", "v": "R" }, { "u": "Q", "v": "I" }, { "u": "Q", "v": "K" }, { "u": "I", "v": "K" }, { "u": "D", "v": "N" }, { "u": "N", "v": "R" }, { "u": "E", "v": "B" }, { "u": "C", "v": "B" }, { "u": "C", "v": "R" }, { "u": "A", "v": "B" } ] }, "solution_variant": [ "A", "E", "G", "H", "J", "K", "N" ], "context_index": 9, "input_format": "nl", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m the gardener looking after a narrow border of plants and trying to decide which ones to keep. The idea is simple: pick as many plants as possible to stay in the border, and the success is measured by how many plants end up being kept — just count them. The catch is that any two plants that sit next to each other can’t both be kept, because their roots would interfere, and each plant must be either kept or removed (no doubles or half-choices). The exact layout and plant positions will be shown below.\n\n{\n \"border_plant_count\": 13,\n \"adjacent_plant_pairs\": 19,\n \"edges\": [\n {\n \"plant_one_id\": 11,\n \"plant_two_id\": 5\n },\n {\n \"plant_one_id\": 11,\n \"plant_two_id\": 6\n },\n {\n \"plant_one_id\": 11,\n \"plant_two_id\": 8\n },\n {\n \"plant_one_id\": 11,\n \"plant_two_id\": 13\n },\n {\n \"plant_one_id\": 9,\n \"plant_two_id\": 12\n },\n {\n \"plant_one_id\": 5,\n \"plant_two_id\": 8\n },\n {\n \"plant_one_id\": 5,\n \"plant_two_id\": 12\n },\n {\n \"plant_one_id\": 13,\n \"plant_two_id\": 1\n },\n {\n \"plant_one_id\": 13,\n \"plant_two_id\": 7\n },\n {\n \"plant_one_id\": 13,\n \"plant_two_id\": 8\n },\n {\n \"plant_one_id\": 10,\n \"plant_two_id\": 2\n },\n {\n \"plant_one_id\": 10,\n \"plant_two_id\": 3\n },\n {\n \"plant_one_id\": 10,\n \"plant_two_id\": 4\n },\n {\n \"plant_one_id\": 10,\n \"plant_two_id\": 6\n },\n {\n \"plant_one_id\": 4,\n \"plant_two_id\": 1\n },\n {\n \"plant_one_id\": 2,\n \"plant_two_id\": 12\n },\n {\n \"plant_one_id\": 7,\n \"plant_two_id\": 1\n },\n {\n \"plant_one_id\": 12,\n \"plant_two_id\": 6\n },\n {\n \"plant_one_id\": 1,\n \"plant_two_id\": 6\n }\n ]\n}\n\nOh, and when you reply, it helps if you stick to a simple JSON shape so I can read which plants you decided to keep. Something like this will do:\n\n{\n \"solution\": [\"plant_id\", \"plant_id\", ...]\n}\n\n\"solution\" is just the list of plants to keep in the border — one identifier per plant. Think of those strings as the exact labels from the plant map you'll get with the instance; this block is just a sketch of the expected shape, not your final answer.\n\nPlease use the identifiers exactly as they appear in the instance input — no renaming and no inventing new labels. Valid identifiers look like plain numbers such as \"1\" or \"23\", single capital letters like \"A\" or \"B\", or a capital letter followed by digits like \"A1\" or \"X7\".", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 19, "edges": [ { "u": 11, "v": 5 }, { "u": 11, "v": 6 }, { "u": 11, "v": 8 }, { "u": 11, "v": 13 }, { "u": 9, "v": 12 }, { "u": 5, "v": 8 }, { "u": 5, "v": 12 }, { "u": 13, "v": 1 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 10, "v": 2 }, { "u": 10, "v": 3 }, { "u": 10, "v": 4 }, { "u": 10, "v": 6 }, { "u": 4, "v": 1 }, { "u": 2, "v": 12 }, { "u": 7, "v": 1 }, { "u": 12, "v": 6 }, { "u": 1, "v": 6 } ], "source_file": "wv2010.mtx", "density": 0.24358974358974358, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0009.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0009.png", "edge_connectivity": 1 }, "solution": [ 2, 3, 4, 5, 6, 7, 9 ], "obj": 7.0, "instance_variant": { "num_nodes": 13, "num_edges": 19, "edges": [ { "u": 11, "v": 5 }, { "u": 11, "v": 6 }, { "u": 11, "v": 8 }, { "u": 11, "v": 13 }, { "u": 9, "v": 12 }, { "u": 5, "v": 8 }, { "u": 5, "v": 12 }, { "u": 13, "v": 1 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 10, "v": 2 }, { "u": 10, "v": 3 }, { "u": 10, "v": 4 }, { "u": 10, "v": 6 }, { "u": 4, "v": 1 }, { "u": 2, "v": 12 }, { "u": 7, "v": 1 }, { "u": 12, "v": 6 }, { "u": 1, "v": 6 } ] }, "solution_variant": [ 2, 3, 4, 5, 6, 7, 9 ], "context_index": 10, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m running the festival lineup this year and need to pick which street performers get spots along the parade route so the crowd always has music without shows bumping into each other. The decision is which spots to fill so no two occupied spots sit next to one another, and the aim is to have as many performers as possible — success is just the total number of acts booked, counted by how many spots end up filled. Each spot can hold at most one act and no performer gets booked twice; the specific route and spots will be shown below.\n\n{\n \"total_spots_on_route\": 18,\n \"total_adjacent_spot_pairs\": 38,\n \"edges\": [\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"A\"\n },\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"B\"\n },\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"G\"\n },\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"I\"\n },\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"L\"\n },\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"N\"\n },\n {\n \"adjacent_spot_u\": \"E\",\n \"adjacent_spot_v\": \"O\"\n },\n {\n \"adjacent_spot_u\": \"H\",\n \"adjacent_spot_v\": \"G\"\n },\n {\n \"adjacent_spot_u\": \"H\",\n \"adjacent_spot_v\": \"K\"\n },\n {\n \"adjacent_spot_u\": \"H\",\n \"adjacent_spot_v\": \"L\"\n },\n {\n \"adjacent_spot_u\": \"H\",\n \"adjacent_spot_v\": \"P\"\n },\n {\n \"adjacent_spot_u\": \"H\",\n \"adjacent_spot_v\": \"Q\"\n },\n {\n \"adjacent_spot_u\": \"F\",\n \"adjacent_spot_v\": \"D\"\n },\n {\n \"adjacent_spot_u\": \"F\",\n \"adjacent_spot_v\": \"I\"\n },\n {\n \"adjacent_spot_u\": \"F\",\n \"adjacent_spot_v\": \"J\"\n },\n {\n \"adjacent_spot_u\": \"F\",\n \"adjacent_spot_v\": \"M\"\n },\n {\n \"adjacent_spot_u\": \"F\",\n \"adjacent_spot_v\": \"O\"\n },\n {\n \"adjacent_spot_u\": \"G\",\n \"adjacent_spot_v\": \"L\"\n },\n {\n \"adjacent_spot_u\": \"G\",\n \"adjacent_spot_v\": \"Q\"\n },\n {\n \"adjacent_spot_u\": \"P\",\n \"adjacent_spot_v\": \"A\"\n },\n {\n \"adjacent_spot_u\": \"P\",\n \"adjacent_spot_v\": \"K\"\n },\n {\n \"adjacent_spot_u\": \"P\",\n \"adjacent_spot_v\": \"L\"\n },\n {\n \"adjacent_spot_u\": \"L\",\n \"adjacent_spot_v\": \"A\"\n },\n {\n \"adjacent_spot_u\": \"M\",\n \"adjacent_spot_v\": \"D\"\n },\n {\n \"adjacent_spot_u\": \"M\",\n \"adjacent_spot_v\": \"I\"\n },\n {\n \"adjacent_spot_u\": \"M\",\n \"adjacent_spot_v\": \"R\"\n },\n {\n \"adjacent_spot_u\": \"N\",\n \"adjacent_spot_v\": \"B\"\n },\n {\n \"adjacent_spot_u\": \"N\",\n \"adjacent_spot_v\": \"D\"\n },\n {\n \"adjacent_spot_u\": \"N\",\n \"adjacent_spot_v\": \"K\"\n },\n {\n \"adjacent_spot_u\": \"N\",\n \"adjacent_spot_v\": \"Q\"\n },\n {\n \"adjacent_spot_u\": \"O\",\n \"adjacent_spot_v\": \"D\"\n },\n {\n \"adjacent_spot_u\": \"O\",\n \"adjacent_spot_v\": \"I\"\n },\n {\n \"adjacent_spot_u\": \"O\",\n \"adjacent_spot_v\": \"J\"\n },\n {\n \"adjacent_spot_u\": \"Q\",\n \"adjacent_spot_v\": \"K\"\n },\n {\n \"adjacent_spot_u\": \"J\",\n \"adjacent_spot_v\": \"D\"\n },\n {\n \"adjacent_spot_u\": \"D\",\n \"adjacent_spot_v\": \"B\"\n },\n {\n \"adjacent_spot_u\": \"D\",\n \"adjacent_spot_v\": \"R\"\n },\n {\n \"adjacent_spot_u\": \"K\",\n \"adjacent_spot_v\": \"C\"\n }\n ]\n}\n\nIf you want to hand me the picks, an easy way is to return a tiny JSON snippet like this so I can parse it quickly:\n\n{\n \"solution\": [\"spot_id\", \"spot_id\", ...]\n}\n\nThis just means \"solution\" should be a list of the spot identifiers you've picked for performers along the route. Think of it like filling out a short form: each entry is the exact spot ID for a booked act. This is only a sketch of the expected shape, not the actual answer you should submit.\n\nPlease use the identifiers exactly as they appear in the instance input — don't rename them or invent new labels. \nfor example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 38, "edges": [ { "u": 5, "v": 1 }, { "u": 5, "v": 2 }, { "u": 5, "v": 7 }, { "u": 5, "v": 9 }, { "u": 5, "v": 12 }, { "u": 5, "v": 14 }, { "u": 5, "v": 15 }, { "u": 8, "v": 7 }, { "u": 8, "v": 11 }, { "u": 8, "v": 12 }, { "u": 8, "v": 16 }, { "u": 8, "v": 17 }, { "u": 6, "v": 4 }, { "u": 6, "v": 9 }, { "u": 6, "v": 10 }, { "u": 6, "v": 13 }, { "u": 6, "v": 15 }, { "u": 7, "v": 12 }, { "u": 7, "v": 17 }, { "u": 16, "v": 1 }, { "u": 16, "v": 11 }, { "u": 16, "v": 12 }, { "u": 12, "v": 1 }, { "u": 13, "v": 4 }, { "u": 13, "v": 9 }, { "u": 13, "v": 18 }, { "u": 14, "v": 2 }, { "u": 14, "v": 4 }, { "u": 14, "v": 11 }, { "u": 14, "v": 17 }, { "u": 15, "v": 4 }, { "u": 15, "v": 9 }, { "u": 15, "v": 10 }, { "u": 17, "v": 11 }, { "u": 10, "v": 4 }, { "u": 4, "v": 2 }, { "u": 4, "v": 18 }, { "u": 11, "v": 3 } ], "source_file": "vt2010.mtx", "density": 0.24836601307189543, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0010.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0010.png", "edge_connectivity": 1 }, "solution": [ 2, 3, 9, 10, 16, 17, 18 ], "obj": 7.0, "instance_variant": { "num_nodes": 18, "num_edges": 38, "edges": [ { "u": "E", "v": "A" }, { "u": "E", "v": "B" }, { "u": "E", "v": "G" }, { "u": "E", "v": "I" }, { "u": "E", "v": "L" }, { "u": "E", "v": "N" }, { "u": "E", "v": "O" }, { "u": "H", "v": "G" }, { "u": "H", "v": "K" }, { "u": "H", "v": "L" }, { "u": "H", "v": "P" }, { "u": "H", "v": "Q" }, { "u": "F", "v": "D" }, { "u": "F", "v": "I" }, { "u": "F", "v": "J" }, { "u": "F", "v": "M" }, { "u": "F", "v": "O" }, { "u": "G", "v": "L" }, { "u": "G", "v": "Q" }, { "u": "P", "v": "A" }, { "u": "P", "v": "K" }, { "u": "P", "v": "L" }, { "u": "L", "v": "A" }, { "u": "M", "v": "D" }, { "u": "M", "v": "I" }, { "u": "M", "v": "R" }, { "u": "N", "v": "B" }, { "u": "N", "v": "D" }, { "u": "N", "v": "K" }, { "u": "N", "v": "Q" }, { "u": "O", "v": "D" }, { "u": "O", "v": "I" }, { "u": "O", "v": "J" }, { "u": "Q", "v": "K" }, { "u": "J", "v": "D" }, { "u": "D", "v": "B" }, { "u": "D", "v": "R" }, { "u": "K", "v": "C" } ] }, "solution_variant": [ "B", "C", "I", "J", "P", "Q", "R" ], "context_index": 11, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "We’re planning a private event and want to cordon off as many tables as possible, while making sure any two tables we mark off aren’t side-by-side. What matters is the total number of tables held for the event — the more, the better — so each possible setup is judged by simply counting how many tables got reserved. Each table can only be in or out (no duplicates or half-reservations), and neighboring tables can’t both be selected. The specific floor plan will be shown below.\n\n{\n \"total_tables\": 18,\n \"total_adjacent_pairs\": 33,\n \"edges\": [\n {\n \"adjacent_table_1\": 4,\n \"adjacent_table_2\": 5\n },\n {\n \"adjacent_table_1\": 4,\n \"adjacent_table_2\": 13\n },\n {\n \"adjacent_table_1\": 4,\n \"adjacent_table_2\": 17\n },\n {\n \"adjacent_table_1\": 18,\n \"adjacent_table_2\": 6\n },\n {\n \"adjacent_table_1\": 18,\n \"adjacent_table_2\": 11\n },\n {\n \"adjacent_table_1\": 10,\n \"adjacent_table_2\": 11\n },\n {\n \"adjacent_table_1\": 9,\n \"adjacent_table_2\": 11\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 3\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 6\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 7\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 8\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 12\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 13\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 14\n },\n {\n \"adjacent_table_1\": 11,\n \"adjacent_table_2\": 17\n },\n {\n \"adjacent_table_1\": 7,\n \"adjacent_table_2\": 14\n },\n {\n \"adjacent_table_1\": 7,\n \"adjacent_table_2\": 17\n },\n {\n \"adjacent_table_1\": 13,\n \"adjacent_table_2\": 5\n },\n {\n \"adjacent_table_1\": 13,\n \"adjacent_table_2\": 17\n },\n {\n \"adjacent_table_1\": 16,\n \"adjacent_table_2\": 1\n },\n {\n \"adjacent_table_1\": 16,\n \"adjacent_table_2\": 2\n },\n {\n \"adjacent_table_1\": 16,\n \"adjacent_table_2\": 3\n },\n {\n \"adjacent_table_1\": 16,\n \"adjacent_table_2\": 17\n },\n {\n \"adjacent_table_1\": 17,\n \"adjacent_table_2\": 2\n },\n {\n \"adjacent_table_1\": 17,\n \"adjacent_table_2\": 3\n },\n {\n \"adjacent_table_1\": 17,\n \"adjacent_table_2\": 5\n },\n {\n \"adjacent_table_1\": 17,\n \"adjacent_table_2\": 6\n },\n {\n \"adjacent_table_1\": 17,\n \"adjacent_table_2\": 14\n },\n {\n \"adjacent_table_1\": 17,\n \"adjacent_table_2\": 15\n },\n {\n \"adjacent_table_1\": 2,\n \"adjacent_table_2\": 15\n },\n {\n \"adjacent_table_1\": 14,\n \"adjacent_table_2\": 3\n },\n {\n \"adjacent_table_1\": 1,\n \"adjacent_table_2\": 3\n },\n {\n \"adjacent_table_1\": 12,\n \"adjacent_table_2\": 3\n }\n ]\n}\n\nWhen you send your answer back, just drop it into a tiny JSON object like this so it's easy to read and process:\n\n{\n \"solution\": [\"table_id\", \"table_id\", ...]\n}\n\nPretty straightforward — \"solution\" is just the list of tables you're reserving for the event. Think of each \"table_id\" as a placeholder for whatever label appears on the floor plan (I'll replace those with the actual labels when I submit the final selection). This JSON is just a sketch of the shape I expect, not the final answer itself.\n\nPlease make sure to use the exact identifiers from the instance input — do not rename them or invent new ones. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 33, "edges": [ { "u": 4, "v": 5 }, { "u": 4, "v": 13 }, { "u": 4, "v": 17 }, { "u": 18, "v": 6 }, { "u": 18, "v": 11 }, { "u": 10, "v": 11 }, { "u": 9, "v": 11 }, { "u": 11, "v": 3 }, { "u": 11, "v": 6 }, { "u": 11, "v": 7 }, { "u": 11, "v": 8 }, { "u": 11, "v": 12 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 11, "v": 17 }, { "u": 7, "v": 14 }, { "u": 7, "v": 17 }, { "u": 13, "v": 5 }, { "u": 13, "v": 17 }, { "u": 16, "v": 1 }, { "u": 16, "v": 2 }, { "u": 16, "v": 3 }, { "u": 16, "v": 17 }, { "u": 17, "v": 2 }, { "u": 17, "v": 3 }, { "u": 17, "v": 5 }, { "u": 17, "v": 6 }, { "u": 17, "v": 14 }, { "u": 17, "v": 15 }, { "u": 2, "v": 15 }, { "u": 14, "v": 3 }, { "u": 1, "v": 3 }, { "u": 12, "v": 3 } ], "source_file": "wa2010.mtx", "density": 0.21568627450980393, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0011.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0011.png", "edge_connectivity": 1 }, "solution": [ 1, 7, 8, 9, 10, 12, 13, 15, 18 ], "obj": 9.0, "instance_variant": { "num_nodes": 18, "num_edges": 33, "edges": [ { "u": 4, "v": 5 }, { "u": 4, "v": 13 }, { "u": 4, "v": 17 }, { "u": 18, "v": 6 }, { "u": 18, "v": 11 }, { "u": 10, "v": 11 }, { "u": 9, "v": 11 }, { "u": 11, "v": 3 }, { "u": 11, "v": 6 }, { "u": 11, "v": 7 }, { "u": 11, "v": 8 }, { "u": 11, "v": 12 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 11, "v": 17 }, { "u": 7, "v": 14 }, { "u": 7, "v": 17 }, { "u": 13, "v": 5 }, { "u": 13, "v": 17 }, { "u": 16, "v": 1 }, { "u": 16, "v": 2 }, { "u": 16, "v": 3 }, { "u": 16, "v": 17 }, { "u": 17, "v": 2 }, { "u": 17, "v": 3 }, { "u": 17, "v": 5 }, { "u": 17, "v": 6 }, { "u": 17, "v": 14 }, { "u": 17, "v": 15 }, { "u": 2, "v": 15 }, { "u": 14, "v": 3 }, { "u": 1, "v": 3 }, { "u": 12, "v": 3 } ] }, "solution_variant": [ 1, 7, 8, 9, 10, 12, 13, 15, 18 ], "context_index": 12, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "At the museum the registrar faces a packing rule: if an artifact is taken from one compartment, items in compartments directly next to it must stay behind. The job is to choose artifacts so the traveling case ends up holding as many separate objects as possible — success is just counting how many distinct artifacts were selected — and no item can be doubled up or partially selected. The exact layout and items are shown below.\n\n# total_compartments=17\n# total_adjacent_pairs=32\ncompartment_u,compartment_v\nG,A\nG,M\nG,Q\nL,A\nL,D\nL,M\nN,F\nN,I\nN,M\nN,P\nA,B\nA,C\nA,D\nA,Q\nB,C\nC,J\nO,D\nO,H\nO,K\nO,M\nM,I\nM,K\nM,P\nM,Q\nI,J\nJ,E\nJ,F\nJ,Q\nE,F\nP,H\nP,K\nK,H\n\nOh — and when you send back which artifacts to take, please use this little JSON shape so it's easy to read:\n\n{\n \"solution\": [\"compartment_id\", \"compartment_id\", ...]\n}\n\nThink of \"solution\" as just a list of the compartment IDs you picked — one entry for each artifact that goes into the traveling case. This is just a sketch of the shape I expect, not the actual answer itself.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 32, "edges": [ { "u": 7, "v": 1 }, { "u": 7, "v": 13 }, { "u": 7, "v": 17 }, { "u": 12, "v": 1 }, { "u": 12, "v": 4 }, { "u": 12, "v": 13 }, { "u": 14, "v": 6 }, { "u": 14, "v": 9 }, { "u": 14, "v": 13 }, { "u": 14, "v": 16 }, { "u": 1, "v": 2 }, { "u": 1, "v": 3 }, { "u": 1, "v": 4 }, { "u": 1, "v": 17 }, { "u": 2, "v": 3 }, { "u": 3, "v": 10 }, { "u": 15, "v": 4 }, { "u": 15, "v": 8 }, { "u": 15, "v": 11 }, { "u": 15, "v": 13 }, { "u": 13, "v": 9 }, { "u": 13, "v": 11 }, { "u": 13, "v": 16 }, { "u": 13, "v": 17 }, { "u": 9, "v": 10 }, { "u": 10, "v": 5 }, { "u": 10, "v": 6 }, { "u": 10, "v": 17 }, { "u": 5, "v": 6 }, { "u": 16, "v": 8 }, { "u": 16, "v": 11 }, { "u": 11, "v": 8 } ], "source_file": "wi2010.mtx", "density": 0.23529411764705882, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0012.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0012.png", "edge_connectivity": 2 }, "solution": [ 2, 5, 7, 9, 12, 15, 16 ], "obj": 7.0, "instance_variant": { "num_nodes": 17, "num_edges": 32, "edges": [ { "u": "G", "v": "A" }, { "u": "G", "v": "M" }, { "u": "G", "v": "Q" }, { "u": "L", "v": "A" }, { "u": "L", "v": "D" }, { "u": "L", "v": "M" }, { "u": "N", "v": "F" }, { "u": "N", "v": "I" }, { "u": "N", "v": "M" }, { "u": "N", "v": "P" }, { "u": "A", "v": "B" }, { "u": "A", "v": "C" }, { "u": "A", "v": "D" }, { "u": "A", "v": "Q" }, { "u": "B", "v": "C" }, { "u": "C", "v": "J" }, { "u": "O", "v": "D" }, { "u": "O", "v": "H" }, { "u": "O", "v": "K" }, { "u": "O", "v": "M" }, { "u": "M", "v": "I" }, { "u": "M", "v": "K" }, { "u": "M", "v": "P" }, { "u": "M", "v": "Q" }, { "u": "I", "v": "J" }, { "u": "J", "v": "E" }, { "u": "J", "v": "F" }, { "u": "J", "v": "Q" }, { "u": "E", "v": "F" }, { "u": "P", "v": "H" }, { "u": "P", "v": "K" }, { "u": "K", "v": "H" } ] }, "solution_variant": [ "B", "E", "G", "I", "L", "O", "P" ], "context_index": 13, "input_format": "csv", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the venue switched consoles and the new rule is to light up as many microphones as possible for a show, but never two that have direct crosstalk between them. The goal is to maximize the number of mics in use — you measure this by simply counting active channels — while making sure no interfering pair is turned on together. Every channel is a single, indivisible choice (on or off) and can’t be counted twice. The detailed diagram of channel interference is provided below.\n\n# total_mic_channels=13\n# total_crosstalk_pairs=23\nmic_channel_u,mic_channel_v\nL,A\nL,C\nL,D\nL,E\nL,F\nL,G\nL,H\nL,I\nL,J\nL,K\nL,M\nE,B\nE,I\nE,M\nF,D\nF,G\nF,J\nH,A\nH,C\nK,A\nC,D\nD,G\nB,I\n\nOh, and when you send the final set of channels, please use this simple JSON shape so it’s easy to read and parse:\n\n{\n \"solution\": [\"mic_id\", \"mic_id\", ...]\n}\n\nThink of that as a little form: \"solution\" is the list of microphones you want turned on (each entry is one channel identifier). The placeholders are just examples showing the shape — you’ll replace them with the actual channel IDs from the instance when you answer.\n\nPlease don’t rename or invent any labels — use the identifiers exactly as they appear in the instance input, no changes. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"\n\nAgain, the JSON above is just a sketch of the expected shape, not the real answer.", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 23, "edges": [ { "u": 12, "v": 1 }, { "u": 12, "v": 3 }, { "u": 12, "v": 4 }, { "u": 12, "v": 5 }, { "u": 12, "v": 6 }, { "u": 12, "v": 7 }, { "u": 12, "v": 8 }, { "u": 12, "v": 9 }, { "u": 12, "v": 10 }, { "u": 12, "v": 11 }, { "u": 12, "v": 13 }, { "u": 5, "v": 2 }, { "u": 5, "v": 9 }, { "u": 5, "v": 13 }, { "u": 6, "v": 4 }, { "u": 6, "v": 7 }, { "u": 6, "v": 10 }, { "u": 8, "v": 1 }, { "u": 8, "v": 3 }, { "u": 11, "v": 1 }, { "u": 3, "v": 4 }, { "u": 4, "v": 7 }, { "u": 2, "v": 9 } ], "source_file": "wa2010.mtx", "density": 0.2948717948717949, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0013.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0013.png", "edge_connectivity": 2 }, "solution": [ 2, 7, 8, 10, 11, 13 ], "obj": 6.0, "instance_variant": { "num_nodes": 13, "num_edges": 23, "edges": [ { "u": "L", "v": "A" }, { "u": "L", "v": "C" }, { "u": "L", "v": "D" }, { "u": "L", "v": "E" }, { "u": "L", "v": "F" }, { "u": "L", "v": "G" }, { "u": "L", "v": "H" }, { "u": "L", "v": "I" }, { "u": "L", "v": "J" }, { "u": "L", "v": "K" }, { "u": "L", "v": "M" }, { "u": "E", "v": "B" }, { "u": "E", "v": "I" }, { "u": "E", "v": "M" }, { "u": "F", "v": "D" }, { "u": "F", "v": "G" }, { "u": "F", "v": "J" }, { "u": "H", "v": "A" }, { "u": "H", "v": "C" }, { "u": "K", "v": "A" }, { "u": "C", "v": "D" }, { "u": "D", "v": "G" }, { "u": "B", "v": "I" } ] }, "solution_variant": [ "B", "G", "H", "J", "K", "M" ], "context_index": 14, "input_format": "csv", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Many people want to use the communal bike racks, and the person running the place has to pick a group of bikes that will actually fit without crowding. The rule we follow is that no two bikes we allow can occupy adjacent rack slots, so approvals need spacing. Better decisions are those that let the greatest number of bikes in; to figure that out, just count how many bikes would be parked under each selection. Nothing is double-booked and every slot holds at most one bike. The concrete rack layout and bike details appear below.\n\n{\n \"total_rack_slots\": 17,\n \"total_adjacent_pairs\": 35,\n \"edges\": [\n {\n \"slot_u\": 11,\n \"slot_v\": 4\n },\n {\n \"slot_u\": 11,\n \"slot_v\": 5\n },\n {\n \"slot_u\": 11,\n \"slot_v\": 8\n },\n {\n \"slot_u\": 11,\n \"slot_v\": 16\n },\n {\n \"slot_u\": 2,\n \"slot_v\": 1\n },\n {\n \"slot_u\": 2,\n \"slot_v\": 9\n },\n {\n \"slot_u\": 2,\n \"slot_v\": 10\n },\n {\n \"slot_u\": 4,\n \"slot_v\": 5\n },\n {\n \"slot_u\": 4,\n \"slot_v\": 16\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 6\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 8\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 9\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 13\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 15\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 16\n },\n {\n \"slot_u\": 14,\n \"slot_v\": 17\n },\n {\n \"slot_u\": 13,\n \"slot_v\": 3\n },\n {\n \"slot_u\": 13,\n \"slot_v\": 10\n },\n {\n \"slot_u\": 13,\n \"slot_v\": 15\n },\n {\n \"slot_u\": 13,\n \"slot_v\": 16\n },\n {\n \"slot_u\": 15,\n \"slot_v\": 10\n },\n {\n \"slot_u\": 17,\n \"slot_v\": 5\n },\n {\n \"slot_u\": 17,\n \"slot_v\": 8\n },\n {\n \"slot_u\": 17,\n \"slot_v\": 16\n },\n {\n \"slot_u\": 16,\n \"slot_v\": 3\n },\n {\n \"slot_u\": 16,\n \"slot_v\": 5\n },\n {\n \"slot_u\": 16,\n \"slot_v\": 6\n },\n {\n \"slot_u\": 16,\n \"slot_v\": 7\n },\n {\n \"slot_u\": 16,\n \"slot_v\": 10\n },\n {\n \"slot_u\": 16,\n \"slot_v\": 12\n },\n {\n \"slot_u\": 12,\n \"slot_v\": 1\n },\n {\n \"slot_u\": 12,\n \"slot_v\": 7\n },\n {\n \"slot_u\": 1,\n \"slot_v\": 10\n },\n {\n \"slot_u\": 9,\n \"slot_v\": 10\n },\n {\n \"slot_u\": 3,\n \"slot_v\": 10\n }\n ]\n}\n\nAlso, when you hand back the chosen slots, please follow this little JSON sketch so it's easy to read by whoever's checking:\n\n{\n \"solution\": [\"slot_id\", \"slot_id\", ...]\n}\n\nThis just means \"solution\" is the list of rack slots you're approving for bikes — each entry is a slot identifier from the instance (the slots that get to park). Think of it as filling out a tiny form: put each approved slot's id into that array. It's just a sketch of the expected shape, not the actual answer.\n\nPlease make sure to use the exact identifiers as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 35, "edges": [ { "u": 11, "v": 4 }, { "u": 11, "v": 5 }, { "u": 11, "v": 8 }, { "u": 11, "v": 16 }, { "u": 2, "v": 1 }, { "u": 2, "v": 9 }, { "u": 2, "v": 10 }, { "u": 4, "v": 5 }, { "u": 4, "v": 16 }, { "u": 14, "v": 6 }, { "u": 14, "v": 8 }, { "u": 14, "v": 9 }, { "u": 14, "v": 13 }, { "u": 14, "v": 15 }, { "u": 14, "v": 16 }, { "u": 14, "v": 17 }, { "u": 13, "v": 3 }, { "u": 13, "v": 10 }, { "u": 13, "v": 15 }, { "u": 13, "v": 16 }, { "u": 15, "v": 10 }, { "u": 17, "v": 5 }, { "u": 17, "v": 8 }, { "u": 17, "v": 16 }, { "u": 16, "v": 3 }, { "u": 16, "v": 5 }, { "u": 16, "v": 6 }, { "u": 16, "v": 7 }, { "u": 16, "v": 10 }, { "u": 16, "v": 12 }, { "u": 12, "v": 1 }, { "u": 12, "v": 7 }, { "u": 1, "v": 10 }, { "u": 9, "v": 10 }, { "u": 3, "v": 10 } ], "source_file": "vt2010.mtx", "density": 0.25735294117647056, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0014.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0014.png", "edge_connectivity": 2 }, "solution": [ 1, 3, 4, 6, 7, 8, 9, 15 ], "obj": 8.0, "instance_variant": { "num_nodes": 17, "num_edges": 35, "edges": [ { "u": 11, "v": 4 }, { "u": 11, "v": 5 }, { "u": 11, "v": 8 }, { "u": 11, "v": 16 }, { "u": 2, "v": 1 }, { "u": 2, "v": 9 }, { "u": 2, "v": 10 }, { "u": 4, "v": 5 }, { "u": 4, "v": 16 }, { "u": 14, "v": 6 }, { "u": 14, "v": 8 }, { "u": 14, "v": 9 }, { "u": 14, "v": 13 }, { "u": 14, "v": 15 }, { "u": 14, "v": 16 }, { "u": 14, "v": 17 }, { "u": 13, "v": 3 }, { "u": 13, "v": 10 }, { "u": 13, "v": 15 }, { "u": 13, "v": 16 }, { "u": 15, "v": 10 }, { "u": 17, "v": 5 }, { "u": 17, "v": 8 }, { "u": 17, "v": 16 }, { "u": 16, "v": 3 }, { "u": 16, "v": 5 }, { "u": 16, "v": 6 }, { "u": 16, "v": 7 }, { "u": 16, "v": 10 }, { "u": 16, "v": 12 }, { "u": 12, "v": 1 }, { "u": 12, "v": 7 }, { "u": 1, "v": 10 }, { "u": 9, "v": 10 }, { "u": 3, "v": 10 } ] }, "solution_variant": [ 1, 3, 4, 6, 7, 8, 9, 15 ], "context_index": 15, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "On a late afternoon the ranger is figuring out which campsites to leave available; the idea is to keep as many as possible but never two that are next to each other. The quality of the plan is simply the number of sites kept open, counted at the end, and each campsite must be decided once (open or closed) with the restriction that no neighboring sites are both open. The campsite specifics and layout are shown below.\n\nThere are 16 campsites and 26 adjacent pairs to consider.\nCampsites D and E are adjacent, so the ranger cannot leave both open.\nCampsites D and H are adjacent, so the ranger cannot leave both open.\nCampsites D and K are adjacent, so the ranger cannot leave both open.\nCampsites D and N are adjacent, so the ranger cannot leave both open.\nCampsites E and F are adjacent, so the ranger cannot leave both open.\nCampsites E and G are adjacent, so the ranger cannot leave both open.\nCampsites E and K are adjacent, so the ranger cannot leave both open.\nCampsites A and B are adjacent, so the ranger cannot leave both open.\nCampsites A and G are adjacent, so the ranger cannot leave both open.\nCampsites A and J are adjacent, so the ranger cannot leave both open.\nCampsites A and O are adjacent, so the ranger cannot leave both open.\nCampsites N and K are adjacent, so the ranger cannot leave both open.\nCampsites N and L are adjacent, so the ranger cannot leave both open.\nCampsites B and F are adjacent, so the ranger cannot leave both open.\nCampsites B and I are adjacent, so the ranger cannot leave both open.\nCampsites B and M are adjacent, so the ranger cannot leave both open.\nCampsites B and P are adjacent, so the ranger cannot leave both open.\nCampsites K and F are adjacent, so the ranger cannot leave both open.\nCampsites O and L are adjacent, so the ranger cannot leave both open.\nCampsites L and C are adjacent, so the ranger cannot leave both open.\nCampsites L and G are adjacent, so the ranger cannot leave both open.\nCampsites L and H are adjacent, so the ranger cannot leave both open.\nCampsites G and H are adjacent, so the ranger cannot leave both open.\nCampsites G and P are adjacent, so the ranger cannot leave both open.\nCampsites P and F are adjacent, so the ranger cannot leave both open.\nCampsites I and J are adjacent, so the ranger cannot leave both open.\nThe ranger will use these 26 adjacencies when deciding which of the 16 sites to keep open.\n\nAlso, just so everything is easy to parse, please return the chosen open campsites using this simple JSON shape:\n\n{\n \"solution\": [\"site_id\", \"site_id\", ...]\n}\n\n\"solution\" is just a list of the campsite IDs you'd like to leave open — one string per site. Think of the placeholders above as examples of the format, not the actual choices.\n\nPlease use the exact identifiers from the instance input; do not rename them or invent new ones. Valid identifiers look like plain numbers such as \"1\" or \"23\", single capital letters like \"A\" or \"B\", or a capital letter followed by digits like \"A1\" or \"X7\".", "instance": { "problem_type": "MIS", "num_nodes": 16, "num_edges": 26, "edges": [ { "u": 4, "v": 5 }, { "u": 4, "v": 8 }, { "u": 4, "v": 11 }, { "u": 4, "v": 14 }, { "u": 5, "v": 6 }, { "u": 5, "v": 7 }, { "u": 5, "v": 11 }, { "u": 1, "v": 2 }, { "u": 1, "v": 7 }, { "u": 1, "v": 10 }, { "u": 1, "v": 15 }, { "u": 14, "v": 11 }, { "u": 14, "v": 12 }, { "u": 2, "v": 6 }, { "u": 2, "v": 9 }, { "u": 2, "v": 13 }, { "u": 2, "v": 16 }, { "u": 11, "v": 6 }, { "u": 15, "v": 12 }, { "u": 12, "v": 3 }, { "u": 12, "v": 7 }, { "u": 12, "v": 8 }, { "u": 7, "v": 8 }, { "u": 7, "v": 16 }, { "u": 16, "v": 6 }, { "u": 9, "v": 10 } ], "source_file": "vt2010.mtx", "density": 0.21666666666666667, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0015.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0015.png", "edge_connectivity": 1 }, "solution": [ 3, 5, 8, 9, 13, 14, 15, 16 ], "obj": 8.0, "instance_variant": { "num_nodes": 16, "num_edges": 26, "edges": [ { "u": "D", "v": "E" }, { "u": "D", "v": "H" }, { "u": "D", "v": "K" }, { "u": "D", "v": "N" }, { "u": "E", "v": "F" }, { "u": "E", "v": "G" }, { "u": "E", "v": "K" }, { "u": "A", "v": "B" }, { "u": "A", "v": "G" }, { "u": "A", "v": "J" }, { "u": "A", "v": "O" }, { "u": "N", "v": "K" }, { "u": "N", "v": "L" }, { "u": "B", "v": "F" }, { "u": "B", "v": "I" }, { "u": "B", "v": "M" }, { "u": "B", "v": "P" }, { "u": "K", "v": "F" }, { "u": "O", "v": "L" }, { "u": "L", "v": "C" }, { "u": "L", "v": "G" }, { "u": "L", "v": "H" }, { "u": "G", "v": "H" }, { "u": "G", "v": "P" }, { "u": "P", "v": "F" }, { "u": "I", "v": "J" } ] }, "solution_variant": [ "C", "E", "H", "I", "M", "N", "O", "P" ], "context_index": 16, "input_format": "nl", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the clerk noticed the aisle was cluttered and decided to bring some crates to the front for easier access, but there’s a catch: crates sitting on neighboring pallets can’t both be moved. The goal is to bring as many crates forward as possible, which is measured by counting how many were moved, and every plan must respect the “no neighboring pallets” rule and avoid picking the same crate twice. The concrete details are shown below.\n\nThere are 13 distinct crates and 24 neighboring-pallet pairs listed below:\nCrate 1 and crate 2 sit on neighboring pallets and therefore cannot both be moved.\nCrate 1 and crate 3 sit on neighboring pallets and therefore cannot both be moved.\nCrate 1 and crate 7 sit on neighboring pallets and therefore cannot both be moved.\nCrate 2 and crate 3 sit on neighboring pallets and therefore cannot both be moved.\nCrate 2 and crate 4 sit on neighboring pallets and therefore cannot both be moved.\nCrate 2 and crate 9 sit on neighboring pallets and therefore cannot both be moved.\nCrate 6 and crate 3 sit on neighboring pallets and therefore cannot both be moved.\nCrate 6 and crate 4 sit on neighboring pallets and therefore cannot both be moved.\nCrate 6 and crate 5 sit on neighboring pallets and therefore cannot both be moved.\nCrate 6 and crate 7 sit on neighboring pallets and therefore cannot both be moved.\nCrate 6 and crate 11 sit on neighboring pallets and therefore cannot both be moved.\nCrate 6 and crate 13 sit on neighboring pallets and therefore cannot both be moved.\nCrate 7 and crate 3 sit on neighboring pallets and therefore cannot both be moved.\nCrate 13 and crate 11 sit on neighboring pallets and therefore cannot both be moved.\nCrate 12 and crate 9 sit on neighboring pallets and therefore cannot both be moved.\nCrate 12 and crate 11 sit on neighboring pallets and therefore cannot both be moved.\nCrate 5 and crate 4 sit on neighboring pallets and therefore cannot both be moved.\nCrate 5 and crate 10 sit on neighboring pallets and therefore cannot both be moved.\nCrate 5 and crate 11 sit on neighboring pallets and therefore cannot both be moved.\nCrate 4 and crate 9 sit on neighboring pallets and therefore cannot both be moved.\nCrate 4 and crate 11 sit on neighboring pallets and therefore cannot both be moved.\nCrate 8 and crate 9 sit on neighboring pallets and therefore cannot both be moved.\nCrate 9 and crate 11 sit on neighboring pallets and therefore cannot both be moved.\nCrate 11 and crate 10 sit on neighboring pallets and therefore cannot both be moved.\nPlans must respect the no-neighbor rule and must not pick the same crate twice.\n\nYou can just send the chosen pallets back in this simple JSON layout so I know which crates to bring forward:\n\n{\n \"solution\": [\"pallet_id\", \"pallet_id\", ...]\n}\n\n\"solution\" is just a list of the pallet identifiers for the crates you want moved (one entry per crate). Think of it like filling out a small checklist: each string is the exact label of a pallet you picked. This JSON is only a sketch of the shape I expect, not the actual answer—replace the placeholders with the real IDs from the instance.\n\nAll identifiers must be used exactly as they appear in the instance input — no renaming and no new labels.\nfor example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 24, "edges": [ { "u": 1, "v": 2 }, { "u": 1, "v": 3 }, { "u": 1, "v": 7 }, { "u": 2, "v": 3 }, { "u": 2, "v": 4 }, { "u": 2, "v": 9 }, { "u": 6, "v": 3 }, { "u": 6, "v": 4 }, { "u": 6, "v": 5 }, { "u": 6, "v": 7 }, { "u": 6, "v": 11 }, { "u": 6, "v": 13 }, { "u": 7, "v": 3 }, { "u": 13, "v": 11 }, { "u": 12, "v": 9 }, { "u": 12, "v": 11 }, { "u": 5, "v": 4 }, { "u": 5, "v": 10 }, { "u": 5, "v": 11 }, { "u": 4, "v": 9 }, { "u": 4, "v": 11 }, { "u": 8, "v": 9 }, { "u": 9, "v": 11 }, { "u": 11, "v": 10 } ], "source_file": "wi2010.mtx", "density": 0.3076923076923077, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0016.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0016.png", "edge_connectivity": 1 }, "solution": [ 4, 7, 8, 10, 12, 13 ], "obj": 6.0, "instance_variant": { "num_nodes": 13, "num_edges": 24, "edges": [ { "u": 1, "v": 2 }, { "u": 1, "v": 3 }, { "u": 1, "v": 7 }, { "u": 2, "v": 3 }, { "u": 2, "v": 4 }, { "u": 2, "v": 9 }, { "u": 6, "v": 3 }, { "u": 6, "v": 4 }, { "u": 6, "v": 5 }, { "u": 6, "v": 7 }, { "u": 6, "v": 11 }, { "u": 6, "v": 13 }, { "u": 7, "v": 3 }, { "u": 13, "v": 11 }, { "u": 12, "v": 9 }, { "u": 12, "v": 11 }, { "u": 5, "v": 4 }, { "u": 5, "v": 10 }, { "u": 5, "v": 11 }, { "u": 4, "v": 9 }, { "u": 4, "v": 11 }, { "u": 8, "v": 9 }, { "u": 9, "v": 11 }, { "u": 11, "v": 10 } ] }, "solution_variant": [ 4, 7, 8, 10, 12, 13 ], "context_index": 17, "input_format": "nl", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a convention coming up and the lighting crew wants to spotlight booths, but they don’t want two neighboring booths both under the same lights. The job is to mark as many booths as possible for priority lighting while making sure no two chosen booths sit next to one another. The simplest way to tell which plan is best is to count the marked booths — the plan with the biggest count wins — and every pick has to be a real booth from the plan with no repeats. The specific hall layout appears below.\n\n# total_booths=13\n# total_adjacency_pairs=23\nadjacent_booth_1,adjacent_booth_2\n9,2\n9,5\n4,1\n4,3\n4,5\n4,13\n10,5\n1,5\n5,2\n5,6\n5,7\n5,8\n5,13\n6,2\n6,7\n6,12\n7,3\n7,11\n7,12\n11,2\n11,12\n12,2\n13,3\n\nI'll return the chosen booths in a tiny JSON snippet so it's easy to read and parse. Something like this:\n\n{\n \"solution\": [\"booth_id\", \"booth_id\", ...]\n}\n\nHere \"solution\" is just a list of the booths we're marking for priority lighting — each item is a booth identifier from the hall layout (and no repeats). This JSON is only a sketch of the shape I’ll use, not the actual final selection.\n\nPlease use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 23, "edges": [ { "u": 9, "v": 2 }, { "u": 9, "v": 5 }, { "u": 4, "v": 1 }, { "u": 4, "v": 3 }, { "u": 4, "v": 5 }, { "u": 4, "v": 13 }, { "u": 10, "v": 5 }, { "u": 1, "v": 5 }, { "u": 5, "v": 2 }, { "u": 5, "v": 6 }, { "u": 5, "v": 7 }, { "u": 5, "v": 8 }, { "u": 5, "v": 13 }, { "u": 6, "v": 2 }, { "u": 6, "v": 7 }, { "u": 6, "v": 12 }, { "u": 7, "v": 3 }, { "u": 7, "v": 11 }, { "u": 7, "v": 12 }, { "u": 11, "v": 2 }, { "u": 11, "v": 12 }, { "u": 12, "v": 2 }, { "u": 13, "v": 3 } ], "source_file": "vt2010.mtx", "density": 0.2948717948717949, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0017.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0017.png", "edge_connectivity": 1 }, "solution": [ 1, 6, 8, 9, 10, 11, 13 ], "obj": 7.0, "instance_variant": { "num_nodes": 13, "num_edges": 23, "edges": [ { "u": 9, "v": 2 }, { "u": 9, "v": 5 }, { "u": 4, "v": 1 }, { "u": 4, "v": 3 }, { "u": 4, "v": 5 }, { "u": 4, "v": 13 }, { "u": 10, "v": 5 }, { "u": 1, "v": 5 }, { "u": 5, "v": 2 }, { "u": 5, "v": 6 }, { "u": 5, "v": 7 }, { "u": 5, "v": 8 }, { "u": 5, "v": 13 }, { "u": 6, "v": 2 }, { "u": 6, "v": 7 }, { "u": 6, "v": 12 }, { "u": 7, "v": 3 }, { "u": 7, "v": 11 }, { "u": 7, "v": 12 }, { "u": 11, "v": 2 }, { "u": 11, "v": 12 }, { "u": 12, "v": 2 }, { "u": 13, "v": 3 } ] }, "solution_variant": [ 1, 6, 8, 9, 10, 11, 13 ], "context_index": 18, "input_format": "csv", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a neighborhood parade coming and the volunteer coordinator is trying to pack the route with helpers without putting any two of them side by side. The choice is which positions along the lineup to staff so that the total number of helpers is as high as possible, and the way to judge a plan is simple: count the helpers — more counts mean a better plan. Each chosen spot is used once and nobody gets assigned to two spots; the concrete lineup info is shown below.\n\n{\n \"total_positions\": 13,\n \"num_adjacent_pairs\": 25,\n \"edges\": [\n {\n \"position_u\": 2,\n \"position_v\": 4\n },\n {\n \"position_u\": 2,\n \"position_v\": 9\n },\n {\n \"position_u\": 2,\n \"position_v\": 11\n },\n {\n \"position_u\": 10,\n \"position_v\": 3\n },\n {\n \"position_u\": 10,\n \"position_v\": 4\n },\n {\n \"position_u\": 7,\n \"position_v\": 3\n },\n {\n \"position_u\": 7,\n \"position_v\": 4\n },\n {\n \"position_u\": 7,\n \"position_v\": 6\n },\n {\n \"position_u\": 7,\n \"position_v\": 12\n },\n {\n \"position_u\": 11,\n \"position_v\": 4\n },\n {\n \"position_u\": 11,\n \"position_v\": 9\n },\n {\n \"position_u\": 3,\n \"position_v\": 1\n },\n {\n \"position_u\": 3,\n \"position_v\": 4\n },\n {\n \"position_u\": 3,\n \"position_v\": 8\n },\n {\n \"position_u\": 1,\n \"position_v\": 4\n },\n {\n \"position_u\": 1,\n \"position_v\": 8\n },\n {\n \"position_u\": 1,\n \"position_v\": 9\n },\n {\n \"position_u\": 12,\n \"position_v\": 0\n },\n {\n \"position_u\": 12,\n \"position_v\": 6\n },\n {\n \"position_u\": 4,\n \"position_v\": 0\n },\n {\n \"position_u\": 4,\n \"position_v\": 5\n },\n {\n \"position_u\": 4,\n \"position_v\": 6\n },\n {\n \"position_u\": 4,\n \"position_v\": 9\n },\n {\n \"position_u\": 9,\n \"position_v\": 5\n },\n {\n \"position_u\": 0,\n \"position_v\": 6\n }\n ]\n}\n\nIf you want to send back which positions to staff, just use this little JSON shape so it's easy to read and parse:\n\n{\n \"solution\": [\"spot_id\", \"spot_id\", ...]\n}\n\n\"solution\" is just the list of parade spots you picked for helpers — one entry per chosen position. Think of each string in that array as the exact label for a spot from the lineup (this JSON is just a sketch of the shape I expect, not the actual answer).\n\nPlease use the identifiers exactly as they appear in the instance input — do not rename them and do not invent new labels.\n\nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 25, "edges": [ { "u": 3, "v": 5 }, { "u": 3, "v": 10 }, { "u": 3, "v": 12 }, { "u": 11, "v": 4 }, { "u": 11, "v": 5 }, { "u": 8, "v": 4 }, { "u": 8, "v": 5 }, { "u": 8, "v": 7 }, { "u": 8, "v": 13 }, { "u": 12, "v": 5 }, { "u": 12, "v": 10 }, { "u": 4, "v": 2 }, { "u": 4, "v": 5 }, { "u": 4, "v": 9 }, { "u": 2, "v": 5 }, { "u": 2, "v": 9 }, { "u": 2, "v": 10 }, { "u": 13, "v": 1 }, { "u": 13, "v": 7 }, { "u": 5, "v": 1 }, { "u": 5, "v": 6 }, { "u": 5, "v": 7 }, { "u": 5, "v": 10 }, { "u": 10, "v": 6 }, { "u": 1, "v": 7 } ], "source_file": "wy2010.mtx", "density": 0.32051282051282054, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0018.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0018.png", "edge_connectivity": 2 }, "solution": [ 1, 6, 8, 9, 11, 12 ], "obj": 6.0, "instance_variant": { "num_nodes": 13, "num_edges": 25, "edges": [ { "u": 2, "v": 4 }, { "u": 2, "v": 9 }, { "u": 2, "v": 11 }, { "u": 10, "v": 3 }, { "u": 10, "v": 4 }, { "u": 7, "v": 3 }, { "u": 7, "v": 4 }, { "u": 7, "v": 6 }, { "u": 7, "v": 12 }, { "u": 11, "v": 4 }, { "u": 11, "v": 9 }, { "u": 3, "v": 1 }, { "u": 3, "v": 4 }, { "u": 3, "v": 8 }, { "u": 1, "v": 4 }, { "u": 1, "v": 8 }, { "u": 1, "v": 9 }, { "u": 12, "v": 0 }, { "u": 12, "v": 6 }, { "u": 4, "v": 0 }, { "u": 4, "v": 5 }, { "u": 4, "v": 6 }, { "u": 4, "v": 9 }, { "u": 9, "v": 5 }, { "u": 0, "v": 6 } ] }, "solution_variant": [ 0, 5, 7, 8, 10, 11 ], "context_index": 19, "input_format": "json", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone at the operations desk is trying to maximize coverage tonight by switching on as many cell sites as possible, while making sure no directly interfering pair is active together. The selection is straightforward: for every pair that’s directly linked, choose at most one of them to be live, and then tally up how many stations are live — the higher that tally, the better the outcome. Every station needs a definitive on/off decision (no duplicates, no ignoring entries), and the concrete network layout is shown below.\n\n{\n \"total_base_stations\": 14,\n \"total_interference_links\": 24,\n \"edges\": [\n {\n \"station_endpoint_a\": \"M\",\n \"station_endpoint_b\": \"D\"\n },\n {\n \"station_endpoint_a\": \"M\",\n \"station_endpoint_b\": \"I\"\n },\n {\n \"station_endpoint_a\": \"M\",\n \"station_endpoint_b\": \"J\"\n },\n {\n \"station_endpoint_a\": \"N\",\n \"station_endpoint_b\": \"D\"\n },\n {\n \"station_endpoint_a\": \"N\",\n \"station_endpoint_b\": \"G\"\n },\n {\n \"station_endpoint_a\": \"N\",\n \"station_endpoint_b\": \"J\"\n },\n {\n \"station_endpoint_a\": \"D\",\n \"station_endpoint_b\": \"G\"\n },\n {\n \"station_endpoint_a\": \"D\",\n \"station_endpoint_b\": \"J\"\n },\n {\n \"station_endpoint_a\": \"G\",\n \"station_endpoint_b\": \"F\"\n },\n {\n \"station_endpoint_a\": \"G\",\n \"station_endpoint_b\": \"H\"\n },\n {\n \"station_endpoint_a\": \"E\",\n \"station_endpoint_b\": \"A\"\n },\n {\n \"station_endpoint_a\": \"E\",\n \"station_endpoint_b\": \"B\"\n },\n {\n \"station_endpoint_a\": \"E\",\n \"station_endpoint_b\": \"C\"\n },\n {\n \"station_endpoint_a\": \"E\",\n \"station_endpoint_b\": \"F\"\n },\n {\n \"station_endpoint_a\": \"E\",\n \"station_endpoint_b\": \"I\"\n },\n {\n \"station_endpoint_a\": \"E\",\n \"station_endpoint_b\": \"K\"\n },\n {\n \"station_endpoint_a\": \"F\",\n \"station_endpoint_b\": \"C\"\n },\n {\n \"station_endpoint_a\": \"F\",\n \"station_endpoint_b\": \"H\"\n },\n {\n \"station_endpoint_a\": \"F\",\n \"station_endpoint_b\": \"L\"\n },\n {\n \"station_endpoint_a\": \"C\",\n \"station_endpoint_b\": \"J\"\n },\n {\n \"station_endpoint_a\": \"B\",\n \"station_endpoint_b\": \"K\"\n },\n {\n \"station_endpoint_a\": \"I\",\n \"station_endpoint_b\": \"J\"\n },\n {\n \"station_endpoint_a\": \"H\",\n \"station_endpoint_b\": \"L\"\n },\n {\n \"station_endpoint_a\": \"K\",\n \"station_endpoint_b\": \"L\"\n }\n ]\n}\n\nAlso, when you send the final selection back, please use this simple JSON layout so it's easy to parse:\n\n{\n \"solution\": [\"site_id\", \"site_id\", ...]\n}\n\nThis just means \"solution\" should be a list of the site IDs you want switched on. Think of it like ticking boxes on a form — each quoted entry is the exact station identifier you choose to make live. The JSON above is only a sketch of the shape I expect, not the actual answer.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as '1' or '23', single capital letters like 'A' or 'B', or a capital letter followed by digits like 'A1' or 'X7'.\"", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 24, "edges": [ { "u": 13, "v": 4 }, { "u": 13, "v": 9 }, { "u": 13, "v": 10 }, { "u": 14, "v": 4 }, { "u": 14, "v": 7 }, { "u": 14, "v": 10 }, { "u": 4, "v": 7 }, { "u": 4, "v": 10 }, { "u": 7, "v": 6 }, { "u": 7, "v": 8 }, { "u": 5, "v": 1 }, { "u": 5, "v": 2 }, { "u": 5, "v": 3 }, { "u": 5, "v": 6 }, { "u": 5, "v": 9 }, { "u": 5, "v": 11 }, { "u": 6, "v": 3 }, { "u": 6, "v": 8 }, { "u": 6, "v": 12 }, { "u": 3, "v": 10 }, { "u": 2, "v": 11 }, { "u": 9, "v": 10 }, { "u": 8, "v": 12 }, { "u": 11, "v": 12 } ], "source_file": "vt2010.mtx", "density": 0.26373626373626374, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0019.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0019.png", "edge_connectivity": 1 }, "solution": [ 1, 2, 3, 9, 12, 14 ], "obj": 6.0, "instance_variant": { "num_nodes": 14, "num_edges": 24, "edges": [ { "u": "M", "v": "D" }, { "u": "M", "v": "I" }, { "u": "M", "v": "J" }, { "u": "N", "v": "D" }, { "u": "N", "v": "G" }, { "u": "N", "v": "J" }, { "u": "D", "v": "G" }, { "u": "D", "v": "J" }, { "u": "G", "v": "F" }, { "u": "G", "v": "H" }, { "u": "E", "v": "A" }, { "u": "E", "v": "B" }, { "u": "E", "v": "C" }, { "u": "E", "v": "F" }, { "u": "E", "v": "I" }, { "u": "E", "v": "K" }, { "u": "F", "v": "C" }, { "u": "F", "v": "H" }, { "u": "F", "v": "L" }, { "u": "C", "v": "J" }, { "u": "B", "v": "K" }, { "u": "I", "v": "J" }, { "u": "H", "v": "L" }, { "u": "K", "v": "L" } ] }, "solution_variant": [ "A", "B", "C", "I", "L", "N" ], "context_index": 20, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m the club adviser trying to build the best possible presenter lineup for the school assembly: pick as many students as I can to go on stage, but never pick two who have a time clash with each other. The idea is simple — the better the lineup, the more students are speaking, so count how many presenters are chosen and aim for the highest total. No student can be picked twice, and if two students’ schedules overlap, only one of them can be in the final group. The concrete list of students and their schedule conflicts is shown below.\n\n{\n \"total_students\": 14,\n \"total_schedule_conflicts\": 25,\n \"edges\": [\n {\n \"conflicting_student_a\": \"D\",\n \"conflicting_student_b\": \"E\"\n },\n {\n \"conflicting_student_a\": \"D\",\n \"conflicting_student_b\": \"G\"\n },\n {\n \"conflicting_student_a\": \"D\",\n \"conflicting_student_b\": \"H\"\n },\n {\n \"conflicting_student_a\": \"D\",\n \"conflicting_student_b\": \"I\"\n },\n {\n \"conflicting_student_a\": \"D\",\n \"conflicting_student_b\": \"J\"\n },\n {\n \"conflicting_student_a\": \"D\",\n \"conflicting_student_b\": \"L\"\n },\n {\n \"conflicting_student_a\": \"G\",\n \"conflicting_student_b\": \"C\"\n },\n {\n \"conflicting_student_a\": \"G\",\n \"conflicting_student_b\": \"F\"\n },\n {\n \"conflicting_student_a\": \"G\",\n \"conflicting_student_b\": \"J\"\n },\n {\n \"conflicting_student_a\": \"E\",\n \"conflicting_student_b\": \"F\"\n },\n {\n \"conflicting_student_a\": \"E\",\n \"conflicting_student_b\": \"I\"\n },\n {\n \"conflicting_student_a\": \"N\",\n \"conflicting_student_b\": \"A\"\n },\n {\n \"conflicting_student_a\": \"N\",\n \"conflicting_student_b\": \"K\"\n },\n {\n \"conflicting_student_a\": \"I\",\n \"conflicting_student_b\": \"L\"\n },\n {\n \"conflicting_student_a\": \"L\",\n \"conflicting_student_b\": \"H\"\n },\n {\n \"conflicting_student_a\": \"M\",\n \"conflicting_student_b\": \"C\"\n },\n {\n \"conflicting_student_a\": \"M\",\n \"conflicting_student_b\": \"F\"\n },\n {\n \"conflicting_student_a\": \"C\",\n \"conflicting_student_b\": \"A\"\n },\n {\n \"conflicting_student_a\": \"C\",\n \"conflicting_student_b\": \"J\"\n },\n {\n \"conflicting_student_a\": \"H\",\n \"conflicting_student_b\": \"B\"\n },\n {\n \"conflicting_student_a\": \"H\",\n \"conflicting_student_b\": \"K\"\n },\n {\n \"conflicting_student_a\": \"K\",\n \"conflicting_student_b\": \"A\"\n },\n {\n \"conflicting_student_a\": \"K\",\n \"conflicting_student_b\": \"B\"\n },\n {\n \"conflicting_student_a\": \"B\",\n \"conflicting_student_b\": \"A\"\n },\n {\n \"conflicting_student_a\": \"B\",\n \"conflicting_student_b\": \"J\"\n }\n ]\n}\n\nYou can just send back the final lineup in a tiny JSON snippet like this — super simple and machine-friendly:\n\n{\n \"solution\": [\"presenter_id\", \"presenter_id\", ...]\n}\n\nThink of \"solution\" as the box where you list the student IDs you're putting on stage. Each \"presenter_id\" is a placeholder for one chosen student — replace those placeholders with the actual IDs from the instance when you give the real answer. This JSON is just a sketch of the shape I want, not the actual final lineup.\n\nPlease be sure to use the exact identifiers from the instance input — don't rename them or invent new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 25, "edges": [ { "u": 4, "v": 5 }, { "u": 4, "v": 7 }, { "u": 4, "v": 8 }, { "u": 4, "v": 9 }, { "u": 4, "v": 10 }, { "u": 4, "v": 12 }, { "u": 7, "v": 3 }, { "u": 7, "v": 6 }, { "u": 7, "v": 10 }, { "u": 5, "v": 6 }, { "u": 5, "v": 9 }, { "u": 14, "v": 1 }, { "u": 14, "v": 11 }, { "u": 9, "v": 12 }, { "u": 12, "v": 8 }, { "u": 13, "v": 3 }, { "u": 13, "v": 6 }, { "u": 3, "v": 1 }, { "u": 3, "v": 10 }, { "u": 8, "v": 2 }, { "u": 8, "v": 11 }, { "u": 11, "v": 1 }, { "u": 11, "v": 2 }, { "u": 2, "v": 1 }, { "u": 2, "v": 10 } ], "source_file": "wy2010.mtx", "density": 0.27472527472527475, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0020.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0020.png", "edge_connectivity": 2 }, "solution": [ 2, 5, 7, 12, 13, 14 ], "obj": 6.0, "instance_variant": { "num_nodes": 14, "num_edges": 25, "edges": [ { "u": "D", "v": "E" }, { "u": "D", "v": "G" }, { "u": "D", "v": "H" }, { "u": "D", "v": "I" }, { "u": "D", "v": "J" }, { "u": "D", "v": "L" }, { "u": "G", "v": "C" }, { "u": "G", "v": "F" }, { "u": "G", "v": "J" }, { "u": "E", "v": "F" }, { "u": "E", "v": "I" }, { "u": "N", "v": "A" }, { "u": "N", "v": "K" }, { "u": "I", "v": "L" }, { "u": "L", "v": "H" }, { "u": "M", "v": "C" }, { "u": "M", "v": "F" }, { "u": "C", "v": "A" }, { "u": "C", "v": "J" }, { "u": "H", "v": "B" }, { "u": "H", "v": "K" }, { "u": "K", "v": "A" }, { "u": "K", "v": "B" }, { "u": "B", "v": "A" }, { "u": "B", "v": "J" } ] }, "solution_variant": [ "B", "E", "G", "L", "M", "N" ], "context_index": 21, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "On a busy weekend the restaurant wants to offer a generous tasting menu, but ingredient clashes force some tough calls. The task is to select a combination of distinct dishes where no two chosen items clash, and then see how many dishes that gives you — the larger that number, the better the menu. Each dish is either included once or left off the menu. The specific dishes and the pairs that clash are provided below.\n\nThere are 17 dishes and 36 clashing pairs listed below:\nDish 4 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 4 clashes with dish 6; they cannot both be included on the tasting menu.\nDish 4 clashes with dish 16; they cannot both be included on the tasting menu.\nDish 12 clashes with dish 6; they cannot both be included on the tasting menu.\nDish 12 clashes with dish 16; they cannot both be included on the tasting menu.\nDish 2 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 2 clashes with dish 7; they cannot both be included on the tasting menu.\nDish 2 clashes with dish 10; they cannot both be included on the tasting menu.\nDish 2 clashes with dish 11; they cannot both be included on the tasting menu.\nDish 16 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 16 clashes with dish 5; they cannot both be included on the tasting menu.\nDish 16 clashes with dish 6; they cannot both be included on the tasting menu.\nDish 16 clashes with dish 10; they cannot both be included on the tasting menu.\nDish 16 clashes with dish 13; they cannot both be included on the tasting menu.\nDish 14 clashes with dish 5; they cannot both be included on the tasting menu.\nDish 14 clashes with dish 6; they cannot both be included on the tasting menu.\nDish 14 clashes with dish 9; they cannot both be included on the tasting menu.\nDish 14 clashes with dish 13; they cannot both be included on the tasting menu.\nDish 15 clashes with dish 3; they cannot both be included on the tasting menu.\nDish 15 clashes with dish 6; they cannot both be included on the tasting menu.\nDish 15 clashes with dish 9; they cannot both be included on the tasting menu.\nDish 15 clashes with dish 11; they cannot both be included on the tasting menu.\nDish 9 clashes with dish 6; they cannot both be included on the tasting menu.\nDish 6 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 6 clashes with dish 3; they cannot both be included on the tasting menu.\nDish 6 clashes with dish 8; they cannot both be included on the tasting menu.\nDish 6 clashes with dish 13; they cannot both be included on the tasting menu.\nDish 10 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 11 clashes with dish 3; they cannot both be included on the tasting menu.\nDish 8 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 3 clashes with dish 0; they cannot both be included on the tasting menu.\nDish 3 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 0 clashes with dish 1; they cannot both be included on the tasting menu.\nDish 0 clashes with dish 7; they cannot both be included on the tasting menu.\nDish 5 clashes with dish 13; they cannot both be included on the tasting menu.\nDish 7 clashes with dish 1; they cannot both be included on the tasting menu.\nSelect the largest possible clash-free set of dishes to make the tasting menu as generous as possible.\n\nAlso, when you send back the chosen dishes, please use this simple JSON layout so I can read it easily:\n\n{\n \"solution\": [\"dish_id\", \"dish_id\", ...]\n}\n\nThis just means the value for \"solution\" should be a list of the dish identifiers you picked for the menu (one entry per dish). Think of it like filling out a short form — the JSON above is just the shape I expect, not the actual answer.\n\nPlease use the identifiers exactly as they appear in the instance input — don't rename them or invent new labels. Valid identifiers look like:\n- plain numbers such as \"1\" or \"23\"\n- single capital letters like \"A\" or \"B\"\n- a capital letter followed by digits like \"A1\" or \"X7\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 36, "edges": [ { "u": 5, "v": 2 }, { "u": 5, "v": 7 }, { "u": 5, "v": 17 }, { "u": 13, "v": 7 }, { "u": 13, "v": 17 }, { "u": 3, "v": 2 }, { "u": 3, "v": 8 }, { "u": 3, "v": 11 }, { "u": 3, "v": 12 }, { "u": 17, "v": 2 }, { "u": 17, "v": 6 }, { "u": 17, "v": 7 }, { "u": 17, "v": 11 }, { "u": 17, "v": 14 }, { "u": 15, "v": 6 }, { "u": 15, "v": 7 }, { "u": 15, "v": 10 }, { "u": 15, "v": 14 }, { "u": 16, "v": 4 }, { "u": 16, "v": 7 }, { "u": 16, "v": 10 }, { "u": 16, "v": 12 }, { "u": 10, "v": 7 }, { "u": 7, "v": 2 }, { "u": 7, "v": 4 }, { "u": 7, "v": 9 }, { "u": 7, "v": 14 }, { "u": 11, "v": 2 }, { "u": 12, "v": 4 }, { "u": 9, "v": 2 }, { "u": 4, "v": 1 }, { "u": 4, "v": 2 }, { "u": 1, "v": 2 }, { "u": 1, "v": 8 }, { "u": 6, "v": 14 }, { "u": 8, "v": 2 } ], "source_file": "wy2010.mtx", "density": 0.2647058823529412, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0021.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0021.png", "edge_connectivity": 2 }, "solution": [ 5, 6, 8, 9, 10, 11, 12, 13 ], "obj": 8.0, "instance_variant": { "num_nodes": 17, "num_edges": 36, "edges": [ { "u": 4, "v": 1 }, { "u": 4, "v": 6 }, { "u": 4, "v": 16 }, { "u": 12, "v": 6 }, { "u": 12, "v": 16 }, { "u": 2, "v": 1 }, { "u": 2, "v": 7 }, { "u": 2, "v": 10 }, { "u": 2, "v": 11 }, { "u": 16, "v": 1 }, { "u": 16, "v": 5 }, { "u": 16, "v": 6 }, { "u": 16, "v": 10 }, { "u": 16, "v": 13 }, { "u": 14, "v": 5 }, { "u": 14, "v": 6 }, { "u": 14, "v": 9 }, { "u": 14, "v": 13 }, { "u": 15, "v": 3 }, { "u": 15, "v": 6 }, { "u": 15, "v": 9 }, { "u": 15, "v": 11 }, { "u": 9, "v": 6 }, { "u": 6, "v": 1 }, { "u": 6, "v": 3 }, { "u": 6, "v": 8 }, { "u": 6, "v": 13 }, { "u": 10, "v": 1 }, { "u": 11, "v": 3 }, { "u": 8, "v": 1 }, { "u": 3, "v": 0 }, { "u": 3, "v": 1 }, { "u": 0, "v": 1 }, { "u": 0, "v": 7 }, { "u": 5, "v": 13 }, { "u": 7, "v": 1 } ] }, "solution_variant": [ 4, 5, 7, 8, 9, 10, 11, 12 ], "context_index": 22, "input_format": "nl", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "In our neighborhood, putting together the volunteer roster for the fair means trying to get the biggest team we can, but with one rule: don’t sign up any two people who’ve got a personal conflict. The choice is who to roster — one arrangement is better than another if it ends up with a greater number of distinct helpers, so you just count the names to compare. Don’t add anybody twice, only pick from the people who offered, and if two people are known to clash, they can’t both be chosen. The exact details are listed below.\n\nThere are 17 volunteers in total and 30 conflicts.\n\n| volunteer_a | volunteer_b |\n|---|---|\n| 2 | 1 |\n| 2 | 13 |\n| 2 | 17 |\n| 17 | 1 |\n| 17 | 14 |\n| 11 | 1 |\n| 11 | 3 |\n| 11 | 5 |\n| 11 | 10 |\n| 11 | 13 |\n| 11 | 14 |\n| 11 | 15 |\n| 11 | 16 |\n| 6 | 5 |\n| 6 | 10 |\n| 6 | 16 |\n| 12 | 3 |\n| 12 | 14 |\n| 8 | 4 |\n| 8 | 10 |\n| 15 | 4 |\n| 14 | 13 |\n| 9 | 3 |\n| 9 | 5 |\n| 16 | 5 |\n| 16 | 10 |\n| 10 | 4 |\n| 10 | 7 |\n| 7 | 5 |\n| 3 | 5 |\n\nAlso, when you send the final roster back, please use this simple JSON layout so it's easy to parse:\n\n{\n \"solution\": [\"volunteer_id\", \"volunteer_id\", ...]\n}\n\nThink of \"solution\" as the list of people you're choosing for the fair — each string is the identifier for one person from the problem instance (the exact label that showed up in the input). This JSON is just a sketch of the shape I expect, not the final answer itself.\n\nPlease use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 30, "edges": [ { "u": 2, "v": 1 }, { "u": 2, "v": 13 }, { "u": 2, "v": 17 }, { "u": 17, "v": 1 }, { "u": 17, "v": 14 }, { "u": 11, "v": 1 }, { "u": 11, "v": 3 }, { "u": 11, "v": 5 }, { "u": 11, "v": 10 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 11, "v": 15 }, { "u": 11, "v": 16 }, { "u": 6, "v": 5 }, { "u": 6, "v": 10 }, { "u": 6, "v": 16 }, { "u": 12, "v": 3 }, { "u": 12, "v": 14 }, { "u": 8, "v": 4 }, { "u": 8, "v": 10 }, { "u": 15, "v": 4 }, { "u": 14, "v": 13 }, { "u": 9, "v": 3 }, { "u": 9, "v": 5 }, { "u": 16, "v": 5 }, { "u": 16, "v": 10 }, { "u": 10, "v": 4 }, { "u": 10, "v": 7 }, { "u": 7, "v": 5 }, { "u": 3, "v": 5 } ], "source_file": "vt2010.mtx", "density": 0.22058823529411764, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0022.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0022.png", "edge_connectivity": 2 }, "solution": [ 6, 7, 8, 9, 12, 13, 15, 17 ], "obj": 8.0, "instance_variant": { "num_nodes": 17, "num_edges": 30, "edges": [ { "u": 2, "v": 1 }, { "u": 2, "v": 13 }, { "u": 2, "v": 17 }, { "u": 17, "v": 1 }, { "u": 17, "v": 14 }, { "u": 11, "v": 1 }, { "u": 11, "v": 3 }, { "u": 11, "v": 5 }, { "u": 11, "v": 10 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 11, "v": 15 }, { "u": 11, "v": 16 }, { "u": 6, "v": 5 }, { "u": 6, "v": 10 }, { "u": 6, "v": 16 }, { "u": 12, "v": 3 }, { "u": 12, "v": 14 }, { "u": 8, "v": 4 }, { "u": 8, "v": 10 }, { "u": 15, "v": 4 }, { "u": 14, "v": 13 }, { "u": 9, "v": 3 }, { "u": 9, "v": 5 }, { "u": 16, "v": 5 }, { "u": 16, "v": 10 }, { "u": 10, "v": 4 }, { "u": 10, "v": 7 }, { "u": 7, "v": 5 }, { "u": 3, "v": 5 } ] }, "solution_variant": [ 6, 7, 8, 9, 12, 13, 15, 17 ], "context_index": 23, "input_format": "markdown_table", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone on the programming team needs to assemble an hour-long set and must avoid putting any two policy-conflicted songs in the same playlist. The choice is which songs to include in that hour so the list contains the highest possible count of distinct tracks while steering clear of any forbidden pairings. A playlist with a higher count of songs is better — evaluate it by tallying the tracks. Repeats aren’t allowed, and the full list of tracks and the station’s incompatibility notes appear below.\n\n{\n \"total_tracks_available\": 13,\n \"incompatibility_pair_count\": 26,\n \"edges\": [\n {\n \"track_a_id\": 6,\n \"track_b_id\": 2\n },\n {\n \"track_a_id\": 6,\n \"track_b_id\": 5\n },\n {\n \"track_a_id\": 6,\n \"track_b_id\": 9\n },\n {\n \"track_a_id\": 6,\n \"track_b_id\": 10\n },\n {\n \"track_a_id\": 3,\n \"track_b_id\": 2\n },\n {\n \"track_a_id\": 3,\n \"track_b_id\": 8\n },\n {\n \"track_a_id\": 3,\n \"track_b_id\": 10\n },\n {\n \"track_a_id\": 13,\n \"track_b_id\": 2\n },\n {\n \"track_a_id\": 13,\n \"track_b_id\": 4\n },\n {\n \"track_a_id\": 13,\n \"track_b_id\": 9\n },\n {\n \"track_a_id\": 13,\n \"track_b_id\": 11\n },\n {\n \"track_a_id\": 4,\n \"track_b_id\": 7\n },\n {\n \"track_a_id\": 4,\n \"track_b_id\": 8\n },\n {\n \"track_a_id\": 4,\n \"track_b_id\": 11\n },\n {\n \"track_a_id\": 4,\n \"track_b_id\": 12\n },\n {\n \"track_a_id\": 7,\n \"track_b_id\": 10\n },\n {\n \"track_a_id\": 2,\n \"track_b_id\": 9\n },\n {\n \"track_a_id\": 2,\n \"track_b_id\": 10\n },\n {\n \"track_a_id\": 8,\n \"track_b_id\": 10\n },\n {\n \"track_a_id\": 1,\n \"track_b_id\": 10\n },\n {\n \"track_a_id\": 1,\n \"track_b_id\": 12\n },\n {\n \"track_a_id\": 11,\n \"track_b_id\": 5\n },\n {\n \"track_a_id\": 10,\n \"track_b_id\": 5\n },\n {\n \"track_a_id\": 10,\n \"track_b_id\": 12\n },\n {\n \"track_a_id\": 9,\n \"track_b_id\": 5\n },\n {\n \"track_a_id\": 12,\n \"track_b_id\": 5\n }\n ]\n}\n\nAlso, when you hand the final playlist back, it'd be great if you use a tiny JSON snippet like this so it's easy to parse:\n\n{\n \"solution\": [\"song_id\", \"song_id\", ...]\n}\n\nHere \"solution\" is just the list of tracks you're picking for that hour, and each \"song_id\" is a placeholder for a song identifier from the instance (so think of it like filling in the names or IDs of the tracks you chose). This is just the shape I expect — not the real answer itself.\n\nPlease make sure to use the exact identifiers from the instance input, with no renaming or extra labels. For example:\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 26, "edges": [ { "u": 6, "v": 2 }, { "u": 6, "v": 5 }, { "u": 6, "v": 9 }, { "u": 6, "v": 10 }, { "u": 3, "v": 2 }, { "u": 3, "v": 8 }, { "u": 3, "v": 10 }, { "u": 13, "v": 2 }, { "u": 13, "v": 4 }, { "u": 13, "v": 9 }, { "u": 13, "v": 11 }, { "u": 4, "v": 7 }, { "u": 4, "v": 8 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 7, "v": 10 }, { "u": 2, "v": 9 }, { "u": 2, "v": 10 }, { "u": 8, "v": 10 }, { "u": 1, "v": 10 }, { "u": 1, "v": 12 }, { "u": 11, "v": 5 }, { "u": 10, "v": 5 }, { "u": 10, "v": 12 }, { "u": 9, "v": 5 }, { "u": 12, "v": 5 } ], "source_file": "wi2010.mtx", "density": 0.3333333333333333, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0023.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0023.png", "edge_connectivity": 2 }, "solution": [ 1, 6, 7, 8, 13 ], "obj": 5.0, "instance_variant": { "num_nodes": 13, "num_edges": 26, "edges": [ { "u": 6, "v": 2 }, { "u": 6, "v": 5 }, { "u": 6, "v": 9 }, { "u": 6, "v": 10 }, { "u": 3, "v": 2 }, { "u": 3, "v": 8 }, { "u": 3, "v": 10 }, { "u": 13, "v": 2 }, { "u": 13, "v": 4 }, { "u": 13, "v": 9 }, { "u": 13, "v": 11 }, { "u": 4, "v": 7 }, { "u": 4, "v": 8 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 7, "v": 10 }, { "u": 2, "v": 9 }, { "u": 2, "v": 10 }, { "u": 8, "v": 10 }, { "u": 1, "v": 10 }, { "u": 1, "v": 12 }, { "u": 11, "v": 5 }, { "u": 10, "v": 5 }, { "u": 10, "v": 12 }, { "u": 9, "v": 5 }, { "u": 12, "v": 5 } ] }, "solution_variant": [ 1, 6, 7, 8, 13 ], "context_index": 24, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I manage a band and need to put together a live set. The trick is to pick the biggest possible group of songs that all work together — if any two songs are a bad match and can’t follow each other, they can’t both be in the set. The better the set, the more songs it contains, so lineups are compared by simply counting how many songs made the cut. Each song is a single, indivisible choice (no repeats allowed), and no pair that conflicts can both be included. The concrete song-by-song details are shown below.\n\n# total_songs_available=17\n# total_conflicting_pairs=31\nsong_a_id,song_b_id\n17,10\n17,13\n4,3\n4,7\n4,11\n4,12\n4,14\n7,1\n7,6\n7,13\n7,14\n12,2\n12,3\n12,10\n13,1\n13,11\n10,11\n5,3\n5,6\n5,14\n5,15\n14,3\n14,6\n15,3\n15,6\n9,3\n9,16\n8,2\n8,3\n8,16\n16,3\n\nAlso, when you send the final lineup, please stick it into a tiny JSON snippet like this so it’s easy to read and parse:\n\n{\n \"solution\": [\"song_id\", \"song_id\", ...]\n}\n\nThis just means \"solution\" holds a list of the song identifiers you picked for the set — each entry should be the exact label used in the instance (it's just a sketch of the shape I want, not the actual answer). Use the real song IDs from the input; don't make up new names or change them.\n\nUse identifiers exactly as they appear in the instance input — no renaming and no new labels.\nFor example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 31, "edges": [ { "u": 17, "v": 10 }, { "u": 17, "v": 13 }, { "u": 4, "v": 3 }, { "u": 4, "v": 7 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 4, "v": 14 }, { "u": 7, "v": 1 }, { "u": 7, "v": 6 }, { "u": 7, "v": 13 }, { "u": 7, "v": 14 }, { "u": 12, "v": 2 }, { "u": 12, "v": 3 }, { "u": 12, "v": 10 }, { "u": 13, "v": 1 }, { "u": 13, "v": 11 }, { "u": 10, "v": 11 }, { "u": 5, "v": 3 }, { "u": 5, "v": 6 }, { "u": 5, "v": 14 }, { "u": 5, "v": 15 }, { "u": 14, "v": 3 }, { "u": 14, "v": 6 }, { "u": 15, "v": 3 }, { "u": 15, "v": 6 }, { "u": 9, "v": 3 }, { "u": 9, "v": 16 }, { "u": 8, "v": 2 }, { "u": 8, "v": 3 }, { "u": 8, "v": 16 }, { "u": 16, "v": 3 } ], "source_file": "wa2010.mtx", "density": 0.22794117647058823, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0024.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0024.png", "edge_connectivity": 2 }, "solution": [ 1, 8, 9, 11, 12, 14, 15, 17 ], "obj": 8.0, "instance_variant": { "num_nodes": 17, "num_edges": 31, "edges": [ { "u": 17, "v": 10 }, { "u": 17, "v": 13 }, { "u": 4, "v": 3 }, { "u": 4, "v": 7 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 4, "v": 14 }, { "u": 7, "v": 1 }, { "u": 7, "v": 6 }, { "u": 7, "v": 13 }, { "u": 7, "v": 14 }, { "u": 12, "v": 2 }, { "u": 12, "v": 3 }, { "u": 12, "v": 10 }, { "u": 13, "v": 1 }, { "u": 13, "v": 11 }, { "u": 10, "v": 11 }, { "u": 5, "v": 3 }, { "u": 5, "v": 6 }, { "u": 5, "v": 14 }, { "u": 5, "v": 15 }, { "u": 14, "v": 3 }, { "u": 14, "v": 6 }, { "u": 15, "v": 3 }, { "u": 15, "v": 6 }, { "u": 9, "v": 3 }, { "u": 9, "v": 16 }, { "u": 8, "v": 2 }, { "u": 8, "v": 3 }, { "u": 8, "v": 16 }, { "u": 16, "v": 3 } ] }, "solution_variant": [ 1, 8, 9, 11, 12, 14, 15, 17 ], "context_index": 25, "input_format": "csv", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a bit of a puzzle in the office: pick which desks to use so the most people can work on-site without ever placing two folks who clash next to each other. What makes one choice better than another is simple — it seats more people, and that’s measured by tallying the occupied desks. The rules are straightforward: each desk gets at most one person and any pair marked as “shouldn’t sit together” cannot both be chosen. The specific floorplan and the list of those pairings are shown below.\n\n# total_desks=14\n# num_conflict_pairs=24\ndesk_a,desk_b\n9,0\n9,1\n5,2\n5,7\n5,11\n13,6\n13,8\n13,10\n3,1\n3,6\n3,10\n3,11\n12,4\n12,7\n12,10\n8,1\n10,4\n10,6\n10,7\n10,11\n11,1\n2,1\n1,0\n1,6\n\nIf you want to give me the chosen desks, a tiny JSON snippet like this is perfect:\n\n{\n \"solution\": [\"desk_id\", \"desk_id\", ...]\n}\n\nThink of it like a simple list: \"solution\" holds the desks you picked, and each entry is the exact desk identifier from the floorplan. It's just a sketch of the shape I expect — swap those placeholders out for the real desk IDs when you send the actual answer.\n\nPlease use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 24, "edges": [ { "u": 10, "v": 1 }, { "u": 10, "v": 2 }, { "u": 6, "v": 3 }, { "u": 6, "v": 8 }, { "u": 6, "v": 12 }, { "u": 14, "v": 7 }, { "u": 14, "v": 9 }, { "u": 14, "v": 11 }, { "u": 4, "v": 2 }, { "u": 4, "v": 7 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 13, "v": 5 }, { "u": 13, "v": 8 }, { "u": 13, "v": 11 }, { "u": 9, "v": 2 }, { "u": 11, "v": 5 }, { "u": 11, "v": 7 }, { "u": 11, "v": 8 }, { "u": 11, "v": 12 }, { "u": 12, "v": 2 }, { "u": 3, "v": 2 }, { "u": 2, "v": 1 }, { "u": 2, "v": 7 } ], "source_file": "wv2010.mtx", "density": 0.26373626373626374, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0025.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0025.png", "edge_connectivity": 2 }, "solution": [ 1, 3, 5, 7, 8, 9, 12 ], "obj": 7.0, "instance_variant": { "num_nodes": 14, "num_edges": 24, "edges": [ { "u": 9, "v": 0 }, { "u": 9, "v": 1 }, { "u": 5, "v": 2 }, { "u": 5, "v": 7 }, { "u": 5, "v": 11 }, { "u": 13, "v": 6 }, { "u": 13, "v": 8 }, { "u": 13, "v": 10 }, { "u": 3, "v": 1 }, { "u": 3, "v": 6 }, { "u": 3, "v": 10 }, { "u": 3, "v": 11 }, { "u": 12, "v": 4 }, { "u": 12, "v": 7 }, { "u": 12, "v": 10 }, { "u": 8, "v": 1 }, { "u": 10, "v": 4 }, { "u": 10, "v": 6 }, { "u": 10, "v": 7 }, { "u": 10, "v": 11 }, { "u": 11, "v": 1 }, { "u": 2, "v": 1 }, { "u": 1, "v": 0 }, { "u": 1, "v": 6 } ] }, "solution_variant": [ 0, 2, 4, 6, 7, 8, 11 ], "context_index": 26, "input_format": "csv", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Out at the lake the weekend roster needs putting together, and the brief is to pick as many different activities as possible, with the catch that certain activities conflict and can’t be paired. The task is deciding which activities to slot into the program so none of the chosen ones are in conflict and the overall program is as large as it can be. You tell which plan is better by the number of activities it contains — simply count them to compare. Each activity chosen must be unique and must not clash with any other chosen activity; the concrete activity names and their conflict relationships are listed below.\n\nThere are 18 activities in total and 40 conflicts.\n\n| activity_a | activity_b |\n|---|---|\n| 18 | 2 |\n| 18 | 4 |\n| 18 | 7 |\n| 18 | 10 |\n| 18 | 14 |\n| 8 | 2 |\n| 8 | 4 |\n| 8 | 6 |\n| 8 | 12 |\n| 1 | 2 |\n| 1 | 5 |\n| 1 | 17 |\n| 14 | 4 |\n| 14 | 7 |\n| 9 | 13 |\n| 10 | 2 |\n| 10 | 4 |\n| 10 | 6 |\n| 2 | 3 |\n| 2 | 5 |\n| 2 | 6 |\n| 2 | 7 |\n| 2 | 12 |\n| 2 | 13 |\n| 2 | 16 |\n| 2 | 17 |\n| 5 | 4 |\n| 5 | 7 |\n| 5 | 15 |\n| 3 | 17 |\n| 12 | 4 |\n| 12 | 13 |\n| 6 | 4 |\n| 11 | 4 |\n| 11 | 13 |\n| 11 | 15 |\n| 13 | 4 |\n| 13 | 15 |\n| 4 | 7 |\n| 4 | 15 |\n\nIf you want to hand the answer back in a tidy, machine-friendly way, just drop the chosen activities into a tiny JSON snippet like this:\n\n{\n \"solution\": [\"activity_id\", \"activity_id\", ...]\n}\n\nThink of \"solution\" as the list of activities you've picked for the weekend roster — each entry should be the exact identifier for an activity from the instance. This JSON is just a sketch of the shape I expect, not the final filled-in answer.\n\nPlease use the identifiers exactly as they appear in the instance input — don't rename them or invent new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 40, "edges": [ { "u": 18, "v": 2 }, { "u": 18, "v": 4 }, { "u": 18, "v": 7 }, { "u": 18, "v": 10 }, { "u": 18, "v": 14 }, { "u": 8, "v": 2 }, { "u": 8, "v": 4 }, { "u": 8, "v": 6 }, { "u": 8, "v": 12 }, { "u": 1, "v": 2 }, { "u": 1, "v": 5 }, { "u": 1, "v": 17 }, { "u": 14, "v": 4 }, { "u": 14, "v": 7 }, { "u": 9, "v": 13 }, { "u": 10, "v": 2 }, { "u": 10, "v": 4 }, { "u": 10, "v": 6 }, { "u": 2, "v": 3 }, { "u": 2, "v": 5 }, { "u": 2, "v": 6 }, { "u": 2, "v": 7 }, { "u": 2, "v": 12 }, { "u": 2, "v": 13 }, { "u": 2, "v": 16 }, { "u": 2, "v": 17 }, { "u": 5, "v": 4 }, { "u": 5, "v": 7 }, { "u": 5, "v": 15 }, { "u": 3, "v": 17 }, { "u": 12, "v": 4 }, { "u": 12, "v": 13 }, { "u": 6, "v": 4 }, { "u": 11, "v": 4 }, { "u": 11, "v": 13 }, { "u": 11, "v": 15 }, { "u": 13, "v": 4 }, { "u": 13, "v": 15 }, { "u": 4, "v": 7 }, { "u": 4, "v": 15 } ], "source_file": "wi2010.mtx", "density": 0.26143790849673204, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0026.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0026.png", "edge_connectivity": 1 }, "solution": [ 1, 3, 9, 10, 11, 12, 14, 16 ], "obj": 8.0, "instance_variant": { "num_nodes": 18, "num_edges": 40, "edges": [ { "u": 18, "v": 2 }, { "u": 18, "v": 4 }, { "u": 18, "v": 7 }, { "u": 18, "v": 10 }, { "u": 18, "v": 14 }, { "u": 8, "v": 2 }, { "u": 8, "v": 4 }, { "u": 8, "v": 6 }, { "u": 8, "v": 12 }, { "u": 1, "v": 2 }, { "u": 1, "v": 5 }, { "u": 1, "v": 17 }, { "u": 14, "v": 4 }, { "u": 14, "v": 7 }, { "u": 9, "v": 13 }, { "u": 10, "v": 2 }, { "u": 10, "v": 4 }, { "u": 10, "v": 6 }, { "u": 2, "v": 3 }, { "u": 2, "v": 5 }, { "u": 2, "v": 6 }, { "u": 2, "v": 7 }, { "u": 2, "v": 12 }, { "u": 2, "v": 13 }, { "u": 2, "v": 16 }, { "u": 2, "v": 17 }, { "u": 5, "v": 4 }, { "u": 5, "v": 7 }, { "u": 5, "v": 15 }, { "u": 3, "v": 17 }, { "u": 12, "v": 4 }, { "u": 12, "v": 13 }, { "u": 6, "v": 4 }, { "u": 11, "v": 4 }, { "u": 11, "v": 13 }, { "u": 11, "v": 15 }, { "u": 13, "v": 4 }, { "u": 13, "v": 15 }, { "u": 4, "v": 7 }, { "u": 4, "v": 15 } ] }, "solution_variant": [ 1, 3, 9, 10, 11, 12, 14, 16 ], "context_index": 27, "input_format": "markdown_table", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m organizing the readings for a wedding and need to pick as many pieces as possible for the ceremony, but some of those readings clash with each other and can’t both be used. The job is to assemble the biggest collection of readings that don’t conflict — the better the plan, the more readings it contains, so the plan is judged simply by counting how many are included. Each reading can only be used once and clashing pairs must never both be chosen. The exact list of readings and which ones clash will be shown below.\n\nBelow are the 18 readings and 31 clash pairs I’ll consider:\nReading J clashes with reading D — I can’t include both.\nReading J clashes with reading I — I can’t include both.\nReading J clashes with reading P — I can’t include both.\nReading J clashes with reading Q — I can’t include both.\nReading F clashes with reading G — I can’t include both.\nReading F clashes with reading K — I can’t include both.\nReading F clashes with reading M — I can’t include both.\nReading K clashes with reading L — I can’t include both.\nReading K clashes with reading M — I can’t include both.\nReading K clashes with reading P — I can’t include both.\nReading L clashes with reading A — I can’t include both.\nReading L clashes with reading C — I can’t include both.\nReading L clashes with reading D — I can’t include both.\nReading L clashes with reading H — I can’t include both.\nReading L clashes with reading N — I can’t include both.\nReading L clashes with reading O — I can’t include both.\nReading L clashes with reading P — I can’t include both.\nReading L clashes with reading R — I can’t include both.\nReading D clashes with reading H — I can’t include both.\nReading D clashes with reading P — I can’t include both.\nReading C clashes with reading H — I can’t include both.\nReading M clashes with reading G — I can’t include both.\nReading M clashes with reading H — I can’t include both.\nReading N clashes with reading A — I can’t include both.\nReading N clashes with reading O — I can’t include both.\nReading G clashes with reading Q — I can’t include both.\nReading P clashes with reading I — I can’t include both.\nReading Q clashes with reading B — I can’t include both.\nReading Q clashes with reading H — I can’t include both.\nReading A clashes with reading H — I can’t include both.\nReading B clashes with reading E — I can’t include both.\nI’ll choose the largest set of non-conflicting readings from these 18 options and 31 clashes.\n\nIf you could send your final plan in a tiny, predictable format, that would be great — something like this JSON sketch so I can quickly check which readings you picked:\n\n{\n \"solution\": [\"reading_id\", \"reading_id\", ...]\n}\n\nHere \"solution\" is just the list of readings you want to use — each entry should be the reading's identifier from the instance. Think of it like filling in a simple form: put each chosen reading's ID inside the array, comma-separated. This block is just a template showing the shape I expect, not the actual answer.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — no renaming, no made-up labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 31, "edges": [ { "u": 10, "v": 4 }, { "u": 10, "v": 9 }, { "u": 10, "v": 16 }, { "u": 10, "v": 17 }, { "u": 6, "v": 7 }, { "u": 6, "v": 11 }, { "u": 6, "v": 13 }, { "u": 11, "v": 12 }, { "u": 11, "v": 13 }, { "u": 11, "v": 16 }, { "u": 12, "v": 1 }, { "u": 12, "v": 3 }, { "u": 12, "v": 4 }, { "u": 12, "v": 8 }, { "u": 12, "v": 14 }, { "u": 12, "v": 15 }, { "u": 12, "v": 16 }, { "u": 12, "v": 18 }, { "u": 4, "v": 8 }, { "u": 4, "v": 16 }, { "u": 3, "v": 8 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 14, "v": 1 }, { "u": 14, "v": 15 }, { "u": 7, "v": 17 }, { "u": 16, "v": 9 }, { "u": 17, "v": 2 }, { "u": 17, "v": 8 }, { "u": 1, "v": 8 }, { "u": 2, "v": 5 } ], "source_file": "wi2010.mtx", "density": 0.20261437908496732, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0027.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0027.png", "edge_connectivity": 1 }, "solution": [ 1, 3, 4, 5, 9, 11, 15, 17, 18 ], "obj": 9.0, "instance_variant": { "num_nodes": 18, "num_edges": 31, "edges": [ { "u": "J", "v": "D" }, { "u": "J", "v": "I" }, { "u": "J", "v": "P" }, { "u": "J", "v": "Q" }, { "u": "F", "v": "G" }, { "u": "F", "v": "K" }, { "u": "F", "v": "M" }, { "u": "K", "v": "L" }, { "u": "K", "v": "M" }, { "u": "K", "v": "P" }, { "u": "L", "v": "A" }, { "u": "L", "v": "C" }, { "u": "L", "v": "D" }, { "u": "L", "v": "H" }, { "u": "L", "v": "N" }, { "u": "L", "v": "O" }, { "u": "L", "v": "P" }, { "u": "L", "v": "R" }, { "u": "D", "v": "H" }, { "u": "D", "v": "P" }, { "u": "C", "v": "H" }, { "u": "M", "v": "G" }, { "u": "M", "v": "H" }, { "u": "N", "v": "A" }, { "u": "N", "v": "O" }, { "u": "G", "v": "Q" }, { "u": "P", "v": "I" }, { "u": "Q", "v": "B" }, { "u": "Q", "v": "H" }, { "u": "A", "v": "H" }, { "u": "B", "v": "E" } ] }, "solution_variant": [ "A", "C", "D", "E", "I", "K", "O", "Q", "R" ], "context_index": 28, "input_format": "nl", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone at the shelter has to go through the list and pick which animals can go into the communal play area; the aim is to allow as many animals as possible while never putting any pair that fights into the same session. Success is measured by how many animals get the green light — higher is better — and you get that by counting the approved animals. No animal can be approved twice and no selection may include two animals that clash. The concrete details will be shown below.\n\nThere are 18 animals listed and 33 fighting pairs to evaluate.\nAnimals 8 and 4 form a fighting pair and must not be approved together.\nAnimals 8 and 5 form a fighting pair and must not be approved together.\nAnimals 8 and 7 form a fighting pair and must not be approved together.\nAnimals 8 and 11 form a fighting pair and must not be approved together.\nAnimals 8 and 14 form a fighting pair and must not be approved together.\nAnimals 14 and 6 form a fighting pair and must not be approved together.\nAnimals 14 and 9 form a fighting pair and must not be approved together.\nAnimals 14 and 16 form a fighting pair and must not be approved together.\nAnimals 15 and 1 form a fighting pair and must not be approved together.\nAnimals 15 and 2 form a fighting pair and must not be approved together.\nAnimals 15 and 9 form a fighting pair and must not be approved together.\nAnimals 15 and 10 form a fighting pair and must not be approved together.\nAnimals 15 and 16 form a fighting pair and must not be approved together.\nAnimals 16 and 1 form a fighting pair and must not be approved together.\nAnimals 16 and 6 form a fighting pair and must not be approved together.\nAnimals 16 and 10 form a fighting pair and must not be approved together.\nAnimals 16 and 13 form a fighting pair and must not be approved together.\nAnimals 18 and 1 form a fighting pair and must not be approved together.\nAnimals 18 and 6 form a fighting pair and must not be approved together.\nAnimals 9 and 2 form a fighting pair and must not be approved together.\nAnimals 9 and 5 form a fighting pair and must not be approved together.\nAnimals 9 and 10 form a fighting pair and must not be approved together.\nAnimals 10 and 13 form a fighting pair and must not be approved together.\nAnimals 2 and 12 form a fighting pair and must not be approved together.\nAnimals 2 and 17 form a fighting pair and must not be approved together.\nAnimals 11 and 4 form a fighting pair and must not be approved together.\nAnimals 11 and 5 form a fighting pair and must not be approved together.\nAnimals 11 and 12 form a fighting pair and must not be approved together.\nAnimals 1 and 17 form a fighting pair and must not be approved together.\nAnimals 12 and 5 form a fighting pair and must not be approved together.\nAnimals 12 and 17 form a fighting pair and must not be approved together.\nAnimals 6 and 3 form a fighting pair and must not be approved together.\nAnimals 6 and 7 form a fighting pair and must not be approved together.\nApprove as many of the 18 animals as possible while avoiding any of the 33 conflicts.\n\nAlso, when you hand back which animals get the green light, please use this simple JSON layout so it's easy to read and validate:\n\n{\n \"solution\": [\"animal_id\", \"animal_id\", ...]\n}\n\nThink of \"solution\" as the list of animal IDs you're approving for the communal play area. Each entry in that array should be the exact identifier for an animal from the input (one per animal, no duplicates). This JSON is just a sketch of the expected shape — fill it with the actual IDs when you're ready.\n\nAll identifiers must be used exactly as they appear in the instance input — no renaming and no new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 33, "edges": [ { "u": 8, "v": 4 }, { "u": 8, "v": 5 }, { "u": 8, "v": 7 }, { "u": 8, "v": 11 }, { "u": 8, "v": 14 }, { "u": 14, "v": 6 }, { "u": 14, "v": 9 }, { "u": 14, "v": 16 }, { "u": 15, "v": 1 }, { "u": 15, "v": 2 }, { "u": 15, "v": 9 }, { "u": 15, "v": 10 }, { "u": 15, "v": 16 }, { "u": 16, "v": 1 }, { "u": 16, "v": 6 }, { "u": 16, "v": 10 }, { "u": 16, "v": 13 }, { "u": 18, "v": 1 }, { "u": 18, "v": 6 }, { "u": 9, "v": 2 }, { "u": 9, "v": 5 }, { "u": 9, "v": 10 }, { "u": 10, "v": 13 }, { "u": 2, "v": 12 }, { "u": 2, "v": 17 }, { "u": 11, "v": 4 }, { "u": 11, "v": 5 }, { "u": 11, "v": 12 }, { "u": 1, "v": 17 }, { "u": 12, "v": 5 }, { "u": 12, "v": 17 }, { "u": 6, "v": 3 }, { "u": 6, "v": 7 } ], "source_file": "wi2010.mtx", "density": 0.21568627450980393, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0028.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0028.png", "edge_connectivity": 1 }, "solution": [ 3, 4, 5, 7, 13, 14, 15, 17, 18 ], "obj": 9.0, "instance_variant": { "num_nodes": 18, "num_edges": 33, "edges": [ { "u": 8, "v": 4 }, { "u": 8, "v": 5 }, { "u": 8, "v": 7 }, { "u": 8, "v": 11 }, { "u": 8, "v": 14 }, { "u": 14, "v": 6 }, { "u": 14, "v": 9 }, { "u": 14, "v": 16 }, { "u": 15, "v": 1 }, { "u": 15, "v": 2 }, { "u": 15, "v": 9 }, { "u": 15, "v": 10 }, { "u": 15, "v": 16 }, { "u": 16, "v": 1 }, { "u": 16, "v": 6 }, { "u": 16, "v": 10 }, { "u": 16, "v": 13 }, { "u": 18, "v": 1 }, { "u": 18, "v": 6 }, { "u": 9, "v": 2 }, { "u": 9, "v": 5 }, { "u": 9, "v": 10 }, { "u": 10, "v": 13 }, { "u": 2, "v": 12 }, { "u": 2, "v": 17 }, { "u": 11, "v": 4 }, { "u": 11, "v": 5 }, { "u": 11, "v": 12 }, { "u": 1, "v": 17 }, { "u": 12, "v": 5 }, { "u": 12, "v": 17 }, { "u": 6, "v": 3 }, { "u": 6, "v": 7 } ] }, "solution_variant": [ 3, 4, 5, 7, 13, 14, 15, 17, 18 ], "context_index": 29, "input_format": "nl", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a corner plot everyone loves, and the plan is to plant the most diverse collection of shrubs without sitting together any pair that emit chemicals that hurt each other. The choice is about which shrubs to include so no two conflicting types end up planted side by side. The way to tell if a plan is better is straightforward: count how many different shrubs are in the bed — the higher the count, the better the plan. Each variety can only be used once and every selected plant must actually be in the bed. The concrete details are shown below.\n\n# total_shrub_varieties=17\n# total_conflicting_pairs=30\nshrub_a_id,shrub_b_id\nI,J\nI,P\nF,C\nF,E\nF,H\nF,L\nC,K\nC,L\nC,M\nC,N\nL,H\nL,K\nM,B\nM,D\nM,H\nM,K\nM,N\nG,J\nG,N\nD,N\nH,B\nH,K\nE,A\nE,N\nN,J\nN,P\nA,J\nA,Q\nJ,O\nO,Q\n\nWhen you send the planting plan back, just stick to a tiny JSON snippet like this so I can read it easily:\n\n{\n \"solution\": [\"shrub_id\", \"shrub_id\", ...]\n}\n\nHere, \"solution\" is the list of shrubs you want in the bed — each entry is just the ID for a shrub. Think of it like filling out a short form: one ID per chosen shrub. This JSON is just the expected shape (a sketch), not the actual answer.\n\nPlease use the exact identifiers from the instance input — don't rename them or invent new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 30, "edges": [ { "u": 9, "v": 10 }, { "u": 9, "v": 16 }, { "u": 6, "v": 3 }, { "u": 6, "v": 5 }, { "u": 6, "v": 8 }, { "u": 6, "v": 12 }, { "u": 3, "v": 11 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 3, "v": 14 }, { "u": 12, "v": 8 }, { "u": 12, "v": 11 }, { "u": 13, "v": 2 }, { "u": 13, "v": 4 }, { "u": 13, "v": 8 }, { "u": 13, "v": 11 }, { "u": 13, "v": 14 }, { "u": 7, "v": 10 }, { "u": 7, "v": 14 }, { "u": 4, "v": 14 }, { "u": 8, "v": 2 }, { "u": 8, "v": 11 }, { "u": 5, "v": 1 }, { "u": 5, "v": 14 }, { "u": 14, "v": 10 }, { "u": 14, "v": 16 }, { "u": 1, "v": 10 }, { "u": 1, "v": 17 }, { "u": 10, "v": 15 }, { "u": 15, "v": 17 } ], "source_file": "vt2010.mtx", "density": 0.22058823529411764, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0029.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0029.png", "edge_connectivity": 2 }, "solution": [ 1, 2, 4, 6, 7, 11, 15, 16 ], "obj": 8.0, "instance_variant": { "num_nodes": 17, "num_edges": 30, "edges": [ { "u": "I", "v": "J" }, { "u": "I", "v": "P" }, { "u": "F", "v": "C" }, { "u": "F", "v": "E" }, { "u": "F", "v": "H" }, { "u": "F", "v": "L" }, { "u": "C", "v": "K" }, { "u": "C", "v": "L" }, { "u": "C", "v": "M" }, { "u": "C", "v": "N" }, { "u": "L", "v": "H" }, { "u": "L", "v": "K" }, { "u": "M", "v": "B" }, { "u": "M", "v": "D" }, { "u": "M", "v": "H" }, { "u": "M", "v": "K" }, { "u": "M", "v": "N" }, { "u": "G", "v": "J" }, { "u": "G", "v": "N" }, { "u": "D", "v": "N" }, { "u": "H", "v": "B" }, { "u": "H", "v": "K" }, { "u": "E", "v": "A" }, { "u": "E", "v": "N" }, { "u": "N", "v": "J" }, { "u": "N", "v": "P" }, { "u": "A", "v": "J" }, { "u": "A", "v": "Q" }, { "u": "J", "v": "O" }, { "u": "O", "v": "Q" } ] }, "solution_variant": [ "A", "B", "D", "F", "G", "K", "O", "P" ], "context_index": 30, "input_format": "csv", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "We’ve got one showy mannequin and a pile of accessories to choose from, and the job is to pick the largest possible set that looks harmonious — no two items that clash should be included side by side. Success here is measured by the total number of accessories placed in the window: just tally up the selected pieces and try to make that number as high as possible. Every item is unique (can’t be used twice) and any pair that conflicts must not both be selected. The exact items and the clash notes are given below.\n\n{\n \"total_accessories\": 16,\n \"total_clashes\": 30,\n \"edges\": [\n {\n \"accessory_a\": \"H\",\n \"accessory_b\": \"C\"\n },\n {\n \"accessory_a\": \"H\",\n \"accessory_b\": \"D\"\n },\n {\n \"accessory_a\": \"H\",\n \"accessory_b\": \"I\"\n },\n {\n \"accessory_a\": \"H\",\n \"accessory_b\": \"K\"\n },\n {\n \"accessory_a\": \"H\",\n \"accessory_b\": \"L\"\n },\n {\n \"accessory_a\": \"H\",\n \"accessory_b\": \"O\"\n },\n {\n \"accessory_a\": \"A\",\n \"accessory_b\": \"C\"\n },\n {\n \"accessory_a\": \"A\",\n \"accessory_b\": \"E\"\n },\n {\n \"accessory_a\": \"A\",\n \"accessory_b\": \"I\"\n },\n {\n \"accessory_a\": \"A\",\n \"accessory_b\": \"N\"\n },\n {\n \"accessory_a\": \"L\",\n \"accessory_b\": \"D\"\n },\n {\n \"accessory_a\": \"L\",\n \"accessory_b\": \"I\"\n },\n {\n \"accessory_a\": \"L\",\n \"accessory_b\": \"O\"\n },\n {\n \"accessory_a\": \"P\",\n \"accessory_b\": \"E\"\n },\n {\n \"accessory_a\": \"P\",\n \"accessory_b\": \"N\"\n },\n {\n \"accessory_a\": \"N\",\n \"accessory_b\": \"E\"\n },\n {\n \"accessory_a\": \"N\",\n \"accessory_b\": \"G\"\n },\n {\n \"accessory_a\": \"E\",\n \"accessory_b\": \"F\"\n },\n {\n \"accessory_a\": \"E\",\n \"accessory_b\": \"I\"\n },\n {\n \"accessory_a\": \"E\",\n \"accessory_b\": \"J\"\n },\n {\n \"accessory_a\": \"E\",\n \"accessory_b\": \"M\"\n },\n {\n \"accessory_a\": \"I\",\n \"accessory_b\": \"J\"\n },\n {\n \"accessory_a\": \"J\",\n \"accessory_b\": \"F\"\n },\n {\n \"accessory_a\": \"J\",\n \"accessory_b\": \"O\"\n },\n {\n \"accessory_a\": \"F\",\n \"accessory_b\": \"B\"\n },\n {\n \"accessory_a\": \"F\",\n \"accessory_b\": \"O\"\n },\n {\n \"accessory_a\": \"C\",\n \"accessory_b\": \"G\"\n },\n {\n \"accessory_a\": \"D\",\n \"accessory_b\": \"O\"\n },\n {\n \"accessory_a\": \"B\",\n \"accessory_b\": \"O\"\n },\n {\n \"accessory_a\": \"O\",\n \"accessory_b\": \"K\"\n }\n ]\n}\n\nOh, and when you send back the picks, please use this simple JSON layout so it's easy to check automatically:\n\n{\n \"solution\": [\"accessory_id\", \"accessory_id\", ...]\n}\n\nThe \"solution\" list should contain the identifiers of the accessories you want in the window — one entry per chosen piece. Think of it like filling out a short form: put each chosen item's ID in that array. This JSON is just a sketch of the shape I need, not the actual final selection.\n\nPlease be sure to use the exact identifiers from the instance input — don't rename them or invent new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 16, "num_edges": 30, "edges": [ { "u": 8, "v": 3 }, { "u": 8, "v": 4 }, { "u": 8, "v": 9 }, { "u": 8, "v": 11 }, { "u": 8, "v": 12 }, { "u": 8, "v": 15 }, { "u": 1, "v": 3 }, { "u": 1, "v": 5 }, { "u": 1, "v": 9 }, { "u": 1, "v": 14 }, { "u": 12, "v": 4 }, { "u": 12, "v": 9 }, { "u": 12, "v": 15 }, { "u": 16, "v": 5 }, { "u": 16, "v": 14 }, { "u": 14, "v": 5 }, { "u": 14, "v": 7 }, { "u": 5, "v": 6 }, { "u": 5, "v": 9 }, { "u": 5, "v": 10 }, { "u": 5, "v": 13 }, { "u": 9, "v": 10 }, { "u": 10, "v": 6 }, { "u": 10, "v": 15 }, { "u": 6, "v": 2 }, { "u": 6, "v": 15 }, { "u": 3, "v": 7 }, { "u": 4, "v": 15 }, { "u": 2, "v": 15 }, { "u": 15, "v": 11 } ], "source_file": "wa2010.mtx", "density": 0.25, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0030.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0030.png", "edge_connectivity": 1 }, "solution": [ 1, 2, 4, 7, 10, 11, 13, 16 ], "obj": 8.0, "instance_variant": { "num_nodes": 16, "num_edges": 30, "edges": [ { "u": "H", "v": "C" }, { "u": "H", "v": "D" }, { "u": "H", "v": "I" }, { "u": "H", "v": "K" }, { "u": "H", "v": "L" }, { "u": "H", "v": "O" }, { "u": "A", "v": "C" }, { "u": "A", "v": "E" }, { "u": "A", "v": "I" }, { "u": "A", "v": "N" }, { "u": "L", "v": "D" }, { "u": "L", "v": "I" }, { "u": "L", "v": "O" }, { "u": "P", "v": "E" }, { "u": "P", "v": "N" }, { "u": "N", "v": "E" }, { "u": "N", "v": "G" }, { "u": "E", "v": "F" }, { "u": "E", "v": "I" }, { "u": "E", "v": "J" }, { "u": "E", "v": "M" }, { "u": "I", "v": "J" }, { "u": "J", "v": "F" }, { "u": "J", "v": "O" }, { "u": "F", "v": "B" }, { "u": "F", "v": "O" }, { "u": "C", "v": "G" }, { "u": "D", "v": "O" }, { "u": "B", "v": "O" }, { "u": "O", "v": "K" } ] }, "solution_variant": [ "A", "B", "D", "G", "J", "K", "M", "P" ], "context_index": 31, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the conference committee realized a simple rule would make panels smoother: try to include as many speakers as possible without seating together anyone who’s publicly argued. The “best” panel in this sense is the one that ends up with the most individual invitees — just count them — and it can’t contain any pair who have a public disagreement. Every person is either invited or not, and duplicates aren’t allowed. The detailed speaker roster and conflict info are shown below.\n\nThere are 14 distinct speakers on the roster and 28 unordered pairs of public disagreements.\nSpeakers 10 and 1 have a public disagreement and therefore cannot both be invited.\nSpeakers 10 and 12 have a public disagreement and therefore cannot both be invited.\nSpeakers 10 and 13 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 2 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 3 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 6 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 8 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 11 have a public disagreement and therefore cannot both be invited.\nSpeakers 4 and 12 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 1 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 2 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 5 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 6 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 8 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 12 and 13 have a public disagreement and therefore cannot both be invited.\nSpeakers 5 and 8 have a public disagreement and therefore cannot both be invited.\nSpeakers 5 and 13 have a public disagreement and therefore cannot both be invited.\nSpeakers 11 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 1 and 7 have a public disagreement and therefore cannot both be invited.\nSpeakers 1 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 2 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 13 and 7 have a public disagreement and therefore cannot both be invited.\nSpeakers 7 and 0 have a public disagreement and therefore cannot both be invited.\nSpeakers 7 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 0 and 9 have a public disagreement and therefore cannot both be invited.\nSpeakers 8 and 3 have a public disagreement and therefore cannot both be invited.\nForm the panel that maximizes the number of invitees without including any listed conflicting pair.\n\nOh, and when you send back the final invite list, a tiny JSON snippet like this is easiest to handle:\n\n{\n \"solution\": [\"speaker_id\", \"speaker_id\", ...]\n}\n\nThink of \"solution\" as the list of invited speaker IDs — just the IDs, nothing fancy. This JSON is just a sketch of the shape I expect, not the actual answer.\n\nPlease make sure to use the exact identifiers from the instance input — no renaming and no new labels. \nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 28, "edges": [ { "u": 11, "v": 2 }, { "u": 11, "v": 13 }, { "u": 11, "v": 14 }, { "u": 5, "v": 3 }, { "u": 5, "v": 4 }, { "u": 5, "v": 7 }, { "u": 5, "v": 9 }, { "u": 5, "v": 10 }, { "u": 5, "v": 12 }, { "u": 5, "v": 13 }, { "u": 13, "v": 2 }, { "u": 13, "v": 3 }, { "u": 13, "v": 6 }, { "u": 13, "v": 7 }, { "u": 13, "v": 9 }, { "u": 13, "v": 10 }, { "u": 13, "v": 14 }, { "u": 6, "v": 9 }, { "u": 6, "v": 14 }, { "u": 12, "v": 10 }, { "u": 2, "v": 8 }, { "u": 2, "v": 10 }, { "u": 3, "v": 10 }, { "u": 14, "v": 8 }, { "u": 8, "v": 1 }, { "u": 8, "v": 10 }, { "u": 1, "v": 10 }, { "u": 9, "v": 4 } ], "source_file": "wa2010.mtx", "density": 0.3076923076923077, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0031.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0031.png", "edge_connectivity": 2 }, "solution": [ 1, 2, 3, 4, 6, 7, 12 ], "obj": 7.0, "instance_variant": { "num_nodes": 14, "num_edges": 28, "edges": [ { "u": 10, "v": 1 }, { "u": 10, "v": 12 }, { "u": 10, "v": 13 }, { "u": 4, "v": 2 }, { "u": 4, "v": 3 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 9 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 12, "v": 1 }, { "u": 12, "v": 2 }, { "u": 12, "v": 5 }, { "u": 12, "v": 6 }, { "u": 12, "v": 8 }, { "u": 12, "v": 9 }, { "u": 12, "v": 13 }, { "u": 5, "v": 8 }, { "u": 5, "v": 13 }, { "u": 11, "v": 9 }, { "u": 1, "v": 7 }, { "u": 1, "v": 9 }, { "u": 2, "v": 9 }, { "u": 13, "v": 7 }, { "u": 7, "v": 0 }, { "u": 7, "v": 9 }, { "u": 0, "v": 9 }, { "u": 8, "v": 3 } ] }, "solution_variant": [ 0, 1, 2, 3, 5, 6, 11 ], "context_index": 32, "input_format": "nl", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a single festival slot to fill and a bunch of short films on the roster, except some titles conflict with each other because of licensing, so they can’t both be programmed. The decision is which combination of films to run so the block contains as many shorts as possible; the measure of success is just the count of films actually scheduled. No title can be duplicated, and any pair that has a licensing conflict has to be kept apart. The concrete details — who’s in the pool and which pairs conflict — appear below.\n\n# num_films=16\n# num_conflicts=37\nfilm_a_id,film_b_id\n0,1\n0,3\n0,5\n0,7\n0,8\n0,12\n4,1\n4,2\n4,7\n4,9\n4,10\n5,3\n5,6\n5,12\n5,14\n10,2\n10,7\n10,11\n10,13\n8,1\n8,7\n6,3\n6,14\n7,12\n7,15\n13,2\n13,11\n13,14\n9,1\n9,2\n11,12\n11,14\n11,15\n12,14\n12,15\n1,2\n1,3\n\nWhen you tell me which films made the cut, toss the answer back in this little JSON shape so it's easy to read programmatically:\n\n{\n \"solution\": [\"film_id\", \"film_id\", ...]\n}\n\nHere \"solution\" is just the list of films you're scheduling in the slot — each entry should be the exact film identifier from the input (order doesn't matter, it's just the chosen set). This block is only a sketch of the shape I want, not the actual selection.\n\nUse the identifiers exactly as they appear in the instance input — do not rename them or invent new labels.\nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 16, "num_edges": 37, "edges": [ { "u": 1, "v": 2 }, { "u": 1, "v": 4 }, { "u": 1, "v": 6 }, { "u": 1, "v": 8 }, { "u": 1, "v": 9 }, { "u": 1, "v": 13 }, { "u": 5, "v": 2 }, { "u": 5, "v": 3 }, { "u": 5, "v": 8 }, { "u": 5, "v": 10 }, { "u": 5, "v": 11 }, { "u": 6, "v": 4 }, { "u": 6, "v": 7 }, { "u": 6, "v": 13 }, { "u": 6, "v": 15 }, { "u": 11, "v": 3 }, { "u": 11, "v": 8 }, { "u": 11, "v": 12 }, { "u": 11, "v": 14 }, { "u": 9, "v": 2 }, { "u": 9, "v": 8 }, { "u": 7, "v": 4 }, { "u": 7, "v": 15 }, { "u": 8, "v": 13 }, { "u": 8, "v": 16 }, { "u": 14, "v": 3 }, { "u": 14, "v": 12 }, { "u": 14, "v": 15 }, { "u": 10, "v": 2 }, { "u": 10, "v": 3 }, { "u": 12, "v": 13 }, { "u": 12, "v": 15 }, { "u": 12, "v": 16 }, { "u": 13, "v": 15 }, { "u": 13, "v": 16 }, { "u": 2, "v": 3 }, { "u": 2, "v": 4 } ], "source_file": "wv2010.mtx", "density": 0.30833333333333335, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0032.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0032.png", "edge_connectivity": 3 }, "solution": [ 4, 9, 10, 11, 15, 16 ], "obj": 6.0, "instance_variant": { "num_nodes": 16, "num_edges": 37, "edges": [ { "u": 0, "v": 1 }, { "u": 0, "v": 3 }, { "u": 0, "v": 5 }, { "u": 0, "v": 7 }, { "u": 0, "v": 8 }, { "u": 0, "v": 12 }, { "u": 4, "v": 1 }, { "u": 4, "v": 2 }, { "u": 4, "v": 7 }, { "u": 4, "v": 9 }, { "u": 4, "v": 10 }, { "u": 5, "v": 3 }, { "u": 5, "v": 6 }, { "u": 5, "v": 12 }, { "u": 5, "v": 14 }, { "u": 10, "v": 2 }, { "u": 10, "v": 7 }, { "u": 10, "v": 11 }, { "u": 10, "v": 13 }, { "u": 8, "v": 1 }, { "u": 8, "v": 7 }, { "u": 6, "v": 3 }, { "u": 6, "v": 14 }, { "u": 7, "v": 12 }, { "u": 7, "v": 15 }, { "u": 13, "v": 2 }, { "u": 13, "v": 11 }, { "u": 13, "v": 14 }, { "u": 9, "v": 1 }, { "u": 9, "v": 2 }, { "u": 11, "v": 12 }, { "u": 11, "v": 14 }, { "u": 11, "v": 15 }, { "u": 12, "v": 14 }, { "u": 12, "v": 15 }, { "u": 1, "v": 2 }, { "u": 1, "v": 3 } ] }, "solution_variant": [ 3, 8, 9, 10, 14, 15 ], "context_index": 33, "input_format": "csv", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "We were sorting out patrol shifts at the block meeting and the job fell to me: pick the largest crew of partners for evening rounds while making sure no two people who’ve said they won’t work together end up on the same team. The decision is which combination of folks gives the highest headcount; you judge that by counting team members, and the winning plan is the one with the most people. The must-follow rule is that any pair that refuses to collaborate can’t both be chosen, and nobody is duplicated. The specific names and who can’t pair with whom are listed below.\n\nI'm looking at 17 people and 34 refusing pairs.\n16 and 0 refuse to work together, so I can't pick them both.\n16 and 9 refuse to work together, so I can't pick them both.\n2 and 12 refuse to work together, so I can't pick them both.\n2 and 13 refuse to work together, so I can't pick them both.\n2 and 15 refuse to work together, so I can't pick them both.\n9 and 0 refuse to work together, so I can't pick them both.\n9 and 3 refuse to work together, so I can't pick them both.\n9 and 4 refuse to work together, so I can't pick them both.\n9 and 5 refuse to work together, so I can't pick them both.\n10 and 1 refuse to work together, so I can't pick them both.\n10 and 6 refuse to work together, so I can't pick them both.\n10 and 8 refuse to work together, so I can't pick them both.\n10 and 14 refuse to work together, so I can't pick them both.\n5 and 4 refuse to work together, so I can't pick them both.\n6 and 7 refuse to work together, so I can't pick them both.\n6 and 8 refuse to work together, so I can't pick them both.\n6 and 14 refuse to work together, so I can't pick them both.\n3 and 4 refuse to work together, so I can't pick them both.\n3 and 12 refuse to work together, so I can't pick them both.\n3 and 14 refuse to work together, so I can't pick them both.\n3 and 15 refuse to work together, so I can't pick them both.\n7 and 8 refuse to work together, so I can't pick them both.\n7 and 14 refuse to work together, so I can't pick them both.\n7 and 15 refuse to work together, so I can't pick them both.\n8 and 1 refuse to work together, so I can't pick them both.\n8 and 11 refuse to work together, so I can't pick them both.\n4 and 0 refuse to work together, so I can't pick them both.\n4 and 13 refuse to work together, so I can't pick them both.\n1 and 0 refuse to work together, so I can't pick them both.\n15 and 11 refuse to work together, so I can't pick them both.\n11 and 0 refuse to work together, so I can't pick them both.\n11 and 13 refuse to work together, so I can't pick them both.\n12 and 13 refuse to work together, so I can't pick them both.\n0 and 13 refuse to work together, so I can't pick them both.\nI'll choose the largest crew that never includes both members of any listed refusing pair.\n\nOh, and when you send back the final pick, could you put it in this simple JSON shape so it’s easy to read by my script?\n\n{\n \"solution\": [\"person_id\", \"person_id\", ...]\n}\n\nThis just means \"solution\" should be an array listing the chosen people (use their IDs exactly as given). Think of it like a tiny form: the array holds the IDs of the folks you're assigning to the evening patrols.\n\nThis JSON is just a sketch of the expected shape — not the actual answer.\n\nPlease use the identifiers exactly as they appear in the instance input — don’t rename or invent any labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 17, "num_edges": 34, "edges": [ { "u": 17, "v": 1 }, { "u": 17, "v": 10 }, { "u": 3, "v": 13 }, { "u": 3, "v": 14 }, { "u": 3, "v": 16 }, { "u": 10, "v": 1 }, { "u": 10, "v": 4 }, { "u": 10, "v": 5 }, { "u": 10, "v": 6 }, { "u": 11, "v": 2 }, { "u": 11, "v": 7 }, { "u": 11, "v": 9 }, { "u": 11, "v": 15 }, { "u": 6, "v": 5 }, { "u": 7, "v": 8 }, { "u": 7, "v": 9 }, { "u": 7, "v": 15 }, { "u": 4, "v": 5 }, { "u": 4, "v": 13 }, { "u": 4, "v": 15 }, { "u": 4, "v": 16 }, { "u": 8, "v": 9 }, { "u": 8, "v": 15 }, { "u": 8, "v": 16 }, { "u": 9, "v": 2 }, { "u": 9, "v": 12 }, { "u": 5, "v": 1 }, { "u": 5, "v": 14 }, { "u": 2, "v": 1 }, { "u": 16, "v": 12 }, { "u": 12, "v": 1 }, { "u": 12, "v": 14 }, { "u": 13, "v": 14 }, { "u": 1, "v": 14 } ], "source_file": "wi2010.mtx", "density": 0.25, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0033.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0033.png", "edge_connectivity": 2 }, "solution": [ 2, 3, 4, 6, 7, 12, 17 ], "obj": 7.0, "instance_variant": { "num_nodes": 17, "num_edges": 34, "edges": [ { "u": 16, "v": 0 }, { "u": 16, "v": 9 }, { "u": 2, "v": 12 }, { "u": 2, "v": 13 }, { "u": 2, "v": 15 }, { "u": 9, "v": 0 }, { "u": 9, "v": 3 }, { "u": 9, "v": 4 }, { "u": 9, "v": 5 }, { "u": 10, "v": 1 }, { "u": 10, "v": 6 }, { "u": 10, "v": 8 }, { "u": 10, "v": 14 }, { "u": 5, "v": 4 }, { "u": 6, "v": 7 }, { "u": 6, "v": 8 }, { "u": 6, "v": 14 }, { "u": 3, "v": 4 }, { "u": 3, "v": 12 }, { "u": 3, "v": 14 }, { "u": 3, "v": 15 }, { "u": 7, "v": 8 }, { "u": 7, "v": 14 }, { "u": 7, "v": 15 }, { "u": 8, "v": 1 }, { "u": 8, "v": 11 }, { "u": 4, "v": 0 }, { "u": 4, "v": 13 }, { "u": 1, "v": 0 }, { "u": 15, "v": 11 }, { "u": 11, "v": 0 }, { "u": 11, "v": 13 }, { "u": 12, "v": 13 }, { "u": 0, "v": 13 } ] }, "solution_variant": [ 1, 2, 3, 5, 6, 11, 16 ], "context_index": 34, "input_format": "nl", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a themed chapter to fill, and the editor’s challenge is to pick a collection of recipes that’s as large as possible but doesn’t contain any duplicates or recipes that contradict one another. A better decision is the one that results in a bigger final list of unique, non-contradictory recipes — success can be checked by counting how many recipes are included. The concrete details appear below.\n\n# total_recipes_available=15\n# num_conflicting_pairs=28\nrecipe_a_id,recipe_b_id\n12,1\n12,9\n12,13\n2,1\n2,3\n2,5\n2,15\n7,1\n10,1\n10,14\n10,15\n8,1\n8,5\n8,14\n8,15\n11,1\n11,13\n3,1\n3,4\n3,15\n9,1\n1,4\n1,6\n1,13\n1,14\n4,15\n5,15\n14,15\n\nOh, and when you send back the chosen recipes, stick to a tiny JSON layout so it's easy for the editor to read. Something like this:\n\n{\n \"solution\": [\"recipe_id\", \"recipe_id\", ...]\n}\n\nHere \"solution\" is the list of recipe identifiers you're including in the chapter — just the IDs, nothing else. This JSON is just a sketch of the shape I expect, not the actual answer.\n\nPlease use the exact identifiers from the instance input — don't rename them or invent new labels. Valid identifiers look like plain numbers such as \"1\" or \"23\", single capital letters like \"A\" or \"B\", or a capital letter followed by digits like \"A1\" or \"X7\".", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 28, "edges": [ { "u": 12, "v": 1 }, { "u": 12, "v": 9 }, { "u": 12, "v": 13 }, { "u": 2, "v": 1 }, { "u": 2, "v": 3 }, { "u": 2, "v": 5 }, { "u": 2, "v": 15 }, { "u": 7, "v": 1 }, { "u": 10, "v": 1 }, { "u": 10, "v": 14 }, { "u": 10, "v": 15 }, { "u": 8, "v": 1 }, { "u": 8, "v": 5 }, { "u": 8, "v": 14 }, { "u": 8, "v": 15 }, { "u": 11, "v": 1 }, { "u": 11, "v": 13 }, { "u": 3, "v": 1 }, { "u": 3, "v": 4 }, { "u": 3, "v": 15 }, { "u": 9, "v": 1 }, { "u": 1, "v": 4 }, { "u": 1, "v": 6 }, { "u": 1, "v": 13 }, { "u": 1, "v": 14 }, { "u": 4, "v": 15 }, { "u": 5, "v": 15 }, { "u": 14, "v": 15 } ], "source_file": "vt2010.mtx", "density": 0.26666666666666666, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0034.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0034.png", "edge_connectivity": 1 }, "solution": [ 2, 4, 6, 7, 8, 9, 10, 11 ], "obj": 8.0, "instance_variant": { "num_nodes": 15, "num_edges": 28, "edges": [ { "u": 12, "v": 1 }, { "u": 12, "v": 9 }, { "u": 12, "v": 13 }, { "u": 2, "v": 1 }, { "u": 2, "v": 3 }, { "u": 2, "v": 5 }, { "u": 2, "v": 15 }, { "u": 7, "v": 1 }, { "u": 10, "v": 1 }, { "u": 10, "v": 14 }, { "u": 10, "v": 15 }, { "u": 8, "v": 1 }, { "u": 8, "v": 5 }, { "u": 8, "v": 14 }, { "u": 8, "v": 15 }, { "u": 11, "v": 1 }, { "u": 11, "v": 13 }, { "u": 3, "v": 1 }, { "u": 3, "v": 4 }, { "u": 3, "v": 15 }, { "u": 9, "v": 1 }, { "u": 1, "v": 4 }, { "u": 1, "v": 6 }, { "u": 1, "v": 13 }, { "u": 1, "v": 14 }, { "u": 4, "v": 15 }, { "u": 5, "v": 15 }, { "u": 14, "v": 15 } ] }, "solution_variant": [ 2, 4, 6, 7, 8, 9, 10, 11 ], "context_index": 35, "input_format": "csv", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "We were putting together the vendor lineup for a craft market and discovered a few pairs of sellers that just won’t tolerate each other at the same show. The task became choosing which vendors to invite into that single row so the row holds as many different booths as we can, while making sure no two incompatible vendors end up both accepted. To compare different choices, just count how many vendors are accepted in each; the choice with the highest count wins, and every vendor is considered once — no duplicates. The concrete vendor details and incompatibilities are shown below.\n\n# total_vendors=13\n# num_conflict_pairs=25\nvendor_a,vendor_b\nE,D\nE,F\nE,G\nE,L\nF,A\nF,B\nF,G\nK,A\nK,H\nD,B\nD,C\nD,G\nD,M\nA,H\nA,L\nA,M\nG,B\nB,C\nC,J\nH,I\nH,J\nH,M\nI,J\nJ,M\nL,M\n\nQuick note on the answer format — I’ll keep it simple: give me a JSON object with a single key \"solution\" whose value is a list of the vendor identifiers you’re accepting for the row.\n\n{\n \"solution\": [\"vendor_id\", \"vendor_id\", ...]\n}\n\nHere \"solution\" is just the list of accepted vendor IDs in the order you like. Treat this like filling in a form: put each chosen vendor's identifier as a string in that array. This JSON is only a sketch of the shape I need, not the actual final choices.\n\nPlease use the identifiers exactly as they appear in the instance input — don’t rename them or invent new labels. \nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 25, "edges": [ { "u": 5, "v": 4 }, { "u": 5, "v": 6 }, { "u": 5, "v": 7 }, { "u": 5, "v": 12 }, { "u": 6, "v": 1 }, { "u": 6, "v": 2 }, { "u": 6, "v": 7 }, { "u": 11, "v": 1 }, { "u": 11, "v": 8 }, { "u": 4, "v": 2 }, { "u": 4, "v": 3 }, { "u": 4, "v": 7 }, { "u": 4, "v": 13 }, { "u": 1, "v": 8 }, { "u": 1, "v": 12 }, { "u": 1, "v": 13 }, { "u": 7, "v": 2 }, { "u": 2, "v": 3 }, { "u": 3, "v": 10 }, { "u": 8, "v": 9 }, { "u": 8, "v": 10 }, { "u": 8, "v": 13 }, { "u": 9, "v": 10 }, { "u": 10, "v": 13 }, { "u": 12, "v": 13 } ], "source_file": "vt2010.mtx", "density": 0.32051282051282054, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0035.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0035.png", "edge_connectivity": 2 }, "solution": [ 3, 6, 9, 11, 13 ], "obj": 5.0, "instance_variant": { "num_nodes": 13, "num_edges": 25, "edges": [ { "u": "E", "v": "D" }, { "u": "E", "v": "F" }, { "u": "E", "v": "G" }, { "u": "E", "v": "L" }, { "u": "F", "v": "A" }, { "u": "F", "v": "B" }, { "u": "F", "v": "G" }, { "u": "K", "v": "A" }, { "u": "K", "v": "H" }, { "u": "D", "v": "B" }, { "u": "D", "v": "C" }, { "u": "D", "v": "G" }, { "u": "D", "v": "M" }, { "u": "A", "v": "H" }, { "u": "A", "v": "L" }, { "u": "A", "v": "M" }, { "u": "G", "v": "B" }, { "u": "B", "v": "C" }, { "u": "C", "v": "J" }, { "u": "H", "v": "I" }, { "u": "H", "v": "J" }, { "u": "H", "v": "M" }, { "u": "I", "v": "J" }, { "u": "J", "v": "M" }, { "u": "L", "v": "M" } ] }, "solution_variant": [ "C", "F", "I", "K", "M" ], "context_index": 36, "input_format": "csv", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m the tech lead juggling a stack of feature ideas for the next release, and the task is to pick a pack of features that work together — as many as possible, but never two that clash. The better plan is simply the one that ends up with more features chosen, so success is just counting how many items made the cut. Every picked feature has to come from the list and can only be chosen once, and no pair that’s known to conflict can be included together. The exact feature list and which features clash will be shown below.\n\n# total_feature_ideas=14\n# total_conflicting_pairs=24\nfeature_a_id,feature_b_id\n11,4\n11,8\n11,14\n9,5\n9,6\n9,8\n9,10\n9,14\n4,6\n4,8\n4,14\n8,10\n6,14\n1,2\n1,3\n1,14\n3,2\n3,12\n3,13\n5,14\n7,13\n7,14\n12,13\n12,14\n\nAlso, when you send back your final pick, just drop a tiny JSON snippet in the same shape as below so it's easy to parse:\n\n{\n \"solution\": [\"feature_id\", \"feature_id\", ...]\n}\n\nThis is just a sketch of the expected shape — \"solution\" is the list of features you want to include in the pack. Treat each string in the array as one chosen feature from the list shown in the instance; it's like ticking boxes on a simple form.\n\nImportant: use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 24, "edges": [ { "u": 11, "v": 4 }, { "u": 11, "v": 8 }, { "u": 11, "v": 14 }, { "u": 9, "v": 5 }, { "u": 9, "v": 6 }, { "u": 9, "v": 8 }, { "u": 9, "v": 10 }, { "u": 9, "v": 14 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 14 }, { "u": 8, "v": 10 }, { "u": 6, "v": 14 }, { "u": 1, "v": 2 }, { "u": 1, "v": 3 }, { "u": 1, "v": 14 }, { "u": 3, "v": 2 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 5, "v": 14 }, { "u": 7, "v": 13 }, { "u": 7, "v": 14 }, { "u": 12, "v": 13 }, { "u": 12, "v": 14 } ], "source_file": "wv2010.mtx", "density": 0.26373626373626374, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0036.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0036.png", "edge_connectivity": 2 }, "solution": [ 2, 5, 6, 7, 10, 11, 12 ], "obj": 7.0, "instance_variant": { "num_nodes": 14, "num_edges": 24, "edges": [ { "u": 11, "v": 4 }, { "u": 11, "v": 8 }, { "u": 11, "v": 14 }, { "u": 9, "v": 5 }, { "u": 9, "v": 6 }, { "u": 9, "v": 8 }, { "u": 9, "v": 10 }, { "u": 9, "v": 14 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 14 }, { "u": 8, "v": 10 }, { "u": 6, "v": 14 }, { "u": 1, "v": 2 }, { "u": 1, "v": 3 }, { "u": 1, "v": 14 }, { "u": 3, "v": 2 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 5, "v": 14 }, { "u": 7, "v": 13 }, { "u": 7, "v": 14 }, { "u": 12, "v": 13 }, { "u": 12, "v": 14 } ] }, "solution_variant": [ 2, 5, 6, 7, 10, 11, 12 ], "context_index": 37, "input_format": "csv", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone at the venue office is juggling a long list of bands and soloists and wants to assemble the largest possible show where no two performers have any known personal or contractual beef. The task is to decide who to invite; the winning decision is the one that produces the biggest roster. Success is determined by the number of distinct performers chosen (just add them up), but it’s important that no conflicting pair is included and that each musician appears only once. The specific names and relationships are shown below.\n\n# total_performers_count=18\n# total_conflict_pairs_count=35\nperformer_a,performer_b\nN,C\nN,G\nN,M\nB,G\nB,Q\nO,G\nO,H\nO,I\nO,P\nL,G\nL,I\nD,E\nD,H\nD,P\nK,C\nK,G\nK,Q\nJ,C\nJ,M\nM,C\nM,F\nM,H\nM,I\nA,F\nA,H\nH,F\nH,I\nE,G\nE,P\nE,R\nR,G\nI,G\nQ,C\nQ,G\nG,C\n\nOh, and when you're ready to give the answer, please use a tiny JSON snippet like this so it's easy to check:\n\n{\n \"solution\": [\"performer_id\", \"performer_id\", ...]\n}\n\nHere \"solution\" is just the list of performers you're inviting — each entry is the ID of one musician on the roster. Think of it like filling in a short form: put each performer’s exact ID in the array, and that’s your final pick. This is only a template showing the expected shape, not the actual lineup.\n\nAll identifiers must be used exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 18, "num_edges": 35, "edges": [ { "u": 14, "v": 3 }, { "u": 14, "v": 7 }, { "u": 14, "v": 13 }, { "u": 2, "v": 7 }, { "u": 2, "v": 17 }, { "u": 15, "v": 7 }, { "u": 15, "v": 8 }, { "u": 15, "v": 9 }, { "u": 15, "v": 16 }, { "u": 12, "v": 7 }, { "u": 12, "v": 9 }, { "u": 4, "v": 5 }, { "u": 4, "v": 8 }, { "u": 4, "v": 16 }, { "u": 11, "v": 3 }, { "u": 11, "v": 7 }, { "u": 11, "v": 17 }, { "u": 10, "v": 3 }, { "u": 10, "v": 13 }, { "u": 13, "v": 3 }, { "u": 13, "v": 6 }, { "u": 13, "v": 8 }, { "u": 13, "v": 9 }, { "u": 1, "v": 6 }, { "u": 1, "v": 8 }, { "u": 8, "v": 6 }, { "u": 8, "v": 9 }, { "u": 5, "v": 7 }, { "u": 5, "v": 16 }, { "u": 5, "v": 18 }, { "u": 18, "v": 7 }, { "u": 9, "v": 7 }, { "u": 17, "v": 3 }, { "u": 17, "v": 7 }, { "u": 7, "v": 3 } ], "source_file": "wa2010.mtx", "density": 0.22875816993464052, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0037.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0037.png", "edge_connectivity": 2 }, "solution": [ 1, 2, 4, 10, 11, 12, 14, 15, 18 ], "obj": 9.0, "instance_variant": { "num_nodes": 18, "num_edges": 35, "edges": [ { "u": "N", "v": "C" }, { "u": "N", "v": "G" }, { "u": "N", "v": "M" }, { "u": "B", "v": "G" }, { "u": "B", "v": "Q" }, { "u": "O", "v": "G" }, { "u": "O", "v": "H" }, { "u": "O", "v": "I" }, { "u": "O", "v": "P" }, { "u": "L", "v": "G" }, { "u": "L", "v": "I" }, { "u": "D", "v": "E" }, { "u": "D", "v": "H" }, { "u": "D", "v": "P" }, { "u": "K", "v": "C" }, { "u": "K", "v": "G" }, { "u": "K", "v": "Q" }, { "u": "J", "v": "C" }, { "u": "J", "v": "M" }, { "u": "M", "v": "C" }, { "u": "M", "v": "F" }, { "u": "M", "v": "H" }, { "u": "M", "v": "I" }, { "u": "A", "v": "F" }, { "u": "A", "v": "H" }, { "u": "H", "v": "F" }, { "u": "H", "v": "I" }, { "u": "E", "v": "G" }, { "u": "E", "v": "P" }, { "u": "E", "v": "R" }, { "u": "R", "v": "G" }, { "u": "I", "v": "G" }, { "u": "Q", "v": "C" }, { "u": "Q", "v": "G" }, { "u": "G", "v": "C" } ] }, "solution_variant": [ "A", "B", "D", "J", "K", "L", "N", "O", "R" ], "context_index": 38, "input_format": "csv", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently a homeowner decided to finally hang up a bunch of frames in the living room and wanted to get as many different pieces up as possible. The catch: if two pictures are known to clash in style, they can’t both be on the wall at the same time. The way to tell which arrangement is best is to count the number of distinct pictures hanging — the higher the number, the better — and make sure each hung item is one of the originals, not a repeat. The exact details about which pictures exist and which pairs conflict are shown below.\n\n# total_pictures_count=16\n# total_clashing_pairs_count=25\npicture_one_id,picture_two_id\n6,3\n6,5\n6,7\n6,9\n6,14\n5,3\n1,8\n1,16\n2,8\n2,9\n2,11\n2,16\n7,3\n7,4\n7,10\n9,10\n9,12\n9,14\n9,16\n10,4\n11,12\n12,13\n13,14\n13,15\n14,15\n\nOh, and to keep things tidy, please give the final arrangement in this little JSON shape:\n\n{\n \"solution\": [\"picture_id\", \"picture_id\", ...]\n}\n\nPretty simple: \"solution\" is the list of picture IDs you plan to hang (one entry per picture). Think of it as the form the answer should fill out — just the exact IDs listed in the input, nothing else. This JSON is only a sketch of the expected shape, not the actual answer.\n\nAlso, please make sure to use the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 16, "num_edges": 25, "edges": [ { "u": 6, "v": 3 }, { "u": 6, "v": 5 }, { "u": 6, "v": 7 }, { "u": 6, "v": 9 }, { "u": 6, "v": 14 }, { "u": 5, "v": 3 }, { "u": 1, "v": 8 }, { "u": 1, "v": 16 }, { "u": 2, "v": 8 }, { "u": 2, "v": 9 }, { "u": 2, "v": 11 }, { "u": 2, "v": 16 }, { "u": 7, "v": 3 }, { "u": 7, "v": 4 }, { "u": 7, "v": 10 }, { "u": 9, "v": 10 }, { "u": 9, "v": 12 }, { "u": 9, "v": 14 }, { "u": 9, "v": 16 }, { "u": 10, "v": 4 }, { "u": 11, "v": 12 }, { "u": 12, "v": 13 }, { "u": 13, "v": 14 }, { "u": 13, "v": 15 }, { "u": 14, "v": 15 } ], "source_file": "wi2010.mtx", "density": 0.20833333333333334, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0038.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0038.png", "edge_connectivity": 2 }, "solution": [ 1, 2, 4, 5, 12, 15 ], "obj": 6.0, "instance_variant": { "num_nodes": 16, "num_edges": 25, "edges": [ { "u": 6, "v": 3 }, { "u": 6, "v": 5 }, { "u": 6, "v": 7 }, { "u": 6, "v": 9 }, { "u": 6, "v": 14 }, { "u": 5, "v": 3 }, { "u": 1, "v": 8 }, { "u": 1, "v": 16 }, { "u": 2, "v": 8 }, { "u": 2, "v": 9 }, { "u": 2, "v": 11 }, { "u": 2, "v": 16 }, { "u": 7, "v": 3 }, { "u": 7, "v": 4 }, { "u": 7, "v": 10 }, { "u": 9, "v": 10 }, { "u": 9, "v": 12 }, { "u": 9, "v": 14 }, { "u": 9, "v": 16 }, { "u": 10, "v": 4 }, { "u": 11, "v": 12 }, { "u": 12, "v": 13 }, { "u": 13, "v": 14 }, { "u": 13, "v": 15 }, { "u": 14, "v": 15 } ] }, "solution_variant": [ 1, 2, 4, 5, 12, 15 ], "context_index": 39, "input_format": "csv", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the backyard was reorganized and the challenge became: fill the mixed bed with as many kinds of plants as possible, while making sure none of the selected species are known enemies in the soil or sunlight. The choice to make is a selection from the available species that gives the highest total number of different plants — simply count them to see which selection is better. Every item is either in or out (no repeats), and any two chosen species must be compatible. The exact species list and which pairs clash are shown below.\n\n{\n \"total_species_available\": 15,\n \"total_conflicting_pairs\": 28,\n \"edges\": [\n {\n \"species_a_id\": 2,\n \"species_b_id\": 5\n },\n {\n \"species_a_id\": 2,\n \"species_b_id\": 9\n },\n {\n \"species_a_id\": 3,\n \"species_b_id\": 1\n },\n {\n \"species_a_id\": 3,\n \"species_b_id\": 6\n },\n {\n \"species_a_id\": 3,\n \"species_b_id\": 7\n },\n {\n \"species_a_id\": 3,\n \"species_b_id\": 11\n },\n {\n \"species_a_id\": 3,\n \"species_b_id\": 12\n },\n {\n \"species_a_id\": 3,\n \"species_b_id\": 13\n },\n {\n \"species_a_id\": 5,\n \"species_b_id\": 8\n },\n {\n \"species_a_id\": 5,\n \"species_b_id\": 12\n },\n {\n \"species_a_id\": 5,\n \"species_b_id\": 13\n },\n {\n \"species_a_id\": 14,\n \"species_b_id\": 4\n },\n {\n \"species_a_id\": 14,\n \"species_b_id\": 6\n },\n {\n \"species_a_id\": 14,\n \"species_b_id\": 12\n },\n {\n \"species_a_id\": 4,\n \"species_b_id\": 6\n },\n {\n \"species_a_id\": 4,\n \"species_b_id\": 8\n },\n {\n \"species_a_id\": 4,\n \"species_b_id\": 12\n },\n {\n \"species_a_id\": 11,\n \"species_b_id\": 1\n },\n {\n \"species_a_id\": 11,\n \"species_b_id\": 13\n },\n {\n \"species_a_id\": 11,\n \"species_b_id\": 15\n },\n {\n \"species_a_id\": 9,\n \"species_b_id\": 13\n },\n {\n \"species_a_id\": 9,\n \"species_b_id\": 15\n },\n {\n \"species_a_id\": 12,\n \"species_b_id\": 10\n },\n {\n \"species_a_id\": 12,\n \"species_b_id\": 13\n },\n {\n \"species_a_id\": 15,\n \"species_b_id\": 1\n },\n {\n \"species_a_id\": 15,\n \"species_b_id\": 13\n },\n {\n \"species_a_id\": 6,\n \"species_b_id\": 7\n },\n {\n \"species_a_id\": 13,\n \"species_b_id\": 10\n }\n ]\n}\n\nIf you want to hand me the final pick, just use the tiny JSON sketch below so it's easy to read and parse — nothing fancy, just the shape I expect.\n\n{\n \"solution\": [\"plant_id\", \"plant_id\", ...]\n}\n\nHere that JSON means: put the selected species' IDs into the \"solution\" list — one entry per plant you'd like in the bed. Think of each \"plant_id\" as a placeholder for whatever label the instance uses for a species.\n\nThis is only a template showing the expected shape, not the actual answer — you'll replace those placeholders with the real IDs from the instance.\n\nPlease make sure to use the identifiers exactly as they appear in the input — do not rename them or invent new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 28, "edges": [ { "u": 2, "v": 5 }, { "u": 2, "v": 9 }, { "u": 3, "v": 1 }, { "u": 3, "v": 6 }, { "u": 3, "v": 7 }, { "u": 3, "v": 11 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 5, "v": 8 }, { "u": 5, "v": 12 }, { "u": 5, "v": 13 }, { "u": 14, "v": 4 }, { "u": 14, "v": 6 }, { "u": 14, "v": 12 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 12 }, { "u": 11, "v": 1 }, { "u": 11, "v": 13 }, { "u": 11, "v": 15 }, { "u": 9, "v": 13 }, { "u": 9, "v": 15 }, { "u": 12, "v": 10 }, { "u": 12, "v": 13 }, { "u": 15, "v": 1 }, { "u": 15, "v": 13 }, { "u": 6, "v": 7 }, { "u": 13, "v": 10 } ], "source_file": "wv2010.mtx", "density": 0.26666666666666666, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0039.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0039.png", "edge_connectivity": 2 }, "solution": [ 1, 7, 8, 9, 10, 14 ], "obj": 6.0, "instance_variant": { "num_nodes": 15, "num_edges": 28, "edges": [ { "u": 2, "v": 5 }, { "u": 2, "v": 9 }, { "u": 3, "v": 1 }, { "u": 3, "v": 6 }, { "u": 3, "v": 7 }, { "u": 3, "v": 11 }, { "u": 3, "v": 12 }, { "u": 3, "v": 13 }, { "u": 5, "v": 8 }, { "u": 5, "v": 12 }, { "u": 5, "v": 13 }, { "u": 14, "v": 4 }, { "u": 14, "v": 6 }, { "u": 14, "v": 12 }, { "u": 4, "v": 6 }, { "u": 4, "v": 8 }, { "u": 4, "v": 12 }, { "u": 11, "v": 1 }, { "u": 11, "v": 13 }, { "u": 11, "v": 15 }, { "u": 9, "v": 13 }, { "u": 9, "v": 15 }, { "u": 12, "v": 10 }, { "u": 12, "v": 13 }, { "u": 15, "v": 1 }, { "u": 15, "v": 13 }, { "u": 6, "v": 7 }, { "u": 13, "v": 10 } ] }, "solution_variant": [ 1, 7, 8, 9, 10, 14 ], "context_index": 40, "input_format": "json", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "I’m a curator juggling a pile of artifacts and a bulletin of ownership notes — the task is to pick one single exhibit from the collection that shows as many different pieces as possible. The trick is any two items that have provenance or ownership problems can’t be shown together, so the better choice is the set that includes the most non-conflicting items. That “best” set is just the one with the highest headcount, which you get by counting how many artifacts are chosen, and each artifact can only be included once or left out. The exact list of items and who conflicts with whom is shown below.\n\n{\n \"total_artifacts\": 15,\n \"conflict_pairs\": 28,\n \"edges\": [\n {\n \"artifact_a\": \"M\",\n \"artifact_b\": \"G\"\n },\n {\n \"artifact_a\": \"M\",\n \"artifact_b\": \"H\"\n },\n {\n \"artifact_a\": \"M\",\n \"artifact_b\": \"O\"\n },\n {\n \"artifact_a\": \"N\",\n \"artifact_b\": \"C\"\n },\n {\n \"artifact_a\": \"N\",\n \"artifact_b\": \"D\"\n },\n {\n \"artifact_a\": \"N\",\n \"artifact_b\": \"F\"\n },\n {\n \"artifact_a\": \"N\",\n \"artifact_b\": \"H\"\n },\n {\n \"artifact_a\": \"C\",\n \"artifact_b\": \"D\"\n },\n {\n \"artifact_a\": \"C\",\n \"artifact_b\": \"E\"\n },\n {\n \"artifact_a\": \"C\",\n \"artifact_b\": \"J\"\n },\n {\n \"artifact_a\": \"D\",\n \"artifact_b\": \"F\"\n },\n {\n \"artifact_a\": \"K\",\n \"artifact_b\": \"G\"\n },\n {\n \"artifact_a\": \"K\",\n \"artifact_b\": \"H\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"A\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"B\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"E\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"F\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"G\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"I\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"J\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"L\"\n },\n {\n \"artifact_a\": \"H\",\n \"artifact_b\": \"O\"\n },\n {\n \"artifact_a\": \"G\",\n \"artifact_b\": \"A\"\n },\n {\n \"artifact_a\": \"O\",\n \"artifact_b\": \"E\"\n },\n {\n \"artifact_a\": \"J\",\n \"artifact_b\": \"E\"\n },\n {\n \"artifact_a\": \"L\",\n \"artifact_b\": \"B\"\n },\n {\n \"artifact_a\": \"B\",\n \"artifact_b\": \"I\"\n },\n {\n \"artifact_a\": \"F\",\n \"artifact_b\": \"I\"\n }\n ]\n}\n\nI'll hand you the result in a tiny, predictable shape so it's easy to plug into whatever you're using next. Something like this will do:\n\n{\n \"solution\": [\"artifact_id\", \"artifact_id\", ...]\n}\n\nHere \"solution\" is just the list of artifacts I pick for the exhibition — each entry is an artifact identifier from the instance input. Think of it like filling out a form field called \"solution\" with the IDs of the pieces you want to show. This JSON is only a sketch of the expected shape, not the actual answer.\n\nPlease use the exact identifiers from the instance input — do not rename them or invent new labels. Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 28, "edges": [ { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 13, "v": 15 }, { "u": 14, "v": 3 }, { "u": 14, "v": 4 }, { "u": 14, "v": 6 }, { "u": 14, "v": 8 }, { "u": 3, "v": 4 }, { "u": 3, "v": 5 }, { "u": 3, "v": 10 }, { "u": 4, "v": 6 }, { "u": 11, "v": 7 }, { "u": 11, "v": 8 }, { "u": 8, "v": 1 }, { "u": 8, "v": 2 }, { "u": 8, "v": 5 }, { "u": 8, "v": 6 }, { "u": 8, "v": 7 }, { "u": 8, "v": 9 }, { "u": 8, "v": 10 }, { "u": 8, "v": 12 }, { "u": 8, "v": 15 }, { "u": 7, "v": 1 }, { "u": 15, "v": 5 }, { "u": 10, "v": 5 }, { "u": 12, "v": 2 }, { "u": 2, "v": 9 }, { "u": 6, "v": 9 } ], "source_file": "wa2010.mtx", "density": 0.26666666666666666, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0040.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0040.png", "edge_connectivity": 2 }, "solution": [ 1, 4, 9, 10, 11, 12, 13 ], "obj": 7.0, "instance_variant": { "num_nodes": 15, "num_edges": 28, "edges": [ { "u": "M", "v": "G" }, { "u": "M", "v": "H" }, { "u": "M", "v": "O" }, { "u": "N", "v": "C" }, { "u": "N", "v": "D" }, { "u": "N", "v": "F" }, { "u": "N", "v": "H" }, { "u": "C", "v": "D" }, { "u": "C", "v": "E" }, { "u": "C", "v": "J" }, { "u": "D", "v": "F" }, { "u": "K", "v": "G" }, { "u": "K", "v": "H" }, { "u": "H", "v": "A" }, { "u": "H", "v": "B" }, { "u": "H", "v": "E" }, { "u": "H", "v": "F" }, { "u": "H", "v": "G" }, { "u": "H", "v": "I" }, { "u": "H", "v": "J" }, { "u": "H", "v": "L" }, { "u": "H", "v": "O" }, { "u": "G", "v": "A" }, { "u": "O", "v": "E" }, { "u": "J", "v": "E" }, { "u": "L", "v": "B" }, { "u": "B", "v": "I" }, { "u": "F", "v": "I" } ] }, "solution_variant": [ "A", "D", "I", "J", "K", "L", "M" ], "context_index": 41, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Many libraries run into this: a curator wants a front table packed with titles, yet a few specific combinations are off-limits for display together. The curator must pick a set of distinct books, and the better selection is simply the one that results in the greatest number of books on the table while never placing any disallowed pair together. The concrete details will be shown below.\n\nThere are 14 distinct books available and 26 restricted pairs among them.\nBooks 8 and 5 form a restricted pair and must not be displayed together on the front table.\nBooks 8 and 9 form a restricted pair and must not be displayed together on the front table.\nBooks 8 and 11 form a restricted pair and must not be displayed together on the front table.\nBooks 8 and 14 form a restricted pair and must not be displayed together on the front table.\nBooks 4 and 6 form a restricted pair and must not be displayed together on the front table.\nBooks 4 and 10 form a restricted pair and must not be displayed together on the front table.\nBooks 12 and 5 form a restricted pair and must not be displayed together on the front table.\nBooks 12 and 6 form a restricted pair and must not be displayed together on the front table.\nBooks 12 and 7 form a restricted pair and must not be displayed together on the front table.\nBooks 12 and 13 form a restricted pair and must not be displayed together on the front table.\nBooks 12 and 14 form a restricted pair and must not be displayed together on the front table.\nBooks 5 and 7 form a restricted pair and must not be displayed together on the front table.\nBooks 5 and 9 form a restricted pair and must not be displayed together on the front table.\nBooks 5 and 14 form a restricted pair and must not be displayed together on the front table.\nBooks 9 and 2 form a restricted pair and must not be displayed together on the front table.\nBooks 9 and 11 form a restricted pair and must not be displayed together on the front table.\nBooks 13 and 6 form a restricted pair and must not be displayed together on the front table.\nBooks 13 and 10 form a restricted pair and must not be displayed together on the front table.\nBooks 11 and 2 form a restricted pair and must not be displayed together on the front table.\nBooks 11 and 6 form a restricted pair and must not be displayed together on the front table.\nBooks 11 and 14 form a restricted pair and must not be displayed together on the front table.\nBooks 3 and 6 form a restricted pair and must not be displayed together on the front table.\nBooks 10 and 1 form a restricted pair and must not be displayed together on the front table.\nBooks 10 and 7 form a restricted pair and must not be displayed together on the front table.\nBooks 2 and 6 form a restricted pair and must not be displayed together on the front table.\nBooks 6 and 14 form a restricted pair and must not be displayed together on the front table.\nThe curator's goal is to select the largest possible set of titles from the 14 without ever placing any restricted pair together.\n\nOh, and to keep things tidy, please send your pick in this simple JSON layout so it’s easy to read and process:\n\n{\n \"solution\": [\"book_id\", \"book_id\", ...]\n}\n\nThis just means \"solution\" is the list of books you’d put on the front table. Each entry in the array should be the identifier for a book from the instance (you're just filling in the labels). Think of it like a little form — this is the shape I expect, not the actual final answer.\n\nPlease use each identifier exactly as it appears in the instance input — don’t rename them or invent new labels. For example:\n- plain numbers such as \"1\" or \"23\"\n- single capital letters like \"A\" or \"B\"\n- a capital letter followed by digits like \"A1\" or \"X7\"", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 26, "edges": [ { "u": 8, "v": 5 }, { "u": 8, "v": 9 }, { "u": 8, "v": 11 }, { "u": 8, "v": 14 }, { "u": 4, "v": 6 }, { "u": 4, "v": 10 }, { "u": 12, "v": 5 }, { "u": 12, "v": 6 }, { "u": 12, "v": 7 }, { "u": 12, "v": 13 }, { "u": 12, "v": 14 }, { "u": 5, "v": 7 }, { "u": 5, "v": 9 }, { "u": 5, "v": 14 }, { "u": 9, "v": 2 }, { "u": 9, "v": 11 }, { "u": 13, "v": 6 }, { "u": 13, "v": 10 }, { "u": 11, "v": 2 }, { "u": 11, "v": 6 }, { "u": 11, "v": 14 }, { "u": 3, "v": 6 }, { "u": 10, "v": 1 }, { "u": 10, "v": 7 }, { "u": 2, "v": 6 }, { "u": 6, "v": 14 } ], "source_file": "wa2010.mtx", "density": 0.2857142857142857, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0041.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0041.png", "edge_connectivity": 1 }, "solution": [ 1, 2, 3, 4, 7, 8, 13 ], "obj": 7.0, "instance_variant": { "num_nodes": 14, "num_edges": 26, "edges": [ { "u": 8, "v": 5 }, { "u": 8, "v": 9 }, { "u": 8, "v": 11 }, { "u": 8, "v": 14 }, { "u": 4, "v": 6 }, { "u": 4, "v": 10 }, { "u": 12, "v": 5 }, { "u": 12, "v": 6 }, { "u": 12, "v": 7 }, { "u": 12, "v": 13 }, { "u": 12, "v": 14 }, { "u": 5, "v": 7 }, { "u": 5, "v": 9 }, { "u": 5, "v": 14 }, { "u": 9, "v": 2 }, { "u": 9, "v": 11 }, { "u": 13, "v": 6 }, { "u": 13, "v": 10 }, { "u": 11, "v": 2 }, { "u": 11, "v": 6 }, { "u": 11, "v": 14 }, { "u": 3, "v": 6 }, { "u": 10, "v": 1 }, { "u": 10, "v": 7 }, { "u": 2, "v": 6 }, { "u": 6, "v": 14 } ] }, "solution_variant": [ 1, 2, 3, 4, 7, 8, 13 ], "context_index": 42, "input_format": "nl", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Many people forget that plugins can clash, so the admin’s goal is to get as many helpful add-ons running as possible without turning on any two that are incompatible. The decision is about which set to pick so the number of enabled plugins is maximized — measure that by simply counting enabled, distinct plugins, and make sure no conflicting duo is included. The exact list of plugins and the conflict pairs are shown below.\n\nThere are 14 num plugins in total and 24 num conflicts.\n\n| plugin_a | plugin_b |\n|---|---|\n| B | A |\n| D | I |\n| D | J |\n| D | K |\n| D | L |\n| L | E |\n| L | H |\n| L | K |\n| L | M |\n| M | E |\n| M | F |\n| M | H |\n| N | A |\n| N | F |\n| N | G |\n| H | F |\n| H | G |\n| H | I |\n| H | J |\n| I | G |\n| I | J |\n| G | C |\n| E | K |\n| A | C |\n\nOh, and when you send the chosen set back, just toss it into a tiny JSON object like this — super simple:\n\n{\n \"solution\": [\"plugin_id\", \"plugin_id\", ...]\n}\n\nHere \"solution\" is just the list of plugins you want enabled, and each \"plugin_id\" is a placeholder for one of the actual plugin identifiers from the instance. Think of it like filling out a form: put each chosen plugin’s exact ID into that array. This block is only a sketch of the shape I expect, not the actual answer.\n\nPlease use the identifiers exactly as they appear in the instance input — don’t rename them or invent new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 14, "num_edges": 24, "edges": [ { "u": 2, "v": 1 }, { "u": 4, "v": 9 }, { "u": 4, "v": 10 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 12, "v": 5 }, { "u": 12, "v": 8 }, { "u": 12, "v": 11 }, { "u": 12, "v": 13 }, { "u": 13, "v": 5 }, { "u": 13, "v": 6 }, { "u": 13, "v": 8 }, { "u": 14, "v": 1 }, { "u": 14, "v": 6 }, { "u": 14, "v": 7 }, { "u": 8, "v": 6 }, { "u": 8, "v": 7 }, { "u": 8, "v": 9 }, { "u": 8, "v": 10 }, { "u": 9, "v": 7 }, { "u": 9, "v": 10 }, { "u": 7, "v": 3 }, { "u": 5, "v": 11 }, { "u": 1, "v": 3 } ], "source_file": "wy2010.mtx", "density": 0.26373626373626374, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0042.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0042.png", "edge_connectivity": 1 }, "solution": [ 2, 3, 4, 5, 8, 14 ], "obj": 6.0, "instance_variant": { "num_nodes": 14, "num_edges": 24, "edges": [ { "u": "B", "v": "A" }, { "u": "D", "v": "I" }, { "u": "D", "v": "J" }, { "u": "D", "v": "K" }, { "u": "D", "v": "L" }, { "u": "L", "v": "E" }, { "u": "L", "v": "H" }, { "u": "L", "v": "K" }, { "u": "L", "v": "M" }, { "u": "M", "v": "E" }, { "u": "M", "v": "F" }, { "u": "M", "v": "H" }, { "u": "N", "v": "A" }, { "u": "N", "v": "F" }, { "u": "N", "v": "G" }, { "u": "H", "v": "F" }, { "u": "H", "v": "G" }, { "u": "H", "v": "I" }, { "u": "H", "v": "J" }, { "u": "I", "v": "G" }, { "u": "I", "v": "J" }, { "u": "G", "v": "C" }, { "u": "E", "v": "K" }, { "u": "A", "v": "C" } ] }, "solution_variant": [ "B", "C", "D", "E", "H", "N" ], "context_index": 43, "input_format": "markdown_table", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "At the planning meeting the team wanted to pack the special issue with as many articles as it could hold while respecting that certain pairs were known to overlap and therefore shouldn’t both be included. The decision becomes selecting a collection of pieces that have no mutual overlap marks, and the way to compare collections is straightforward — count how many items are in each and prefer the one with the greatest count. No duplicate acceptances, and any pair flagged as overlapping cannot both appear. The concrete submission details and their overlaps are listed below.\n\nThere are 15 submissions in total and 26 overlap flags.\n\n| article_a_id | article_b_id |\n|---|---|\n| 14 | 3 |\n| 14 | 5 |\n| 14 | 7 |\n| 15 | 11 |\n| 3 | 13 |\n| 8 | 1 |\n| 8 | 4 |\n| 8 | 11 |\n| 4 | 2 |\n| 4 | 10 |\n| 4 | 11 |\n| 4 | 12 |\n| 4 | 13 |\n| 13 | 2 |\n| 13 | 5 |\n| 13 | 7 |\n| 13 | 12 |\n| 7 | 5 |\n| 7 | 11 |\n| 10 | 1 |\n| 10 | 9 |\n| 10 | 12 |\n| 9 | 6 |\n| 9 | 12 |\n| 11 | 2 |\n| 12 | 6 |\n\nOh, and one more thing — when you send back the chosen set, a simple JSON snippet like this is perfect:\n\n{\n \"solution\": [\"article_id\", \"article_id\", ...]\n}\n\nThink of \"solution\" as just the list of article IDs you want to include in the special issue — one entry per chosen piece. This is just a sketch of the expected shape, not the actual selection.\n\nPlease make sure to use the exact identifiers from the instance input — no renaming and no invented labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”\".", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 26, "edges": [ { "u": 14, "v": 3 }, { "u": 14, "v": 5 }, { "u": 14, "v": 7 }, { "u": 15, "v": 11 }, { "u": 3, "v": 13 }, { "u": 8, "v": 1 }, { "u": 8, "v": 4 }, { "u": 8, "v": 11 }, { "u": 4, "v": 2 }, { "u": 4, "v": 10 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 4, "v": 13 }, { "u": 13, "v": 2 }, { "u": 13, "v": 5 }, { "u": 13, "v": 7 }, { "u": 13, "v": 12 }, { "u": 7, "v": 5 }, { "u": 7, "v": 11 }, { "u": 10, "v": 1 }, { "u": 10, "v": 9 }, { "u": 10, "v": 12 }, { "u": 9, "v": 6 }, { "u": 9, "v": 12 }, { "u": 11, "v": 2 }, { "u": 12, "v": 6 } ], "source_file": "wv2010.mtx", "density": 0.24761904761904763, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0043.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0043.png", "edge_connectivity": 1 }, "solution": [ 2, 3, 6, 7, 8, 10, 15 ], "obj": 7.0, "instance_variant": { "num_nodes": 15, "num_edges": 26, "edges": [ { "u": 14, "v": 3 }, { "u": 14, "v": 5 }, { "u": 14, "v": 7 }, { "u": 15, "v": 11 }, { "u": 3, "v": 13 }, { "u": 8, "v": 1 }, { "u": 8, "v": 4 }, { "u": 8, "v": 11 }, { "u": 4, "v": 2 }, { "u": 4, "v": 10 }, { "u": 4, "v": 11 }, { "u": 4, "v": 12 }, { "u": 4, "v": 13 }, { "u": 13, "v": 2 }, { "u": 13, "v": 5 }, { "u": 13, "v": 7 }, { "u": 13, "v": 12 }, { "u": 7, "v": 5 }, { "u": 7, "v": 11 }, { "u": 10, "v": 1 }, { "u": 10, "v": 9 }, { "u": 10, "v": 12 }, { "u": 9, "v": 6 }, { "u": 9, "v": 12 }, { "u": 11, "v": 2 }, { "u": 12, "v": 6 } ] }, "solution_variant": [ 2, 3, 6, 7, 8, 10, 15 ], "context_index": 44, "input_format": "markdown_table", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone on the block is trying to deck their house with every cool string of lights they own, but they can’t run certain pairs at the same time because they interfere with each other. The decision is which combination of light sets to put up so the house looks fullest — measured by the total number of distinct sets used — while avoiding any incompatible pair. No set gets duplicated, and every set that’s chosen must be compatible with all the others; the aim is simply to maximize that count. The exact inventory and the incompatibility notes are shown below.\n\n# total_light_sets=13\n# total_incompatible_pairs=24\nlight_set_id_u,light_set_id_v\n10,7\n10,8\n10,9\n10,12\n11,3\n11,9\n11,13\n7,1\n7,4\n7,6\n7,12\n9,3\n9,4\n9,13\n4,3\n4,6\n2,1\n2,3\n2,5\n2,6\n13,3\n6,3\n5,3\n8,12\n\nIf you want to give the answer in a neat, machine-friendly way, just follow this simple JSON shape when you reply — nothing fancy, just a plain list of the light sets you picked:\n\n{\n \"solution\": [\"light_id\", \"light_id\", ...]\n}\n\n\"solution\" is the list of sets you'll hang up — each entry is the identifier for one of the light sets from the problem. Think of it like filling in a short form: list each chosen set's ID in that array. This block is just a sketch of the shape I expect, not the actual answer itself.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — do not rename them or invent new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 24, "edges": [ { "u": 10, "v": 7 }, { "u": 10, "v": 8 }, { "u": 10, "v": 9 }, { "u": 10, "v": 12 }, { "u": 11, "v": 3 }, { "u": 11, "v": 9 }, { "u": 11, "v": 13 }, { "u": 7, "v": 1 }, { "u": 7, "v": 4 }, { "u": 7, "v": 6 }, { "u": 7, "v": 12 }, { "u": 9, "v": 3 }, { "u": 9, "v": 4 }, { "u": 9, "v": 13 }, { "u": 4, "v": 3 }, { "u": 4, "v": 6 }, { "u": 2, "v": 1 }, { "u": 2, "v": 3 }, { "u": 2, "v": 5 }, { "u": 2, "v": 6 }, { "u": 13, "v": 3 }, { "u": 6, "v": 3 }, { "u": 5, "v": 3 }, { "u": 8, "v": 12 } ], "source_file": "wi2010.mtx", "density": 0.3076923076923077, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0044.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0044.png", "edge_connectivity": 2 }, "solution": [ 1, 4, 5, 8, 13 ], "obj": 5.0, "instance_variant": { "num_nodes": 13, "num_edges": 24, "edges": [ { "u": 10, "v": 7 }, { "u": 10, "v": 8 }, { "u": 10, "v": 9 }, { "u": 10, "v": 12 }, { "u": 11, "v": 3 }, { "u": 11, "v": 9 }, { "u": 11, "v": 13 }, { "u": 7, "v": 1 }, { "u": 7, "v": 4 }, { "u": 7, "v": 6 }, { "u": 7, "v": 12 }, { "u": 9, "v": 3 }, { "u": 9, "v": 4 }, { "u": 9, "v": 13 }, { "u": 4, "v": 3 }, { "u": 4, "v": 6 }, { "u": 2, "v": 1 }, { "u": 2, "v": 3 }, { "u": 2, "v": 5 }, { "u": 2, "v": 6 }, { "u": 13, "v": 3 }, { "u": 6, "v": 3 }, { "u": 5, "v": 3 }, { "u": 8, "v": 12 } ] }, "solution_variant": [ 1, 4, 5, 8, 13 ], "context_index": 45, "input_format": "csv", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "There’s a festival director juggling invitations: the goal is to invite the largest possible group of filmmakers while making sure no two of them are publicly at odds and would refuse to share the program. The difference between choices is just how many filmmakers end up on the final list — the better plan is the one with the highest count of distinct, non-conflicting guests. Each person on the list has to be a different filmmaker and can’t be paired with someone they’re feuding with, and the exact lineup options and dispute pairs are shown below.\n\nThe director is considering 13 filmmakers and 25 dispute pairs.\nFilmmaker 13 and filmmaker 4 are publicly at odds and cannot both be invited.\nFilmmaker 13 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 13 and filmmaker 6 are publicly at odds and cannot both be invited.\nFilmmaker 13 and filmmaker 12 are publicly at odds and cannot both be invited.\nFilmmaker 1 and filmmaker 2 are publicly at odds and cannot both be invited.\nFilmmaker 1 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 1 and filmmaker 11 are publicly at odds and cannot both be invited.\nFilmmaker 2 and filmmaker 7 are publicly at odds and cannot both be invited.\nFilmmaker 2 and filmmaker 12 are publicly at odds and cannot both be invited.\nFilmmaker 3 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 11 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 11 and filmmaker 9 are publicly at odds and cannot both be invited.\nFilmmaker 11 and filmmaker 12 are publicly at odds and cannot both be invited.\nFilmmaker 12 and filmmaker 4 are publicly at odds and cannot both be invited.\nFilmmaker 12 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 12 and filmmaker 7 are publicly at odds and cannot both be invited.\nFilmmaker 12 and filmmaker 9 are publicly at odds and cannot both be invited.\nFilmmaker 12 and filmmaker 10 are publicly at odds and cannot both be invited.\nFilmmaker 8 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 8 and filmmaker 6 are publicly at odds and cannot both be invited.\nFilmmaker 10 and filmmaker 4 are publicly at odds and cannot both be invited.\nFilmmaker 10 and filmmaker 7 are publicly at odds and cannot both be invited.\nFilmmaker 9 and filmmaker 5 are publicly at odds and cannot both be invited.\nFilmmaker 5 and filmmaker 6 are publicly at odds and cannot both be invited.\nFilmmaker 6 and filmmaker 4 are publicly at odds and cannot both be invited.\nThe aim is to pick the largest possible conflict-free roster from these 13 filmmakers.\n\nIf you want to hand me the final guest list, just drop it in a tiny JSON snippet like this — real simple:\n\n{\n \"solution\": [\"filmmaker_id\", \"filmmaker_id\", ...]\n}\n\nHere, \"solution\" is the list of chosen filmmakers (one entry per invited person). Think of each string in the array as the exact ID from the instance — like filling out a short form with the names or codes you were given. This JSON is just a sketch of the shape I expect, not the actual answer.\n\nPlease make sure to use the identifiers exactly as they appear in the instance input — don't rename them or invent new labels. \nValid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 25, "edges": [ { "u": 13, "v": 4 }, { "u": 13, "v": 5 }, { "u": 13, "v": 6 }, { "u": 13, "v": 12 }, { "u": 1, "v": 2 }, { "u": 1, "v": 5 }, { "u": 1, "v": 11 }, { "u": 2, "v": 7 }, { "u": 2, "v": 12 }, { "u": 3, "v": 5 }, { "u": 11, "v": 5 }, { "u": 11, "v": 9 }, { "u": 11, "v": 12 }, { "u": 12, "v": 4 }, { "u": 12, "v": 5 }, { "u": 12, "v": 7 }, { "u": 12, "v": 9 }, { "u": 12, "v": 10 }, { "u": 8, "v": 5 }, { "u": 8, "v": 6 }, { "u": 10, "v": 4 }, { "u": 10, "v": 7 }, { "u": 9, "v": 5 }, { "u": 5, "v": 6 }, { "u": 6, "v": 4 } ], "source_file": "wy2010.mtx", "density": 0.32051282051282054, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0045.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0045.png", "edge_connectivity": 1 }, "solution": [ 1, 3, 8, 9, 10, 13 ], "obj": 6.0, "instance_variant": { "num_nodes": 13, "num_edges": 25, "edges": [ { "u": 13, "v": 4 }, { "u": 13, "v": 5 }, { "u": 13, "v": 6 }, { "u": 13, "v": 12 }, { "u": 1, "v": 2 }, { "u": 1, "v": 5 }, { "u": 1, "v": 11 }, { "u": 2, "v": 7 }, { "u": 2, "v": 12 }, { "u": 3, "v": 5 }, { "u": 11, "v": 5 }, { "u": 11, "v": 9 }, { "u": 11, "v": 12 }, { "u": 12, "v": 4 }, { "u": 12, "v": 5 }, { "u": 12, "v": 7 }, { "u": 12, "v": 9 }, { "u": 12, "v": 10 }, { "u": 8, "v": 5 }, { "u": 8, "v": 6 }, { "u": 10, "v": 4 }, { "u": 10, "v": 7 }, { "u": 9, "v": 5 }, { "u": 5, "v": 6 }, { "u": 6, "v": 4 } ] }, "solution_variant": [ 1, 3, 8, 9, 10, 13 ], "context_index": 46, "input_format": "nl", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "A neighborhood group is trying to form a volunteer team for a fundraiser, trying to cram in as many helpers as they can without putting any two people together who have past disagreements. The decision is picking the final lineup; the superior lineup is the one with more people, determined by counting how many volunteers are on it. Each person may appear only once on the roster and no conflicting pair may both be included; the specific roster choices and conflict notes are detailed below.\n\nThere are 16 volunteers and 30 conflict pairs listed below:\nVolunteer 9 conflicts with volunteer 0; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 1; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 2; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 4; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 6; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 7; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 8; both cannot be on the roster together.\nVolunteer 9 conflicts with volunteer 11; both cannot be on the roster together.\nVolunteer 2 conflicts with volunteer 0; both cannot be on the roster together.\nVolunteer 2 conflicts with volunteer 1; both cannot be on the roster together.\nVolunteer 2 conflicts with volunteer 8; both cannot be on the roster together.\nVolunteer 8 conflicts with volunteer 1; both cannot be on the roster together.\nVolunteer 5 conflicts with volunteer 3; both cannot be on the roster together.\nVolunteer 5 conflicts with volunteer 6; both cannot be on the roster together.\nVolunteer 1 conflicts with volunteer 0; both cannot be on the roster together.\nVolunteer 1 conflicts with volunteer 3; both cannot be on the roster together.\nVolunteer 1 conflicts with volunteer 4; both cannot be on the roster together.\nVolunteer 1 conflicts with volunteer 7; both cannot be on the roster together.\nVolunteer 1 conflicts with volunteer 12; both cannot be on the roster together.\nVolunteer 15 conflicts with volunteer 4; both cannot be on the roster together.\nVolunteer 15 conflicts with volunteer 11; both cannot be on the roster together.\nVolunteer 15 conflicts with volunteer 12; both cannot be on the roster together.\nVolunteer 15 conflicts with volunteer 14; both cannot be on the roster together.\nVolunteer 0 conflicts with volunteer 7; both cannot be on the roster together.\nVolunteer 10 conflicts with volunteer 6; both cannot be on the roster together.\nVolunteer 10 conflicts with volunteer 11; both cannot be on the roster together.\nVolunteer 10 conflicts with volunteer 13; both cannot be on the roster together.\nVolunteer 12 conflicts with volunteer 14; both cannot be on the roster together.\nVolunteer 14 conflicts with volunteer 13; both cannot be on the roster together.\nVolunteer 13 conflicts with volunteer 11; both cannot be on the roster together.\nAim for the largest possible roster that avoids including any of these listed conflict pairs.\n\nAlso, when you send the final lineup back, please use this simple JSON shape so it's easy to read automatically:\n\n{\n \"solution\": [\"volunteer_id\", \"volunteer_id\", ...]\n}\n\nThink of \"solution\" as the roster: a list of volunteer IDs (one per chosen person). The example values are just placeholders showing the shape of the reply — they aren't the actual picks.\n\nAll identifiers must be used exactly as they appear in the instance input — no renaming and no new labels. For example: Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.", "instance": { "problem_type": "MIS", "num_nodes": 16, "num_edges": 30, "edges": [ { "u": 10, "v": 1 }, { "u": 10, "v": 2 }, { "u": 10, "v": 3 }, { "u": 10, "v": 5 }, { "u": 10, "v": 7 }, { "u": 10, "v": 8 }, { "u": 10, "v": 9 }, { "u": 10, "v": 12 }, { "u": 3, "v": 1 }, { "u": 3, "v": 2 }, { "u": 3, "v": 9 }, { "u": 9, "v": 2 }, { "u": 6, "v": 4 }, { "u": 6, "v": 7 }, { "u": 2, "v": 1 }, { "u": 2, "v": 4 }, { "u": 2, "v": 5 }, { "u": 2, "v": 8 }, { "u": 2, "v": 13 }, { "u": 16, "v": 5 }, { "u": 16, "v": 12 }, { "u": 16, "v": 13 }, { "u": 16, "v": 15 }, { "u": 1, "v": 8 }, { "u": 11, "v": 7 }, { "u": 11, "v": 12 }, { "u": 11, "v": 14 }, { "u": 13, "v": 15 }, { "u": 15, "v": 14 }, { "u": 14, "v": 12 } ], "source_file": "vt2010.mtx", "density": 0.25, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0046.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0046.png", "edge_connectivity": 2 }, "solution": [ 4, 5, 7, 8, 9, 13, 14 ], "obj": 7.0, "instance_variant": { "num_nodes": 16, "num_edges": 30, "edges": [ { "u": 9, "v": 0 }, { "u": 9, "v": 1 }, { "u": 9, "v": 2 }, { "u": 9, "v": 4 }, { "u": 9, "v": 6 }, { "u": 9, "v": 7 }, { "u": 9, "v": 8 }, { "u": 9, "v": 11 }, { "u": 2, "v": 0 }, { "u": 2, "v": 1 }, { "u": 2, "v": 8 }, { "u": 8, "v": 1 }, { "u": 5, "v": 3 }, { "u": 5, "v": 6 }, { "u": 1, "v": 0 }, { "u": 1, "v": 3 }, { "u": 1, "v": 4 }, { "u": 1, "v": 7 }, { "u": 1, "v": 12 }, { "u": 15, "v": 4 }, { "u": 15, "v": 11 }, { "u": 15, "v": 12 }, { "u": 15, "v": 14 }, { "u": 0, "v": 7 }, { "u": 10, "v": 6 }, { "u": 10, "v": 11 }, { "u": 10, "v": 13 }, { "u": 12, "v": 14 }, { "u": 14, "v": 13 }, { "u": 13, "v": 11 } ] }, "solution_variant": [ 3, 4, 6, 7, 8, 12, 13 ], "context_index": 47, "input_format": "nl", "input_index_base": 0 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Out in the market, an angel has a shortlist and wants to back the biggest possible group of startups, but some pairs of startups have exclusivity pacts so it’s off-limits to fund both at once. What counts as a better decision is obvious — it’s the one that funds more different startups; to compare plans, simply count how many distinct companies are included. The practical rules are: picks come only from the shortlist, each startup appears only once in the picks, and no two picked startups can be in an exclusivity relationship. The detailed shortlist and the exclusivity pairings follow below.\n\n{\n \"total_shortlist_startups\": 13,\n \"num_exclusivity_agreements\": 24,\n \"edges\": [\n {\n \"startup_id_one\": \"I\",\n \"startup_id_two\": \"B\"\n },\n {\n \"startup_id_one\": \"I\",\n \"startup_id_two\": \"C\"\n },\n {\n \"startup_id_one\": \"I\",\n \"startup_id_two\": \"E\"\n },\n {\n \"startup_id_one\": \"I\",\n \"startup_id_two\": \"G\"\n },\n {\n \"startup_id_one\": \"I\",\n \"startup_id_two\": \"K\"\n },\n {\n \"startup_id_one\": \"M\",\n \"startup_id_two\": \"B\"\n },\n {\n \"startup_id_one\": \"M\",\n \"startup_id_two\": \"C\"\n },\n {\n \"startup_id_one\": \"M\",\n \"startup_id_two\": \"G\"\n },\n {\n \"startup_id_one\": \"M\",\n \"startup_id_two\": \"H\"\n },\n {\n \"startup_id_one\": \"M\",\n \"startup_id_two\": \"J\"\n },\n {\n \"startup_id_one\": \"L\",\n \"startup_id_two\": \"A\"\n },\n {\n \"startup_id_one\": \"L\",\n \"startup_id_two\": \"B\"\n },\n {\n \"startup_id_one\": \"L\",\n \"startup_id_two\": \"F\"\n },\n {\n \"startup_id_one\": \"L\",\n \"startup_id_two\": \"H\"\n },\n {\n \"startup_id_one\": \"D\",\n \"startup_id_two\": \"E\"\n },\n {\n \"startup_id_one\": \"D\",\n \"startup_id_two\": \"K\"\n },\n {\n \"startup_id_one\": \"E\",\n \"startup_id_two\": \"C\"\n },\n {\n \"startup_id_one\": \"E\",\n \"startup_id_two\": \"K\"\n },\n {\n \"startup_id_one\": \"F\",\n \"startup_id_two\": \"A\"\n },\n {\n \"startup_id_one\": \"F\",\n \"startup_id_two\": \"B\"\n },\n {\n \"startup_id_one\": \"F\",\n \"startup_id_two\": \"K\"\n },\n {\n \"startup_id_one\": \"B\",\n \"startup_id_two\": \"G\"\n },\n {\n \"startup_id_one\": \"B\",\n \"startup_id_two\": \"K\"\n },\n {\n \"startup_id_one\": \"C\",\n \"startup_id_two\": \"J\"\n }\n ]\n}\n\nOh, and when you send your picks back, just use this simple JSON shape so it's easy to parse:\n\n{\n \"solution\": [\"startup_id\", \"startup_id\", ...]\n}\n\nThis is just a sketch of the shape I expect: \"solution\" should be an array containing the identifiers of the startups you choose (one entry per startup). Keep it informal—think of it like filling in a short form listing which startups to back.\n\nPlease use the exact identifiers from the instance input with no renaming and no new labels. Valid identifiers look like plain numbers such as \"1\" or \"23\", single capital letters like \"A\" or \"B\", or a capital letter followed by digits like \"A1\" or \"X7\".", "instance": { "problem_type": "MIS", "num_nodes": 13, "num_edges": 24, "edges": [ { "u": 9, "v": 2 }, { "u": 9, "v": 3 }, { "u": 9, "v": 5 }, { "u": 9, "v": 7 }, { "u": 9, "v": 11 }, { "u": 13, "v": 2 }, { "u": 13, "v": 3 }, { "u": 13, "v": 7 }, { "u": 13, "v": 8 }, { "u": 13, "v": 10 }, { "u": 12, "v": 1 }, { "u": 12, "v": 2 }, { "u": 12, "v": 6 }, { "u": 12, "v": 8 }, { "u": 4, "v": 5 }, { "u": 4, "v": 11 }, { "u": 5, "v": 3 }, { "u": 5, "v": 11 }, { "u": 6, "v": 1 }, { "u": 6, "v": 2 }, { "u": 6, "v": 11 }, { "u": 2, "v": 7 }, { "u": 2, "v": 11 }, { "u": 3, "v": 10 } ], "source_file": "wa2010.mtx", "density": 0.3076923076923077, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0047.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0047.png", "edge_connectivity": 2 }, "solution": [ 1, 4, 8, 9, 10 ], "obj": 5.0, "instance_variant": { "num_nodes": 13, "num_edges": 24, "edges": [ { "u": "I", "v": "B" }, { "u": "I", "v": "C" }, { "u": "I", "v": "E" }, { "u": "I", "v": "G" }, { "u": "I", "v": "K" }, { "u": "M", "v": "B" }, { "u": "M", "v": "C" }, { "u": "M", "v": "G" }, { "u": "M", "v": "H" }, { "u": "M", "v": "J" }, { "u": "L", "v": "A" }, { "u": "L", "v": "B" }, { "u": "L", "v": "F" }, { "u": "L", "v": "H" }, { "u": "D", "v": "E" }, { "u": "D", "v": "K" }, { "u": "E", "v": "C" }, { "u": "E", "v": "K" }, { "u": "F", "v": "A" }, { "u": "F", "v": "B" }, { "u": "F", "v": "K" }, { "u": "B", "v": "G" }, { "u": "B", "v": "K" }, { "u": "C", "v": "J" } ] }, "solution_variant": [ "A", "D", "H", "I", "J" ], "context_index": 48, "input_format": "json", "input_index_base": "names" }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Recently the grounds crew was put in charge of picking trees for several new beds and the brief was to maximize diversity. In plain terms: build the largest possible list of distinct tree varieties — the plan with the higher number of unique types is better, so the tally of selected varieties decides it. The limitation is botanical: any pair of varieties that are known to cross-inhibit can’t both be included, and selections must be single, non-repeated entries from the available list. The exact options and which pairs clash follow below.\n\nThere are 15 distinct tree varieties available and 26 known cross-inhibiting pairs listed below.\nVarieties 4 and 9 cannot both be selected because they cross-inhibit.\nVarieties 4 and 14 cannot both be selected because they cross-inhibit.\nVarieties 10 and 2 cannot both be selected because they cross-inhibit.\nVarieties 10 and 11 cannot both be selected because they cross-inhibit.\nVarieties 2 and 11 cannot both be selected because they cross-inhibit.\nVarieties 2 and 15 cannot both be selected because they cross-inhibit.\nVarieties 7 and 1 cannot both be selected because they cross-inhibit.\nVarieties 7 and 3 cannot both be selected because they cross-inhibit.\nVarieties 7 and 9 cannot both be selected because they cross-inhibit.\nVarieties 5 and 1 cannot both be selected because they cross-inhibit.\nVarieties 5 and 9 cannot both be selected because they cross-inhibit.\nVarieties 5 and 15 cannot both be selected because they cross-inhibit.\nVarieties 15 and 3 cannot both be selected because they cross-inhibit.\nVarieties 15 and 6 cannot both be selected because they cross-inhibit.\nVarieties 15 and 9 cannot both be selected because they cross-inhibit.\nVarieties 15 and 11 cannot both be selected because they cross-inhibit.\nVarieties 14 and 9 cannot both be selected because they cross-inhibit.\nVarieties 8 and 3 cannot both be selected because they cross-inhibit.\nVarieties 8 and 9 cannot both be selected because they cross-inhibit.\nVarieties 8 and 12 cannot both be selected because they cross-inhibit.\nVarieties 9 and 1 cannot both be selected because they cross-inhibit.\nVarieties 9 and 3 cannot both be selected because they cross-inhibit.\nVarieties 9 and 12 cannot both be selected because they cross-inhibit.\nVarieties 9 and 13 cannot both be selected because they cross-inhibit.\nVarieties 6 and 3 cannot both be selected because they cross-inhibit.\nVarieties 3 and 1 cannot both be selected because they cross-inhibit.\nFrom the 15 options and given the 26 conflicts above, the grounds crew will pick single, non-repeated varieties that avoid these forbidden pairs to maximize diversity.\n\nOh, and when you're ready to send the picks back, please follow this simple JSON layout so it's easy to read and check:\n\n{\n \"solution\": [\"variety_id\", \"variety_id\", ...]\n}\n\nThis just means \"solution\" is a list of the tree-variety identifiers you've chosen (one identifier per chosen variety). The placeholder variety_id stands for whatever labels the instance uses for each variety — it's just showing the shape we expect, not the real answer.\n\nThe JSON above is only a sketch of the expected shape, not your final selection. Make sure to use the exact identifiers from the instance input — no renaming, no new labels. \n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 26, "edges": [ { "u": 4, "v": 9 }, { "u": 4, "v": 14 }, { "u": 10, "v": 2 }, { "u": 10, "v": 11 }, { "u": 2, "v": 11 }, { "u": 2, "v": 15 }, { "u": 7, "v": 1 }, { "u": 7, "v": 3 }, { "u": 7, "v": 9 }, { "u": 5, "v": 1 }, { "u": 5, "v": 9 }, { "u": 5, "v": 15 }, { "u": 15, "v": 3 }, { "u": 15, "v": 6 }, { "u": 15, "v": 9 }, { "u": 15, "v": 11 }, { "u": 14, "v": 9 }, { "u": 8, "v": 3 }, { "u": 8, "v": 9 }, { "u": 8, "v": 12 }, { "u": 9, "v": 1 }, { "u": 9, "v": 3 }, { "u": 9, "v": 12 }, { "u": 9, "v": 13 }, { "u": 6, "v": 3 }, { "u": 3, "v": 1 } ], "source_file": "wv2010.mtx", "density": 0.24761904761904763, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0048.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0048.png", "edge_connectivity": 1 }, "solution": [ 4, 5, 6, 7, 10, 12, 13 ], "obj": 7.0, "instance_variant": { "num_nodes": 15, "num_edges": 26, "edges": [ { "u": 4, "v": 9 }, { "u": 4, "v": 14 }, { "u": 10, "v": 2 }, { "u": 10, "v": 11 }, { "u": 2, "v": 11 }, { "u": 2, "v": 15 }, { "u": 7, "v": 1 }, { "u": 7, "v": 3 }, { "u": 7, "v": 9 }, { "u": 5, "v": 1 }, { "u": 5, "v": 9 }, { "u": 5, "v": 15 }, { "u": 15, "v": 3 }, { "u": 15, "v": 6 }, { "u": 15, "v": 9 }, { "u": 15, "v": 11 }, { "u": 14, "v": 9 }, { "u": 8, "v": 3 }, { "u": 8, "v": 9 }, { "u": 8, "v": 12 }, { "u": 9, "v": 1 }, { "u": 9, "v": 3 }, { "u": 9, "v": 12 }, { "u": 9, "v": 13 }, { "u": 6, "v": 3 }, { "u": 3, "v": 1 } ] }, "solution_variant": [ 4, 5, 6, 7, 10, 12, 13 ], "context_index": 49, "input_format": "nl", "input_index_base": 1 }, { "task_name": "MIS", "problem_type": "MIS", "instruction": "Someone in the neighborhood is arranging mantelpieces and wants to show off the most decorations they can without putting any two that interfere side by side. The job is to pick which decorations to display so the mantel ends up with the highest possible number of items, while ensuring no known-wobbly or interfering pair is included at the same time. Every item is considered individually — no duplicates, no half-placements — and the way to tell which setup wins is by counting the number of decorations that remain after removing any arrangements that include a bad pair. The list of actual ornaments and the problem pairs follows below.\n\n# total_ornaments=15\n# conflicting_pairs_count=30\nornament_one,ornament_two\nI,A\nI,B\nI,D\nI,K\nI,L\nI,N\nG,F\nG,H\nG,M\nG,O\nD,B\nD,N\nD,O\nJ,F\nJ,M\nJ,N\nJ,O\nO,M\nE,A\nE,C\nE,L\nK,A\nK,C\nK,F\nK,N\nC,F\nC,H\nF,H\nF,M\nL,A\n\nOh, and when you send back your selection, please use this simple JSON shape — it's just the form I expect:\n\n{\n \"solution\": [\"decoration_id\", \"decoration_id\", ...]\n}\n\nThink of \"solution\" as the list of decoration IDs you want to display on the mantel. Keep it light and exact: each entry should be the exact ID from the problem input (don't rename them or invent new labels). The JSON above is just a sketch of the shape I need, not the actual answer.\n\nUse the identifiers exactly as they appear in the instance input — no renaming and no new labels.\n- for example: \"Valid identifiers look like plain numbers such as “1” or “23”, single capital letters like “A” or “B”, or a capital letter followed by digits like “A1” or “X7”.\"", "instance": { "problem_type": "MIS", "num_nodes": 15, "num_edges": 30, "edges": [ { "u": 9, "v": 1 }, { "u": 9, "v": 2 }, { "u": 9, "v": 4 }, { "u": 9, "v": 11 }, { "u": 9, "v": 12 }, { "u": 9, "v": 14 }, { "u": 7, "v": 6 }, { "u": 7, "v": 8 }, { "u": 7, "v": 13 }, { "u": 7, "v": 15 }, { "u": 4, "v": 2 }, { "u": 4, "v": 14 }, { "u": 4, "v": 15 }, { "u": 10, "v": 6 }, { "u": 10, "v": 13 }, { "u": 10, "v": 14 }, { "u": 10, "v": 15 }, { "u": 15, "v": 13 }, { "u": 5, "v": 1 }, { "u": 5, "v": 3 }, { "u": 5, "v": 12 }, { "u": 11, "v": 1 }, { "u": 11, "v": 3 }, { "u": 11, "v": 6 }, { "u": 11, "v": 14 }, { "u": 3, "v": 6 }, { "u": 3, "v": 8 }, { "u": 6, "v": 8 }, { "u": 6, "v": 13 }, { "u": 12, "v": 1 } ], "source_file": "wv2010.mtx", "density": 0.2857142857142857, "viz_instance": "generated_data/MIS/viz/MIS_M/instance_0049.png", "viz_solution": "generated_data/MIS/viz/MIS_M/solution_0049.png", "edge_connectivity": 2 }, "solution": [ 2, 7, 10, 11, 12 ], "obj": 5.0, "instance_variant": { "num_nodes": 15, "num_edges": 30, "edges": [ { "u": "I", "v": "A" }, { "u": "I", "v": "B" }, { "u": "I", "v": "D" }, { "u": "I", "v": "K" }, { "u": "I", "v": "L" }, { "u": "I", "v": "N" }, { "u": "G", "v": "F" }, { "u": "G", "v": "H" }, { "u": "G", "v": "M" }, { "u": "G", "v": "O" }, { "u": "D", "v": "B" }, { "u": "D", "v": "N" }, { "u": "D", "v": "O" }, { "u": "J", "v": "F" }, { "u": "J", "v": "M" }, { "u": "J", "v": "N" }, { "u": "J", "v": "O" }, { "u": "O", "v": "M" }, { "u": "E", "v": "A" }, { "u": "E", "v": "C" }, { "u": "E", "v": "L" }, { "u": "K", "v": "A" }, { "u": "K", "v": "C" }, { "u": "K", "v": "F" }, { "u": "K", "v": "N" }, { "u": "C", "v": "F" }, { "u": "C", "v": "H" }, { "u": "F", "v": "H" }, { "u": "F", "v": "M" }, { "u": "L", "v": "A" } ] }, "solution_variant": [ "B", "G", "J", "K", "L" ], "context_index": 50, "input_format": "csv", "input_index_base": "names" } ]