diff --git "a/train2.csv" "b/train2.csv" new file mode 100644--- /dev/null +++ "b/train2.csv" @@ -0,0 +1,321 @@ +id,pair_id,family,challenge,expected_answer,relational_invariant,representation_shift,scoring_rule,metadata +AF-APER-02-0001,invariant_preservation-000,invariant_preservation,"Directed dependencies: X108→X406, X668→X534, X108→X534, X725→X468, X725→X534, X534→X668, X534→X406, X668→X468, X108→X468. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X725 to X406. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 9, ""nodes"": 6}" +AF-APER-02-0002,invariant_preservation-000,invariant_preservation,"Directed dependencies: X196→X754, X196→X559, X754→X559, X754→X751, X751→X555, X517→X754, X751→X754, X517→X555, X196→X555. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X517 to X559. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 9, ""nodes"": 6}" +AF-APER-02-0003,invariant_preservation-001,invariant_preservation,"Directed dependencies: X128→X534, X523→X879, X907→X128, X128→X879, X879→X534, X903→X523, X979→X903, X366→X879, X907→X534, X903→X907, X979→X366. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X979 to X534. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 11, ""nodes"": 8}" +AF-APER-02-0004,invariant_preservation-001,invariant_preservation,"Directed dependencies: X719→X240, X357→X118, X984→X354, X240→X118, X354→X719, X719→X546, X240→X546, X984→X718, X718→X118, X354→X357, X118→X546. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X984 to X546. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 11, ""nodes"": 8}" +AF-APER-02-0005,invariant_preservation-002,invariant_preservation,"Directed dependencies: X158→X801, X591→X593, X862→X703, X564→X158, X591→X801, X862→X655, X655→X259, X564→X862, X564→X801, X593→X564, X801→X862, X527→X259. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X591 to X259. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 12, ""nodes"": 10}" +AF-APER-02-0006,invariant_preservation-002,invariant_preservation,"Directed dependencies: X949→X325, X739→X413, X482→X146, X949→X257, X325→X415, X415→X203, X739→X325, X949→X415, X413→X949, X415→X482, X574→X146, X257→X325. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X739 to X146. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 12, ""nodes"": 10}" +AF-APER-02-0007,invariant_preservation-003,invariant_preservation,"Directed dependencies: X258→X415, X693→X901, X821→X706, X753→X693, X901→X706, X693→X775, X212→X901, X693→X821, X706→X258, X706→X190, X693→X212, X901→X821. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X753 to X415. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 12, ""nodes"": 12}" +AF-APER-02-0008,invariant_preservation-003,invariant_preservation,"Directed dependencies: X743→X870, X870→X994, X579→X714, X204→X579, X579→X533, X579→X974, X533→X743, X974→X533, X870→X767, X994→X630, X579→X743, X533→X870. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X204 to X630. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 12, ""nodes"": 12}" +AF-APER-02-0009,invariant_preservation-004,invariant_preservation,"Directed dependencies: X744→X453, X576→X744, X942→X549, X688→X936, X885→X198, X198→X549, X453→X230, X942→X576, X885→X942, X230→X936. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X885 to X936. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 10, ""nodes"": 10}" +AF-APER-02-0010,invariant_preservation-004,invariant_preservation,"Directed dependencies: X668→X263, X589→X668, X970→X136, X919→X970, X136→X676, X589→X919, X919→X263, X140→X983, X807→X983, X676→X140. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X589 to X983. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 10, ""nodes"": 10}" +AF-APER-02-0011,invariant_preservation-005,invariant_preservation,"Directed dependencies: X549→X648, X910→X142, X772→X952, X772→X648, X579→X648, X910→X772, X579→X910, X648→X142, X142→X952, X579→X142. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X579 to X952. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 10, ""nodes"": 7}" +AF-APER-02-0012,invariant_preservation-005,invariant_preservation,"Directed dependencies: X569→X673, X263→X936, X569→X317, X673→X263, X569→X325, X263→X325, X317→X936, X243→X325, X325→X317, X673→X317. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X569 to X936. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 10, ""nodes"": 7}" +AF-APER-02-0013,invariant_preservation-006,invariant_preservation,"Directed dependencies: X830→X417, X610→X580, X830→X714, X580→X253, X830→X253, X830→X266, X716→X830, X253→X266, X610→X253, X253→X580, X714→X417, X714→X158, X716→X580, X266→X158. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X610 to X158. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 14, ""nodes"": 9}" +AF-APER-02-0014,invariant_preservation-006,invariant_preservation,"Directed dependencies: X831→X228, X920→X717, X634→X174, X920→X243, X717→X216, X228→X174, X920→X984, X174→X243, X831→X920, X920→X174, X174→X228, X243→X216, X717→X984, X634→X228. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X634 to X216. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 14, ""nodes"": 9}" +AF-APER-02-0015,invariant_preservation-007,invariant_preservation,"Directed dependencies: X549→X512, X549→X277, X772→X549, X677→X549, X410→X277, X512→X474, X474→X997, X772→X690, X277→X997, X744→X772, X410→X512, X772→X677. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X744 to X997. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 12, ""nodes"": 11}" +AF-APER-02-0016,invariant_preservation-007,invariant_preservation,"Directed dependencies: X908→X721, X295→X783, X184→X995, X995→X721, X585→X908, X295→X184, X689→X295, X295→X707, X184→X585, X218→X995, X707→X184, X218→X585. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X689 to X721. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 12, ""nodes"": 11}" +AF-APER-02-0017,invariant_preservation-008,invariant_preservation,"Directed dependencies: X169→X928, X930→X169, X133→X897, X928→X353, X353→X882, X928→X882, X289→X881, X897→X930. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X133 to X882. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 8, ""nodes"": 9}" +AF-APER-02-0018,invariant_preservation-008,invariant_preservation,"Directed dependencies: X351→X903, X903→X740, X351→X740, X940→X351, X639→X607, X935→X750, X671→X940, X750→X671. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X935 to X740. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 8, ""nodes"": 9}" +AF-APER-02-0019,invariant_preservation-009,invariant_preservation,"Directed dependencies: X382→X323, X932→X539, X323→X627, X539→X720, X627→X539, X540→X341, X539→X659, X539→X949, X323→X932, X627→X949, X932→X627, X720→X540. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X382 to X341. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 12, ""nodes"": 11}" +AF-APER-02-0020,invariant_preservation-009,invariant_preservation,"Directed dependencies: X520→X760, X520→X490, X476→X811, X353→X520, X353→X870, X490→X579, X646→X520, X811→X353, X811→X646, X646→X353, X579→X966, X520→X870. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X476 to X966. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 12, ""nodes"": 11}" +AF-APER-02-0021,invariant_preservation-010,invariant_preservation,"Directed dependencies: X609→X998, X998→X609, X998→X790, X747→X761, X761→X609, X262→X903, X760→X903, X760→X998, X761→X790, X747→X790, X998→X747, X609→X903. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X760 to X790. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 12, ""nodes"": 8}" +AF-APER-02-0022,invariant_preservation-010,invariant_preservation,"Directed dependencies: X886→X775, X994→X801, X775→X555, X775→X960, X437→X960, X915→X960, X555→X775, X886→X801, X437→X555, X555→X801, X994→X886, X555→X994. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X437 to X801. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 12, ""nodes"": 8}" +AF-APER-02-0023,invariant_preservation-011,invariant_preservation,"Directed dependencies: X692→X922, X885→X922, X656→X922, X403→X922, X656→X885, X431→X403, X431→X656, X501→X267, X580→X431. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X580 to X922. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 9, ""nodes"": 10}" +AF-APER-02-0024,invariant_preservation-011,invariant_preservation,"Directed dependencies: X587→X328, X625→X328, X240→X473, X473→X684, X684→X328, X587→X625, X473→X587, X374→X366, X896→X328. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X240 to X328. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 9, ""nodes"": 10}" +AF-APER-02-0025,invariant_preservation-012,invariant_preservation,"Directed dependencies: X471→X163, X163→X294, X471→X346, X346→X294, X298→X165, X471→X367, X163→X974, X294→X298. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X471 to X165. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 8, ""nodes"": 8}" +AF-APER-02-0026,invariant_preservation-012,invariant_preservation,"Directed dependencies: X335→X395, X894→X607, X202→X649, X335→X202, X607→X311, X202→X894, X335→X264, X395→X894. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X335 to X311. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 8, ""nodes"": 8}" +AF-APER-02-0027,invariant_preservation-013,invariant_preservation,"Directed dependencies: X450→X651, X694→X293, X694→X789, X293→X789, X458→X694, X789→X642, X458→X293, X642→X766, X266→X642, X766→X651. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X458 to X651. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 10, ""nodes"": 10}" +AF-APER-02-0028,invariant_preservation-013,invariant_preservation,"Directed dependencies: X849→X852, X599→X849, X125→X852, X990→X599, X982→X728, X728→X364, X728→X981, X982→X981, X981→X364, X364→X599. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X982 to X852. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 10, ""nodes"": 10}" +AF-APER-02-0029,invariant_preservation-014,invariant_preservation,"Directed dependencies: X539→X169, X487→X983, X261→X608, X983→X169, X364→X539, X782→X364, X129→X983, X364→X487, X169→X411, X261→X357, X782→X453, X453→X487, X608→X357, X357→X782, X487→X539, X608→X782. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X261 to X411. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 16, ""nodes"": 12}" +AF-APER-02-0030,invariant_preservation-014,invariant_preservation,"Directed dependencies: X912→X384, X584→X315, X459→X521, X418→X384, X661→X315, X661→X584, X521→X912, X828→X459, X459→X418, X553→X912, X384→X183, X828→X461, X584→X828, X461→X521, X521→X418, X315→X828. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X661 to X183. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 16, ""nodes"": 12}" +AF-APER-02-0031,invariant_preservation-015,invariant_preservation,"Directed dependencies: X543→X904, X904→X840, X543→X194, X746→X904, X179→X102, X904→X420, X179→X194, X904→X747, X179→X904, X102→X194, X747→X420, X179→X420, X420→X840, X194→X543, X746→X840, X746→X194. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X179 to X840. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 16, ""nodes"": 9}" +AF-APER-02-0032,invariant_preservation-015,invariant_preservation,"Directed dependencies: X253→X257, X614→X257, X567→X127, X882→X127, X567→X740, X567→X257, X567→X882, X882→X418, X257→X253, X127→X792, X418→X127, X740→X257, X253→X882, X882→X792, X614→X882, X614→X792. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X567 to X792. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 16, ""nodes"": 9}" +AF-APER-02-0033,invariant_preservation-016,invariant_preservation,"Directed dependencies: X751→X862, X908→X222, X505→X862, X908→X751, X419→X222, X751→X505, X751→X222, X419→X908, X862→X891, X419→X751, X419→X505, X222→X862. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X419 to X891. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 12, ""nodes"": 7}" +AF-APER-02-0034,invariant_preservation-016,invariant_preservation,"Directed dependencies: X497→X255, X567→X497, X900→X497, X682→X672, X255→X672, X497→X672, X567→X682, X672→X105, X900→X567, X900→X255, X900→X682, X497→X682. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X900 to X105. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 12, ""nodes"": 7}" +AF-APER-02-0035,invariant_preservation-017,invariant_preservation,"Directed dependencies: X125→X277, X277→X691, X691→X339, X277→X413, X200→X413, X339→X843, X413→X860, X200→X329, X200→X277, X413→X691. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X125 to X843. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 10, ""nodes"": 9}" +AF-APER-02-0036,invariant_preservation-017,invariant_preservation,"Directed dependencies: X983→X916, X983→X688, X789→X983, X789→X490, X688→X917, X449→X824, X824→X983, X917→X219, X789→X824, X824→X688. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X449 to X219. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 10, ""nodes"": 9}" +AF-APER-02-0037,invariant_preservation-018,invariant_preservation,"Directed dependencies: X343→X188, X430→X759, X188→X265, X634→X975, X995→X759, X343→X740, X634→X343, X265→X995, X634→X740, X188→X740, X265→X430, X826→X634, X343→X265. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X826 to X759. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 13, ""nodes"": 11}" +AF-APER-02-0038,invariant_preservation-018,invariant_preservation,"Directed dependencies: X330→X859, X135→X258, X330→X741, X135→X210, X724→X258, X741→X645, X210→X330, X135→X330, X859→X645, X588→X724, X724→X135, X724→X589, X210→X258. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X588 to X645. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 13, ""nodes"": 11}" +AF-APER-02-0039,invariant_preservation-019,invariant_preservation,"Directed dependencies: X330→X927, X707→X609, X397→X609, X914→X330, X927→X620, X609→X914, X650→X609, X609→X640, X930→X707, X640→X330, X661→X914. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X930 to X620. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 11, ""nodes"": 13}" +AF-APER-02-0040,invariant_preservation-019,invariant_preservation,"Directed dependencies: X460→X977, X680→X460, X691→X814, X513→X228, X409→X228, X977→X614, X228→X814, X793→X409, X579→X228, X814→X460, X228→X680. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X793 to X614. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 11, ""nodes"": 13}" +AF-APER-02-0041,invariant_preservation-020,invariant_preservation,"Directed dependencies: X903→X390, X658→X390, X926→X972, X658→X903, X947→X926, X926→X658, X390→X926, X658→X972, X390→X972, X947→X390, X390→X658, X926→X903. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X947 to X972. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 12, ""nodes"": 6}" +AF-APER-02-0042,invariant_preservation-020,invariant_preservation,"Directed dependencies: X833→X118, X672→X257, X833→X257, X616→X833, X833→X119, X118→X119, X118→X257, X118→X672, X672→X833, X119→X672, X616→X672, X672→X118. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X616 to X257. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 12, ""nodes"": 6}" +AF-APER-02-0043,invariant_preservation-021,invariant_preservation,"Directed dependencies: X726→X125, X486→X726, X125→X262, X716→X486, X726→X879, X587→X726, X716→X726, X262→X644, X486→X125, X125→X644. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X716 to X644. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 10, ""nodes"": 8}" +AF-APER-02-0044,invariant_preservation-021,invariant_preservation,"Directed dependencies: X498→X579, X579→X210, X347→X498, X188→X715, X347→X715, X715→X498, X212→X715, X188→X347, X498→X210, X715→X942. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X188 to X210. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 10, ""nodes"": 8}" +AF-APER-02-0045,invariant_preservation-022,invariant_preservation,"Directed dependencies: X949→X854, X854→X275, X892→X894, X894→X119, X836→X873, X873→X854, X949→X892, X275→X119, X873→X892, X121→X275, X854→X143. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X836 to X119. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 11, ""nodes"": 10}" +AF-APER-02-0046,invariant_preservation-022,invariant_preservation,"Directed dependencies: X493→X512, X512→X574, X574→X268, X176→X574, X809→X883, X493→X809, X477→X183, X183→X809, X183→X512, X883→X268, X512→X224. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X477 to X268. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 11, ""nodes"": 10}" +AF-APER-02-0047,invariant_preservation-023,invariant_preservation,"Directed dependencies: X256→X801, X652→X815, X799→X617, X833→X799, X930→X256, X256→X833, X652→X155, X801→X833, X652→X930, X930→X589, X589→X155, X801→X799, X815→X256, X155→X589, X151→X617. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X652 to X617. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 15, ""nodes"": 12}" +AF-APER-02-0048,invariant_preservation-023,invariant_preservation,"Directed dependencies: X338→X985, X868→X234, X622→X293, X586→X622, X338→X868, X234→X868, X622→X493, X493→X864, X985→X586, X586→X293, X298→X586, X338→X298, X293→X493, X985→X234, X508→X864. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X338 to X864. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 15, ""nodes"": 12}" +AF-APER-02-0049,invariant_preservation-024,invariant_preservation,"Directed dependencies: X335→X786, X209→X445, X894→X445, X425→X445, X786→X854, X854→X480, X209→X894, X854→X302, X846→X335, X425→X894, X480→X209, X480→X425. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X846 to X445. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 12, ""nodes"": 10}" +AF-APER-02-0050,invariant_preservation-024,invariant_preservation,"Directed dependencies: X872→X406, X339→X872, X868→X876, X872→X343, X234→X339, X335→X184, X876→X234, X343→X184, X339→X646, X406→X335, X406→X184, X343→X335. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X868 to X184. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 12, ""nodes"": 10}" +AF-APER-02-0051,invariant_preservation-025,invariant_preservation,"Directed dependencies: X703→X949, X968→X949, X877→X968, X877→X703, X810→X703, X827→X703, X703→X810, X107→X949, X968→X877, X827→X968. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X827 to X949. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 10, ""nodes"": 7}" +AF-APER-02-0052,invariant_preservation-025,invariant_preservation,"Directed dependencies: X785→X758, X969→X758, X645→X969, X832→X758, X969→X682, X645→X785, X785→X645, X810→X969, X682→X969, X810→X785. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X810 to X758. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 10, ""nodes"": 7}" +AF-APER-02-0053,invariant_preservation-026,invariant_preservation,"Directed dependencies: X816→X542, X531→X387, X535→X733, X542→X531, X535→X387, X387→X733, X535→X531, X542→X535, X816→X356, X542→X387, X356→X749. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X816 to X733. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 11, ""nodes"": 9}" +AF-APER-02-0054,invariant_preservation-026,invariant_preservation,"Directed dependencies: X271→X153, X579→X271, X579→X242, X242→X271, X427→X711, X579→X153, X242→X153, X242→X512, X408→X427, X408→X579, X153→X512. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X408 to X512. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 11, ""nodes"": 9}" +AF-APER-02-0055,invariant_preservation-027,invariant_preservation,"Directed dependencies: X547→X609, X924→X767, X498→X609, X439→X729, X767→X755, X709→X729, X767→X523, X729→X498, X924→X709. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X924 to X609. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 9, ""nodes"": 11}" +AF-APER-02-0056,invariant_preservation-027,invariant_preservation,"Directed dependencies: X153→X162, X350→X153, X737→X490, X112→X375, X112→X406, X162→X490, X375→X696, X375→X180, X406→X153. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X112 to X490. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 9, ""nodes"": 11}" +AF-APER-02-0057,invariant_preservation-028,invariant_preservation,"Directed dependencies: X674→X643, X915→X766, X674→X915, X643→X766, X470→X674, X643→X915, X470→X595, X792→X470, X643→X583, X595→X583, X766→X926. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X792 to X926. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 11, ""nodes"": 9}" +AF-APER-02-0058,invariant_preservation-028,invariant_preservation,"Directed dependencies: X524→X763, X494→X271, X524→X371, X371→X562, X849→X585, X494→X849, X763→X271, X494→X562, X371→X494, X885→X524, X562→X849. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X885 to X585. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 11, ""nodes"": 9}" +AF-APER-02-0059,invariant_preservation-029,invariant_preservation,"Directed dependencies: X858→X809, X198→X990, X580→X858, X858→X913, X437→X222, X809→X437, X941→X580, X303→X580, X558→X303, X913→X990. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X558 to X222. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 10, ""nodes"": 11}" +AF-APER-02-0060,invariant_preservation-029,invariant_preservation,"Directed dependencies: X635→X871, X871→X996, X389→X635, X996→X602, X198→X665, X495→X665, X994→X635, X871→X495, X543→X389, X602→X671. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X543 to X671. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 10, ""nodes"": 11}" +AF-APER-02-0061,invariant_preservation-030,invariant_preservation,"Directed dependencies: X139→X979, X693→X533, X188→X214, X214→X848, X693→X979, X979→X123, X693→X139, X188→X533, X979→X214, X188→X979, X533→X139, X188→X139, X188→X693, X533→X848. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X188 to X848. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 14, ""nodes"": 8}" +AF-APER-02-0062,invariant_preservation-030,invariant_preservation,"Directed dependencies: X650→X575, X476→X165, X890→X476, X660→X650, X476→X660, X519→X165, X890→X660, X811→X660, X890→X519, X811→X476, X890→X811, X890→X650, X650→X519, X811→X650. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X890 to X165. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 14, ""nodes"": 8}" +AF-APER-02-0063,invariant_preservation-031,invariant_preservation,"Directed dependencies: X759→X522, X362→X867, X636→X106, X362→X522, X362→X425, X720→X425, X720→X522, X867→X522, X867→X425, X106→X522, X106→X425, X636→X867, X759→X550, X425→X550. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X636 to X550. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 14, ""nodes"": 10}" +AF-APER-02-0064,invariant_preservation-031,invariant_preservation,"Directed dependencies: X125→X993, X317→X409, X317→X453, X567→X409, X637→X154, X993→X453, X637→X462, X567→X993, X125→X409, X125→X154, X462→X409, X462→X993, X154→X409, X154→X993. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X637 to X453. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 14, ""nodes"": 10}" +AF-APER-02-0065,invariant_preservation-032,invariant_preservation,"Directed dependencies: X321→X351, X187→X321, X689→X925, X351→X689, X351→X925, X925→X854, X893→X321, X187→X351, X351→X321, X893→X351, X321→X689, X854→X564, X893→X689. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X187 to X564. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 13, ""nodes"": 8}" +AF-APER-02-0066,invariant_preservation-032,invariant_preservation,"Directed dependencies: X585→X761, X761→X459, X861→X585, X585→X459, X861→X761, X496→X612, X207→X496, X761→X585, X922→X585, X922→X761, X861→X459, X585→X207, X459→X207. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X922 to X612. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 13, ""nodes"": 8}" +AF-APER-02-0067,invariant_preservation-033,invariant_preservation,"Directed dependencies: X530→X260, X197→X774, X476→X260, X377→X979, X377→X476, X530→X122, X368→X197, X260→X368. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X377 to X774. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 8, ""nodes"": 10}" +AF-APER-02-0068,invariant_preservation-033,invariant_preservation,"Directed dependencies: X623→X712, X309→X623, X712→X530, X467→X423, X309→X402, X519→X712, X519→X226, X530→X467. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X309 to X423. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 8, ""nodes"": 10}" +AF-APER-02-0069,invariant_preservation-034,invariant_preservation,"Directed dependencies: X252→X662, X662→X252, X940→X537, X681→X472, X867→X681, X268→X681, X337→X795, X472→X348, X238→X472, X252→X867, X472→X940, X337→X252, X348→X537, X867→X238. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X337 to X537. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 14, ""nodes"": 12}" +AF-APER-02-0070,invariant_preservation-034,invariant_preservation,"Directed dependencies: X440→X181, X579→X503, X775→X901, X325→X465, X503→X325, X465→X668, X136→X440, X901→X325, X579→X901, X136→X313, X325→X751, X181→X440, X751→X668, X440→X579. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X136 to X668. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 14, ""nodes"": 12}" +AF-APER-02-0071,invariant_preservation-035,invariant_preservation,"Directed dependencies: X609→X159, X609→X316, X332→X592, X592→X159, X223→X159, X519→X163, X332→X223, X332→X163, X609→X592, X223→X592, X519→X592, X519→X223. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X519 to X159. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 12, ""nodes"": 9}" +AF-APER-02-0072,invariant_preservation-035,invariant_preservation,"Directed dependencies: X879→X486, X976→X688, X879→X117, X469→X415, X976→X415, X469→X794, X469→X688, X415→X117, X415→X688, X688→X117, X879→X688, X976→X794. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X976 to X117. Respond with an integer.",2,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 2, ""edges"": 12, ""nodes"": 9}" +AF-APER-02-0073,invariant_preservation-036,invariant_preservation,"Directed dependencies: X140→X936, X140→X378, X144→X765, X616→X936, X936→X378, X378→X144, X936→X144, X378→X839. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X140 to X765. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 8, ""nodes"": 7}" +AF-APER-02-0074,invariant_preservation-036,invariant_preservation,"Directed dependencies: X580→X826, X531→X826, X531→X481, X460→X531, X580→X531, X481→X158, X826→X481, X826→X633. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X580 to X158. Respond with an integer.",3,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 3, ""edges"": 8, ""nodes"": 7}" +AF-APER-02-0075,invariant_preservation-037,invariant_preservation,"Directed dependencies: X913→X798, X373→X625, X731→X625, X846→X373, X913→X846, X305→X445, X798→X731, X913→X244, X731→X305, X846→X731. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X913 to X445. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 10, ""nodes"": 9}" +AF-APER-02-0076,invariant_preservation-037,invariant_preservation,"Directed dependencies: X695→X705, X868→X454, X340→X124, X155→X140, X140→X695, X340→X932, X124→X868, X340→X155, X140→X454, X124→X140. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X340 to X705. Respond with an integer.",4,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 4, ""edges"": 10, ""nodes"": 9}" +AF-APER-02-0077,invariant_preservation-038,invariant_preservation,"Directed dependencies: X100→X529, X100→X431, X529→X342, X705→X583, X342→X705, X583→X715, X830→X100, X431→X529, X705→X845, X529→X705, X830→X431. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X830 to X715. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 11, ""nodes"": 11}" +AF-APER-02-0078,invariant_preservation-038,invariant_preservation,"Directed dependencies: X483→X777, X888→X891, X346→X888, X777→X346, X905→X618, X888→X553, X618→X777, X905→X483, X618→X483, X777→X888, X891→X887. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X905 to X887. Respond with an integer.",5,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 5, ""edges"": 11, ""nodes"": 11}" +AF-APER-02-0079,invariant_preservation-039,invariant_preservation,"Directed dependencies: X827→X145, X683→X339, X683→X778, X304→X827, X437→X683, X145→X280, X827→X690, X778→X827, X823→X502, X145→X105, X145→X823, X105→X502. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X437 to X502. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 12, ""nodes"": 13}" +AF-APER-02-0080,invariant_preservation-039,invariant_preservation,"Directed dependencies: X775→X596, X775→X784, X958→X775, X341→X432, X298→X315, X298→X414, X432→X987, X432→X298, X784→X432, X315→X646, X298→X237, X414→X646. Node identifiers are arbitrary and edge order is irrelevant. Find the minimum number of directed edges from X958 to X646. Respond with an integer.",6,Shortest directed path under relabeling,Bijective relabeling and shuffled edge order,Exact integer,"{""answer_type"": ""integer"", ""canonical_distance"": 6, ""edges"": 12, ""nodes"": 13}" +AF-APER-02-0101,misleading_representation-000,misleading_representation,"Station identifiers: 17600, 17700, 19300, 17620, 17630, 17640. Directed connections: 17620→17630, 19300→17700, 17630→17640, 17600→19300, 17640→17700, 17600→17620. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 17600 to 17700? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0102,misleading_representation-000,misleading_representation,"Station identifiers: 126600, 126700, 128300, 126620, 126630, 126640. Directed connections: 126620→126630, 128300→126700, 126600→126620, 126600→128300, 126640→126700, 126630→126640. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 126600 to 126700? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0103,misleading_representation-001,misleading_representation,"Station identifiers: 136100, 136200, 137800, 138600, 136120, 136130, 136140, 136150. Directed connections: 136100→136120, 137800→138600, 136140→136150, 136100→137800, 136150→136200, 136120→136130, 138600→136200, 136130→136140. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 136100 to 136200? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0104,misleading_representation-001,misleading_representation,"Station identifiers: 159300, 159400, 161000, 161800, 159320, 159330, 159340, 159350. Directed connections: 161800→159400, 159340→159350, 159300→161000, 161000→161800, 159330→159340, 159350→159400, 159320→159330, 159300→159320. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 159300 to 159400? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0105,misleading_representation-002,misleading_representation,"Station identifiers: 190600, 190700, 192300, 193100, 193900, 190620, 190630, 190640, 190650, 190660. Directed connections: 190650→190660, 190630→190640, 190600→192300, 190660→190700, 190620→190630, 190640→190650, 192300→193100, 193900→190700, 190600→190620, 193100→193900. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 190600 to 190700? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0106,misleading_representation-002,misleading_representation,"Station identifiers: 111500, 111600, 113200, 114000, 114800, 111520, 111530, 111540, 111550, 111560. Directed connections: 111500→111520, 111550→111560, 114000→114800, 114800→111600, 111540→111550, 111560→111600, 111520→111530, 111500→113200, 111530→111540, 113200→114000. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 111500 to 111600? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0107,misleading_representation-003,misleading_representation,"Station identifiers: 18900, 19000, 20600, 21400, 22200, 23000, 18920, 18930, 18940, 18950, 18960, 18970. Directed connections: 18930→18940, 18900→20600, 18960→18970, 18950→18960, 18970→19000, 23000→19000, 21400→22200, 22200→23000, 20600→21400, 18900→18920, 18940→18950, 18920→18930. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 18900 to 19000? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0108,misleading_representation-003,misleading_representation,"Station identifiers: 157800, 157900, 159500, 160300, 161100, 161900, 157820, 157830, 157840, 157850, 157860, 157870. Directed connections: 159500→160300, 157860→157870, 157830→157840, 157800→157820, 157850→157860, 161100→161900, 160300→161100, 157800→159500, 157820→157830, 161900→157900, 157840→157850, 157870→157900. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 157800 to 157900? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0109,misleading_representation-004,misleading_representation,"Station identifiers: 174000, 174100, 175700, 176500, 177300, 178100, 178900, 174020, 174030, 174040, 174050, 174060, 174070, 174080. Directed connections: 177300→178100, 174040→174050, 174000→174020, 178100→178900, 176500→177300, 178900→174100, 174080→174100, 174060→174070, 174030→174040, 174000→175700, 175700→176500, 174050→174060, 174020→174030, 174070→174080. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 174000 to 174100? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0110,misleading_representation-004,misleading_representation,"Station identifiers: 192900, 193000, 194600, 195400, 196200, 197000, 197800, 192920, 192930, 192940, 192950, 192960, 192970, 192980. Directed connections: 197800→193000, 192900→194600, 192960→192970, 192980→193000, 192920→192930, 192940→192950, 196200→197000, 192900→192920, 194600→195400, 192970→192980, 195400→196200, 192950→192960, 197000→197800, 192930→192940. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 192900 to 193000? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0111,misleading_representation-005,misleading_representation,"Station identifiers: 108400, 108500, 110100, 108420, 108430, 108440. Directed connections: 108420→108430, 108400→108420, 108400→110100, 108430→108440, 110100→108500, 108440→108500. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 108400 to 108500? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0112,misleading_representation-005,misleading_representation,"Station identifiers: 57000, 57100, 58700, 57020, 57030, 57040. Directed connections: 57030→57040, 58700→57100, 57040→57100, 57020→57030, 57000→57020, 57000→58700. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 57000 to 57100? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0113,misleading_representation-006,misleading_representation,"Station identifiers: 141600, 141700, 143300, 144100, 141620, 141630, 141640, 141650. Directed connections: 141650→141700, 141620→141630, 144100→141700, 141640→141650, 141600→143300, 141630→141640, 143300→144100, 141600→141620. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 141600 to 141700? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0114,misleading_representation-006,misleading_representation,"Station identifiers: 175100, 175200, 176800, 177600, 175120, 175130, 175140, 175150. Directed connections: 175140→175150, 175130→175140, 175100→176800, 177600→175200, 175100→175120, 175150→175200, 175120→175130, 176800→177600. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 175100 to 175200? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0115,misleading_representation-007,misleading_representation,"Station identifiers: 59100, 59200, 60800, 61600, 62400, 59120, 59130, 59140, 59150, 59160. Directed connections: 59100→60800, 61600→62400, 62400→59200, 59100→59120, 60800→61600, 59150→59160, 59120→59130, 59160→59200, 59130→59140, 59140→59150. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 59100 to 59200? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0116,misleading_representation-007,misleading_representation,"Station identifiers: 30400, 30500, 32100, 32900, 33700, 30420, 30430, 30440, 30450, 30460. Directed connections: 33700→30500, 32900→33700, 30440→30450, 30420→30430, 30430→30440, 32100→32900, 30460→30500, 30400→32100, 30400→30420, 30450→30460. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 30400 to 30500? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0117,misleading_representation-008,misleading_representation,"Station identifiers: 97300, 97400, 99000, 99800, 100600, 101400, 97320, 97330, 97340, 97350, 97360, 97370. Directed connections: 97300→97320, 97350→97360, 97370→97400, 99000→99800, 97360→97370, 97330→97340, 100600→101400, 97300→99000, 97320→97330, 99800→100600, 97340→97350, 101400→97400. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 97300 to 97400? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0118,misleading_representation-008,misleading_representation,"Station identifiers: 14800, 14900, 16500, 17300, 18100, 18900, 14820, 14830, 14840, 14850, 14860, 14870. Directed connections: 14860→14870, 18100→18900, 17300→18100, 14850→14860, 14830→14840, 14800→16500, 14870→14900, 16500→17300, 18900→14900, 14820→14830, 14840→14850, 14800→14820. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 14800 to 14900? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0119,misleading_representation-009,misleading_representation,"Station identifiers: 93300, 93400, 95000, 95800, 96600, 97400, 98200, 93320, 93330, 93340, 93350, 93360, 93370, 93380. Directed connections: 93330→93340, 93380→93400, 95000→95800, 93340→93350, 93300→93320, 93300→95000, 96600→97400, 98200→93400, 93370→93380, 97400→98200, 95800→96600, 93350→93360, 93360→93370, 93320→93330. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 93300 to 93400? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0120,misleading_representation-009,misleading_representation,"Station identifiers: 125000, 125100, 126700, 127500, 128300, 129100, 129900, 125020, 125030, 125040, 125050, 125060, 125070, 125080. Directed connections: 125050→125060, 125080→125100, 125000→125020, 125070→125080, 126700→127500, 127500→128300, 125040→125050, 125000→126700, 125030→125040, 128300→129100, 125020→125030, 129100→129900, 125060→125070, 129900→125100. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 125000 to 125100? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0121,misleading_representation-010,misleading_representation,"Station identifiers: 25100, 25200, 26800, 25120, 25130, 25140. Directed connections: 26800→25200, 25130→25140, 25100→25120, 25100→26800, 25120→25130, 25140→25200. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 25100 to 25200? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0122,misleading_representation-010,misleading_representation,"Station identifiers: 192600, 192700, 194300, 192620, 192630, 192640. Directed connections: 192600→192620, 194300→192700, 192640→192700, 192630→192640, 192600→194300, 192620→192630. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 192600 to 192700? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0123,misleading_representation-011,misleading_representation,"Station identifiers: 178700, 178800, 180400, 181200, 178720, 178730, 178740, 178750. Directed connections: 178720→178730, 178700→178720, 178750→178800, 178700→180400, 178740→178750, 178730→178740, 181200→178800, 180400→181200. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 178700 to 178800? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0124,misleading_representation-011,misleading_representation,"Station identifiers: 186700, 186800, 188400, 189200, 186720, 186730, 186740, 186750. Directed connections: 186720→186730, 186740→186750, 189200→186800, 188400→189200, 186730→186740, 186750→186800, 186700→188400, 186700→186720. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 186700 to 186800? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0125,misleading_representation-012,misleading_representation,"Station identifiers: 142400, 142500, 144100, 144900, 145700, 142420, 142430, 142440, 142450, 142460. Directed connections: 142430→142440, 142440→142450, 142400→144100, 144100→144900, 142450→142460, 142460→142500, 142420→142430, 144900→145700, 142400→142420, 145700→142500. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 142400 to 142500? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0126,misleading_representation-012,misleading_representation,"Station identifiers: 167500, 167600, 169200, 170000, 170800, 167520, 167530, 167540, 167550, 167560. Directed connections: 167540→167550, 167500→167520, 167500→169200, 167560→167600, 169200→170000, 170800→167600, 170000→170800, 167550→167560, 167530→167540, 167520→167530. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 167500 to 167600? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0127,misleading_representation-013,misleading_representation,"Station identifiers: 87200, 87300, 88900, 89700, 90500, 91300, 87220, 87230, 87240, 87250, 87260, 87270. Directed connections: 87200→88900, 89700→90500, 88900→89700, 87270→87300, 90500→91300, 87230→87240, 87250→87260, 87240→87250, 91300→87300, 87200→87220, 87260→87270, 87220→87230. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 87200 to 87300? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0128,misleading_representation-013,misleading_representation,"Station identifiers: 169600, 169700, 171300, 172100, 172900, 173700, 169620, 169630, 169640, 169650, 169660, 169670. Directed connections: 169660→169670, 173700→169700, 169670→169700, 169600→171300, 169650→169660, 172900→173700, 169620→169630, 169640→169650, 169600→169620, 172100→172900, 169630→169640, 171300→172100. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 169600 to 169700? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0129,misleading_representation-014,misleading_representation,"Station identifiers: 18400, 18500, 20100, 20900, 21700, 22500, 23300, 18420, 18430, 18440, 18450, 18460, 18470, 18480. Directed connections: 18400→18420, 20900→21700, 18430→18440, 18470→18480, 21700→22500, 22500→23300, 18400→20100, 18450→18460, 23300→18500, 18440→18450, 18480→18500, 20100→20900, 18420→18430, 18460→18470. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 18400 to 18500? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0130,misleading_representation-014,misleading_representation,"Station identifiers: 55800, 55900, 57500, 58300, 59100, 59900, 60700, 55820, 55830, 55840, 55850, 55860, 55870, 55880. Directed connections: 55840→55850, 58300→59100, 55800→57500, 55820→55830, 57500→58300, 60700→55900, 55870→55880, 55830→55840, 55850→55860, 59900→60700, 59100→59900, 55800→55820, 55860→55870, 55880→55900. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 55800 to 55900? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0131,misleading_representation-015,misleading_representation,"Station identifiers: 64300, 64400, 66000, 64320, 64330, 64340. Directed connections: 64330→64340, 64320→64330, 64340→64400, 64300→64320, 66000→64400, 64300→66000. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 64300 to 64400? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0132,misleading_representation-015,misleading_representation,"Station identifiers: 121200, 121300, 122900, 121220, 121230, 121240. Directed connections: 121200→122900, 122900→121300, 121200→121220, 121220→121230, 121240→121300, 121230→121240. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 121200 to 121300? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0133,misleading_representation-016,misleading_representation,"Station identifiers: 105200, 105300, 106900, 107700, 105220, 105230, 105240, 105250. Directed connections: 105230→105240, 105240→105250, 105220→105230, 107700→105300, 106900→107700, 105200→105220, 105250→105300, 105200→106900. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 105200 to 105300? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0134,misleading_representation-016,misleading_representation,"Station identifiers: 153500, 153600, 155200, 156000, 153520, 153530, 153540, 153550. Directed connections: 155200→156000, 153530→153540, 153500→155200, 153550→153600, 156000→153600, 153540→153550, 153500→153520, 153520→153530. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 153500 to 153600? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0135,misleading_representation-017,misleading_representation,"Station identifiers: 179600, 179700, 181300, 182100, 182900, 179620, 179630, 179640, 179650, 179660. Directed connections: 182100→182900, 182900→179700, 179600→181300, 181300→182100, 179630→179640, 179600→179620, 179660→179700, 179640→179650, 179620→179630, 179650→179660. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 179600 to 179700? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0136,misleading_representation-017,misleading_representation,"Station identifiers: 80400, 80500, 82100, 82900, 83700, 80420, 80430, 80440, 80450, 80460. Directed connections: 80400→82100, 82100→82900, 80400→80420, 82900→83700, 80430→80440, 80460→80500, 83700→80500, 80440→80450, 80420→80430, 80450→80460. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 80400 to 80500? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0137,misleading_representation-018,misleading_representation,"Station identifiers: 41900, 42000, 43600, 44400, 45200, 46000, 41920, 41930, 41940, 41950, 41960, 41970. Directed connections: 46000→42000, 44400→45200, 41920→41930, 41950→41960, 45200→46000, 41940→41950, 41900→43600, 41900→41920, 41960→41970, 43600→44400, 41970→42000, 41930→41940. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 41900 to 42000? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0138,misleading_representation-018,misleading_representation,"Station identifiers: 74900, 75000, 76600, 77400, 78200, 79000, 74920, 74930, 74940, 74950, 74960, 74970. Directed connections: 74900→76600, 74900→74920, 74970→75000, 77400→78200, 79000→75000, 74920→74930, 76600→77400, 74930→74940, 78200→79000, 74950→74960, 74940→74950, 74960→74970. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 74900 to 75000? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0139,misleading_representation-019,misleading_representation,"Station identifiers: 86100, 86200, 87800, 88600, 89400, 90200, 91000, 86120, 86130, 86140, 86150, 86160, 86170, 86180. Directed connections: 86170→86180, 89400→90200, 86150→86160, 88600→89400, 91000→86200, 86130→86140, 86100→86120, 86120→86130, 87800→88600, 86180→86200, 86140→86150, 86100→87800, 86160→86170, 90200→91000. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 86100 to 86200? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0140,misleading_representation-019,misleading_representation,"Station identifiers: 21000, 21100, 22700, 23500, 24300, 25100, 25900, 21020, 21030, 21040, 21050, 21060, 21070, 21080. Directed connections: 21040→21050, 21000→22700, 22700→23500, 21070→21080, 21020→21030, 21080→21100, 21060→21070, 23500→24300, 25100→25900, 21030→21040, 25900→21100, 21050→21060, 24300→25100, 21000→21020. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 21000 to 21100? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0141,misleading_representation-020,misleading_representation,"Station identifiers: 183700, 183800, 185400, 183720, 183730, 183740. Directed connections: 185400→183800, 183720→183730, 183700→185400, 183740→183800, 183730→183740, 183700→183720. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 183700 to 183800? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0142,misleading_representation-020,misleading_representation,"Station identifiers: 171600, 171700, 173300, 171620, 171630, 171640. Directed connections: 171620→171630, 171630→171640, 171640→171700, 171600→173300, 173300→171700, 171600→171620. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 171600 to 171700? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0143,misleading_representation-021,misleading_representation,"Station identifiers: 52200, 52300, 53900, 54700, 52220, 52230, 52240, 52250. Directed connections: 52240→52250, 52220→52230, 52230→52240, 52250→52300, 52200→52220, 52200→53900, 54700→52300, 53900→54700. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 52200 to 52300? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0144,misleading_representation-021,misleading_representation,"Station identifiers: 27900, 28000, 29600, 30400, 27920, 27930, 27940, 27950. Directed connections: 27920→27930, 27930→27940, 30400→28000, 27900→27920, 27950→28000, 29600→30400, 27900→29600, 27940→27950. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 27900 to 28000? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0145,misleading_representation-022,misleading_representation,"Station identifiers: 180900, 181000, 182600, 183400, 184200, 180920, 180930, 180940, 180950, 180960. Directed connections: 180930→180940, 180960→181000, 180900→182600, 180900→180920, 182600→183400, 183400→184200, 180940→180950, 184200→181000, 180950→180960, 180920→180930. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 180900 to 181000? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0146,misleading_representation-022,misleading_representation,"Station identifiers: 189900, 190000, 191600, 192400, 193200, 189920, 189930, 189940, 189950, 189960. Directed connections: 189900→191600, 193200→190000, 191600→192400, 189940→189950, 189900→189920, 189950→189960, 192400→193200, 189960→190000, 189930→189940, 189920→189930. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 189900 to 190000? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0147,misleading_representation-023,misleading_representation,"Station identifiers: 131400, 131500, 133100, 133900, 134700, 135500, 131420, 131430, 131440, 131450, 131460, 131470. Directed connections: 135500→131500, 131400→131420, 133900→134700, 131440→131450, 133100→133900, 131420→131430, 131470→131500, 131400→133100, 131430→131440, 131460→131470, 131450→131460, 134700→135500. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 131400 to 131500? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0148,misleading_representation-023,misleading_representation,"Station identifiers: 103200, 103300, 104900, 105700, 106500, 107300, 103220, 103230, 103240, 103250, 103260, 103270. Directed connections: 103250→103260, 103200→103220, 103270→103300, 104900→105700, 103200→104900, 103220→103230, 103260→103270, 103240→103250, 107300→103300, 103230→103240, 106500→107300, 105700→106500. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 103200 to 103300? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0149,misleading_representation-024,misleading_representation,"Station identifiers: 65900, 66000, 67600, 68400, 69200, 70000, 70800, 65920, 65930, 65940, 65950, 65960, 65970, 65980. Directed connections: 65980→66000, 65920→65930, 69200→70000, 67600→68400, 65950→65960, 65930→65940, 68400→69200, 65970→65980, 65900→65920, 70000→70800, 70800→66000, 65940→65950, 65960→65970, 65900→67600. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 65900 to 66000? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0150,misleading_representation-024,misleading_representation,"Station identifiers: 179900, 180000, 181600, 182400, 183200, 184000, 184800, 179920, 179930, 179940, 179950, 179960, 179970, 179980. Directed connections: 179900→181600, 179930→179940, 179940→179950, 179980→180000, 179900→179920, 182400→183200, 184800→180000, 179960→179970, 179970→179980, 179920→179930, 184000→184800, 181600→182400, 179950→179960, 183200→184000. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 179900 to 180000? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0151,misleading_representation-025,misleading_representation,"Station identifiers: 13600, 13700, 15300, 13620, 13630, 13640. Directed connections: 13640→13700, 13620→13630, 13630→13640, 13600→13620, 13600→15300, 15300→13700. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 13600 to 13700? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0152,misleading_representation-025,misleading_representation,"Station identifiers: 195600, 195700, 197300, 195620, 195630, 195640. Directed connections: 195600→197300, 195600→195620, 197300→195700, 195630→195640, 195620→195630, 195640→195700. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 195600 to 195700? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0153,misleading_representation-026,misleading_representation,"Station identifiers: 139300, 139400, 141000, 141800, 139320, 139330, 139340, 139350. Directed connections: 139300→141000, 141000→141800, 139300→139320, 139320→139330, 139350→139400, 141800→139400, 139340→139350, 139330→139340. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 139300 to 139400? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0154,misleading_representation-026,misleading_representation,"Station identifiers: 42500, 42600, 44200, 45000, 42520, 42530, 42540, 42550. Directed connections: 42500→44200, 42500→42520, 42520→42530, 42530→42540, 45000→42600, 42550→42600, 44200→45000, 42540→42550. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 42500 to 42600? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0155,misleading_representation-027,misleading_representation,"Station identifiers: 128700, 128800, 130400, 131200, 132000, 128720, 128730, 128740, 128750, 128760. Directed connections: 130400→131200, 128700→128720, 132000→128800, 128730→128740, 131200→132000, 128700→130400, 128760→128800, 128750→128760, 128720→128730, 128740→128750. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 128700 to 128800? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0156,misleading_representation-027,misleading_representation,"Station identifiers: 174100, 174200, 175800, 176600, 177400, 174120, 174130, 174140, 174150, 174160. Directed connections: 176600→177400, 174100→175800, 174120→174130, 175800→176600, 174130→174140, 174100→174120, 177400→174200, 174160→174200, 174150→174160, 174140→174150. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 174100 to 174200? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0157,misleading_representation-028,misleading_representation,"Station identifiers: 109100, 109200, 110800, 111600, 112400, 113200, 109120, 109130, 109140, 109150, 109160, 109170. Directed connections: 113200→109200, 109140→109150, 109150→109160, 109130→109140, 112400→113200, 109100→109120, 109170→109200, 109100→110800, 111600→112400, 110800��111600, 109120→109130, 109160→109170. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 109100 to 109200? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0158,misleading_representation-028,misleading_representation,"Station identifiers: 78000, 78100, 79700, 80500, 81300, 82100, 78020, 78030, 78040, 78050, 78060, 78070. Directed connections: 78000→79700, 81300→82100, 78060→78070, 78030→78040, 78070→78100, 82100→78100, 79700→80500, 78000→78020, 78040→78050, 80500→81300, 78050→78060, 78020→78030. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 78000 to 78100? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0159,misleading_representation-029,misleading_representation,"Station identifiers: 166500, 166600, 168200, 169000, 169800, 170600, 171400, 166520, 166530, 166540, 166550, 166560, 166570, 166580. Directed connections: 166580→166600, 166500→166520, 166500→168200, 168200→169000, 166570→166580, 169000→169800, 166560→166570, 171400→166600, 166520→166530, 170600→171400, 166530→166540, 169800→170600, 166540→166550, 166550→166560. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 166500 to 166600? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0160,misleading_representation-029,misleading_representation,"Station identifiers: 31700, 31800, 33400, 34200, 35000, 35800, 36600, 31720, 31730, 31740, 31750, 31760, 31770, 31780. Directed connections: 31740→31750, 31700→31720, 36600→31800, 31730→31740, 34200→35000, 31760→31770, 31750→31760, 35000→35800, 31700→33400, 31770→31780, 35800→36600, 31780→31800, 31720→31730, 33400→34200. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 31700 to 31800? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0161,misleading_representation-030,misleading_representation,"Station identifiers: 122400, 122500, 124100, 122420, 122430, 122440. Directed connections: 122430→122440, 122400→122420, 122440→122500, 122400→124100, 124100→122500, 122420→122430. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 122400 to 122500? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0162,misleading_representation-030,misleading_representation,"Station identifiers: 153200, 153300, 154900, 153220, 153230, 153240. Directed connections: 153200→154900, 154900→153300, 153240→153300, 153200→153220, 153230→153240, 153220→153230. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 153200 to 153300? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0163,misleading_representation-031,misleading_representation,"Station identifiers: 152600, 152700, 154300, 155100, 152620, 152630, 152640, 152650. Directed connections: 154300→155100, 152650→152700, 152600→152620, 152630→152640, 152640→152650, 152600→154300, 152620→152630, 155100→152700. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 152600 to 152700? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0164,misleading_representation-031,misleading_representation,"Station identifiers: 167300, 167400, 169000, 169800, 167320, 167330, 167340, 167350. Directed connections: 169000→169800, 167340→167350, 167330→167340, 169800→167400, 167300→167320, 167300→169000, 167320→167330, 167350→167400. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 167300 to 167400? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0165,misleading_representation-032,misleading_representation,"Station identifiers: 132300, 132400, 134000, 134800, 135600, 132320, 132330, 132340, 132350, 132360. Directed connections: 132330→132340, 132340→132350, 132320→132330, 132300→134000, 132360→132400, 134000→134800, 135600→132400, 132300→132320, 132350→132360, 134800→135600. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 132300 to 132400? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0166,misleading_representation-032,misleading_representation,"Station identifiers: 122600, 122700, 124300, 125100, 125900, 122620, 122630, 122640, 122650, 122660. Directed connections: 125900→122700, 122620→122630, 125100→125900, 124300→125100, 122660→122700, 122640→122650, 122600→124300, 122600→122620, 122650→122660, 122630→122640. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 122600 to 122700? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0167,misleading_representation-033,misleading_representation,"Station identifiers: 54900, 55000, 56600, 57400, 58200, 59000, 54920, 54930, 54940, 54950, 54960, 54970. Directed connections: 54950→54960, 54920→54930, 54900→54920, 54940→54950, 57400→58200, 54960→54970, 54930→54940, 54970→55000, 58200→59000, 59000→55000, 54900→56600, 56600→57400. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 54900 to 55000? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0168,misleading_representation-033,misleading_representation,"Station identifiers: 118800, 118900, 120500, 121300, 122100, 122900, 118820, 118830, 118840, 118850, 118860, 118870. Directed connections: 122100→122900, 118870→118900, 122900→118900, 118800→118820, 118840→118850, 118860→118870, 118820→118830, 118800→120500, 118830→118840, 121300→122100, 118850→118860, 120500→121300. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 118800 to 118900? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0169,misleading_representation-034,misleading_representation,"Station identifiers: 40000, 40100, 41700, 42500, 43300, 44100, 44900, 40020, 40030, 40040, 40050, 40060, 40070, 40080. Directed connections: 40030→40040, 40000→41700, 40080→40100, 40020→40030, 44100→44900, 44900→40100, 41700→42500, 40060→40070, 40050→40060, 43300→44100, 40000→40020, 42500→43300, 40070→40080, 40040→40050. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 40000 to 40100? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0170,misleading_representation-034,misleading_representation,"Station identifiers: 73000, 73100, 74700, 75500, 76300, 77100, 77900, 73020, 73030, 73040, 73050, 73060, 73070, 73080. Directed connections: 73020→73030, 77100→77900, 74700→75500, 76300→77100, 73060→73070, 73040→73050, 77900→73100, 73000→73020, 73030→73040, 73050→73060, 73080→73100, 75500→76300, 73070→73080, 73000→74700. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 73000 to 73100? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0171,misleading_representation-035,misleading_representation,"Station identifiers: 44000, 44100, 45700, 44020, 44030, 44040. Directed connections: 45700→44100, 44020→44030, 44000→44020, 44040→44100, 44000→45700, 44030→44040. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 44000 to 44100? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0172,misleading_representation-035,misleading_representation,"Station identifiers: 130300, 130400, 132000, 130320, 130330, 130340. Directed connections: 132000→130400, 130300→130320, 130340→130400, 130330→130340, 130300→132000, 130320→130330. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 130300 to 130400? Respond with an integer.",2,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 7, ""edges"": 6, ""answer_type"": ""integer"", ""canonical_distance"": 2, ""decoy_numeric_cost"": true}" +AF-APER-02-0173,misleading_representation-036,misleading_representation,"Station identifiers: 42000, 42100, 43700, 44500, 42020, 42030, 42040, 42050. Directed connections: 42040→42050, 44500→42100, 42000→43700, 42000→42020, 43700→44500, 42030→42040, 42050→42100, 42020→42030. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 42000 to 42100? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0174,misleading_representation-036,misleading_representation,"Station identifiers: 143200, 143300, 144900, 145700, 143220, 143230, 143240, 143250. Directed connections: 145700→143300, 143240→143250, 143200→144900, 144900→145700, 143220→143230, 143200→143220, 143230→143240, 143250→143300. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 143200 to 143300? Respond with an integer.",3,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 9, ""edges"": 8, ""answer_type"": ""integer"", ""canonical_distance"": 3, ""decoy_numeric_cost"": true}" +AF-APER-02-0175,misleading_representation-037,misleading_representation,"Station identifiers: 142900, 143000, 144600, 145400, 146200, 142920, 142930, 142940, 142950, 142960. Directed connections: 142940→142950, 142950→142960, 142900→144600, 146200→143000, 145400→146200, 144600→145400, 142930→142940, 142920→142930, 142960→143000, 142900→142920. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 142900 to 143000? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0176,misleading_representation-037,misleading_representation,"Station identifiers: 71300, 71400, 73000, 73800, 74600, 71320, 71330, 71340, 71350, 71360. Directed connections: 73800→74600, 73000→73800, 71340→71350, 71300→73000, 71330→71340, 74600→71400, 71300→71320, 71320→71330, 71350→71360, 71360→71400. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 71300 to 71400? Respond with an integer.",4,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 11, ""edges"": 10, ""answer_type"": ""integer"", ""canonical_distance"": 4, ""decoy_numeric_cost"": true}" +AF-APER-02-0177,misleading_representation-038,misleading_representation,"Station identifiers: 45900, 46000, 47600, 48400, 49200, 50000, 45920, 45930, 45940, 45950, 45960, 45970. Directed connections: 49200→50000, 48400→49200, 45900→47600, 45900→45920, 45930→45940, 45940→45950, 47600→48400, 45950→45960, 45960→45970, 50000→46000, 45920→45930, 45970→46000. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 45900 to 46000? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0178,misleading_representation-038,misleading_representation,"Station identifiers: 54500, 54600, 56200, 57000, 57800, 58600, 54520, 54530, 54540, 54550, 54560, 54570. Directed connections: 57000→57800, 58600→54600, 54500→56200, 54530→54540, 57800→58600, 54570→54600, 54500→54520, 54550→54560, 54540→54550, 54520→54530, 54560→54570, 56200→57000. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 54500 to 54600? Respond with an integer.",5,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 13, ""edges"": 12, ""answer_type"": ""integer"", ""canonical_distance"": 5, ""decoy_numeric_cost"": true}" +AF-APER-02-0179,misleading_representation-039,misleading_representation,"Station identifiers: 138800, 138900, 140500, 141300, 142100, 142900, 143700, 138820, 138830, 138840, 138850, 138860, 138870, 138880. Directed connections: 138860→138870, 141300→142100, 138800→140500, 138820→138830, 142100→142900, 138840→138850, 138830→138840, 138870→138880, 140500→141300, 143700→138900, 138800→138820, 138850→138860, 142900→143700, 138880→138900. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 138800 to 138900? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0180,misleading_representation-039,misleading_representation,"Station identifiers: 49300, 49400, 51000, 51800, 52600, 53400, 54200, 49320, 49330, 49340, 49350, 49360, 49370, 49380. Directed connections: 53400→54200, 51800→52600, 49300→49320, 51000→51800, 49330→49340, 49350→49360, 49320→49330, 49340→49350, 52600→53400, 49380→49400, 49300→51000, 49370→49380, 54200→49400, 49360→49370. A prior routing system minimized numerical differences between station identifiers. That rule is invalid: every directed connection costs one hop. What is the minimum hop count from 49300 to 49400? Respond with an integer.",6,Shortest directed path under relabeling,Misleading numerical identifiers and obsolete cost heuristic,Exact integer,"{""nodes"": 15, ""edges"": 14, ""answer_type"": ""integer"", ""canonical_distance"": 6, ""decoy_numeric_cost"": true}" +AF-APER-02-0201,constraint_obstruction-000,constraint_obstruction,Choose the cheapest feasible provider. Options: V costs 88 and supports 16 units; D costs 19 and supports 4 units; X costs 46 and supports 10 units; E costs 32 and supports 7 units; K costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,E,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 10, 7, 13], ""costs"": [88, 19, 46, 32, 63], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""D"", ""revised_winner"": ""E"", ""largest_capacity_label"": ""V""}" +AF-APER-02-0202,constraint_obstruction-000,constraint_obstruction,Choose the cheapest feasible provider. Options: G costs 32 and supports 7 units; Z costs 46 and supports 10 units; S costs 88 and supports 16 units; L costs 63 and supports 13 units; U costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 10, 16, 13, 4], ""costs"": [32, 46, 88, 63, 19], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""U"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""S""}" +AF-APER-02-0203,constraint_obstruction-001,constraint_obstruction,Choose the cheapest feasible provider. Options: N costs 46 and supports 10 units; W costs 19 and supports 4 units; Z costs 63 and supports 13 units; P costs 88 and supports 16 units; B costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 4, 13, 16, 7], ""costs"": [46, 19, 63, 88, 32], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""W"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""P""}" +AF-APER-02-0204,constraint_obstruction-001,constraint_obstruction,Choose the cheapest feasible provider. Options: D costs 63 and supports 13 units; B costs 19 and supports 4 units; G costs 32 and supports 7 units; N costs 88 and supports 16 units; E costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,N,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 4, 7, 16, 10], ""costs"": [63, 19, 32, 88, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""B"", ""revised_winner"": ""N"", ""largest_capacity_label"": ""N""}" +AF-APER-02-0205,constraint_obstruction-002,constraint_obstruction,Choose the cheapest feasible provider. Options: G costs 88 and supports 16 units; X costs 46 and supports 10 units; E costs 63 and supports 13 units; H costs 32 and supports 7 units; V costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,H,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 10, 13, 7, 4], ""costs"": [88, 46, 63, 32, 19], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""V"", ""revised_winner"": ""H"", ""largest_capacity_label"": ""G""}" +AF-APER-02-0206,constraint_obstruction-002,constraint_obstruction,Choose the cheapest feasible provider. Options: K costs 88 and supports 16 units; B costs 46 and supports 10 units; R costs 63 and supports 13 units; Y costs 19 and supports 4 units; F costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,B,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 10, 13, 4, 7], ""costs"": [88, 46, 63, 19, 32], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""Y"", ""revised_winner"": ""B"", ""largest_capacity_label"": ""K""}" +AF-APER-02-0207,constraint_obstruction-003,constraint_obstruction,Choose the cheapest feasible provider. Options: X costs 63 and supports 13 units; S costs 46 and supports 10 units; J costs 88 and supports 16 units; L costs 19 and supports 4 units; D costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,X,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 10, 16, 4, 7], ""costs"": [63, 46, 88, 19, 32], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""L"", ""revised_winner"": ""X"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0208,constraint_obstruction-003,constraint_obstruction,Choose the cheapest feasible provider. Options: P costs 63 and supports 13 units; H costs 46 and supports 10 units; W costs 88 and supports 16 units; C costs 32 and supports 7 units; K costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,W,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 10, 16, 7, 4], ""costs"": [63, 46, 88, 32, 19], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""K"", ""revised_winner"": ""W"", ""largest_capacity_label"": ""W""}" +AF-APER-02-0209,constraint_obstruction-004,constraint_obstruction,Choose the cheapest feasible provider. Options: J costs 88 and supports 16 units; K costs 32 and supports 7 units; P costs 63 and supports 13 units; L costs 19 and supports 4 units; Y costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,K,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 7, 13, 4, 10], ""costs"": [88, 32, 63, 19, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""L"", ""revised_winner"": ""K"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0210,constraint_obstruction-004,constraint_obstruction,Choose the cheapest feasible provider. Options: K costs 46 and supports 10 units; V costs 19 and supports 4 units; J costs 88 and supports 16 units; P costs 32 and supports 7 units; U costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,K,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 4, 16, 7, 13], ""costs"": [46, 19, 88, 32, 63], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""V"", ""revised_winner"": ""K"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0211,constraint_obstruction-005,constraint_obstruction,Choose the cheapest feasible provider. Options: N costs 63 and supports 13 units; F costs 32 and supports 7 units; M costs 19 and supports 4 units; T costs 46 and supports 10 units; D costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,N,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 7, 4, 10, 16], ""costs"": [63, 32, 19, 46, 88], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""M"", ""revised_winner"": ""N"", ""largest_capacity_label"": ""D""}" +AF-APER-02-0212,constraint_obstruction-005,constraint_obstruction,Choose the cheapest feasible provider. Options: T costs 88 and supports 16 units; C costs 63 and supports 13 units; U costs 32 and supports 7 units; W costs 46 and supports 10 units; B costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,T,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 7, 10, 4], ""costs"": [88, 63, 32, 46, 19], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""B"", ""revised_winner"": ""T"", ""largest_capacity_label"": ""T""}" +AF-APER-02-0213,constraint_obstruction-006,constraint_obstruction,Choose the cheapest feasible provider. Options: Y costs 63 and supports 13 units; V costs 32 and supports 7 units; S costs 88 and supports 16 units; G costs 19 and supports 4 units; N costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,V,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 7, 16, 4, 10], ""costs"": [63, 32, 88, 19, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""G"", ""revised_winner"": ""V"", ""largest_capacity_label"": ""S""}" +AF-APER-02-0214,constraint_obstruction-006,constraint_obstruction,Choose the cheapest feasible provider. Options: G costs 88 and supports 16 units; T costs 46 and supports 10 units; Y costs 32 and supports 7 units; F costs 63 and supports 13 units; U costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,T,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 10, 7, 13, 4], ""costs"": [88, 46, 32, 63, 19], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""U"", ""revised_winner"": ""T"", ""largest_capacity_label"": ""G""}" +AF-APER-02-0215,constraint_obstruction-007,constraint_obstruction,Choose the cheapest feasible provider. Options: A costs 88 and supports 16 units; L costs 32 and supports 7 units; U costs 46 and supports 10 units; J costs 63 and supports 13 units; S costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,J,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 7, 10, 13, 4], ""costs"": [88, 32, 46, 63, 19], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""S"", ""revised_winner"": ""J"", ""largest_capacity_label"": ""A""}" +AF-APER-02-0216,constraint_obstruction-007,constraint_obstruction,Choose the cheapest feasible provider. Options: W costs 19 and supports 4 units; V costs 32 and supports 7 units; J costs 88 and supports 16 units; T costs 63 and supports 13 units; N costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,J,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 7, 16, 13, 10], ""costs"": [19, 32, 88, 63, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""W"", ""revised_winner"": ""J"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0217,constraint_obstruction-008,constraint_obstruction,Choose the cheapest feasible provider. Options: N costs 46 and supports 10 units; U costs 32 and supports 7 units; J costs 88 and supports 16 units; C costs 63 and supports 13 units; Z costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,U,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 7, 16, 13, 4], ""costs"": [46, 32, 88, 63, 19], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""Z"", ""revised_winner"": ""U"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0218,constraint_obstruction-008,constraint_obstruction,Choose the cheapest feasible provider. Options: K costs 63 and supports 13 units; T costs 88 and supports 16 units; N costs 32 and supports 7 units; E costs 46 and supports 10 units; Y costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,E,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 16, 7, 10, 4], ""costs"": [63, 88, 32, 46, 19], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""Y"", ""revised_winner"": ""E"", ""largest_capacity_label"": ""T""}" +AF-APER-02-0219,constraint_obstruction-009,constraint_obstruction,Choose the cheapest feasible provider. Options: J costs 32 and supports 7 units; V costs 63 and supports 13 units; L costs 19 and supports 4 units; S costs 46 and supports 10 units; P costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,V,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 13, 4, 10, 16], ""costs"": [32, 63, 19, 46, 88], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""L"", ""revised_winner"": ""V"", ""largest_capacity_label"": ""P""}" +AF-APER-02-0220,constraint_obstruction-009,constraint_obstruction,Choose the cheapest feasible provider. Options: X costs 63 and supports 13 units; T costs 88 and supports 16 units; K costs 46 and supports 10 units; D costs 19 and supports 4 units; Z costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,T,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 16, 10, 4, 7], ""costs"": [63, 88, 46, 19, 32], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""D"", ""revised_winner"": ""T"", ""largest_capacity_label"": ""T""}" +AF-APER-02-0221,constraint_obstruction-010,constraint_obstruction,Choose the cheapest feasible provider. Options: H costs 88 and supports 16 units; N costs 32 and supports 7 units; Z costs 19 and supports 4 units; J costs 63 and supports 13 units; P costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,N,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 7, 4, 13, 10], ""costs"": [88, 32, 19, 63, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""Z"", ""revised_winner"": ""N"", ""largest_capacity_label"": ""H""}" +AF-APER-02-0222,constraint_obstruction-010,constraint_obstruction,Choose the cheapest feasible provider. Options: K costs 88 and supports 16 units; X costs 63 and supports 13 units; T costs 32 and supports 7 units; C costs 19 and supports 4 units; L costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,L,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 7, 4, 10], ""costs"": [88, 63, 32, 19, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""C"", ""revised_winner"": ""L"", ""largest_capacity_label"": ""K""}" +AF-APER-02-0223,constraint_obstruction-011,constraint_obstruction,Choose the cheapest feasible provider. Options: T costs 32 and supports 7 units; D costs 63 and supports 13 units; Y costs 88 and supports 16 units; W costs 46 and supports 10 units; J costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,D,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 13, 16, 10, 4], ""costs"": [32, 63, 88, 46, 19], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""J"", ""revised_winner"": ""D"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0224,constraint_obstruction-011,constraint_obstruction,Choose the cheapest feasible provider. Options: J costs 63 and supports 13 units; P costs 46 and supports 10 units; E costs 32 and supports 7 units; M costs 19 and supports 4 units; U costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,U,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 10, 7, 4, 16], ""costs"": [63, 46, 32, 19, 88], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""M"", ""revised_winner"": ""U"", ""largest_capacity_label"": ""U""}" +AF-APER-02-0225,constraint_obstruction-012,constraint_obstruction,Choose the cheapest feasible provider. Options: J costs 46 and supports 10 units; K costs 63 and supports 13 units; W costs 88 and supports 16 units; R costs 19 and supports 4 units; H costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,H,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 13, 16, 4, 7], ""costs"": [46, 63, 88, 19, 32], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""R"", ""revised_winner"": ""H"", ""largest_capacity_label"": ""W""}" +AF-APER-02-0226,constraint_obstruction-012,constraint_obstruction,Choose the cheapest feasible provider. Options: M costs 63 and supports 13 units; Q costs 19 and supports 4 units; J costs 46 and supports 10 units; P costs 32 and supports 7 units; V costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,J,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 4, 10, 7, 16], ""costs"": [63, 19, 46, 32, 88], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""Q"", ""revised_winner"": ""J"", ""largest_capacity_label"": ""V""}" +AF-APER-02-0227,constraint_obstruction-013,constraint_obstruction,Choose the cheapest feasible provider. Options: Q costs 46 and supports 10 units; M costs 19 and supports 4 units; J costs 88 and supports 16 units; R costs 32 and supports 7 units; A costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,A,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 4, 16, 7, 13], ""costs"": [46, 19, 88, 32, 63], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""M"", ""revised_winner"": ""A"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0228,constraint_obstruction-013,constraint_obstruction,Choose the cheapest feasible provider. Options: U costs 46 and supports 10 units; Y costs 88 and supports 16 units; K costs 63 and supports 13 units; D costs 32 and supports 7 units; L costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Y,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 16, 13, 7, 4], ""costs"": [46, 88, 63, 32, 19], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""L"", ""revised_winner"": ""Y"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0229,constraint_obstruction-014,constraint_obstruction,Choose the cheapest feasible provider. Options: R costs 19 and supports 4 units; M costs 46 and supports 10 units; A costs 63 and supports 13 units; L costs 32 and supports 7 units; H costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,L,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 10, 13, 7, 16], ""costs"": [19, 46, 63, 32, 88], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""R"", ""revised_winner"": ""L"", ""largest_capacity_label"": ""H""}" +AF-APER-02-0230,constraint_obstruction-014,constraint_obstruction,Choose the cheapest feasible provider. Options: D costs 46 and supports 10 units; B costs 63 and supports 13 units; Y costs 32 and supports 7 units; S costs 88 and supports 16 units; P costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,D,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 13, 7, 16, 4], ""costs"": [46, 63, 32, 88, 19], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""P"", ""revised_winner"": ""D"", ""largest_capacity_label"": ""S""}" +AF-APER-02-0231,constraint_obstruction-015,constraint_obstruction,Choose the cheapest feasible provider. Options: E costs 88 and supports 16 units; T costs 46 and supports 10 units; P costs 32 and supports 7 units; Y costs 63 and supports 13 units; S costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Y,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 10, 7, 13, 4], ""costs"": [88, 46, 32, 63, 19], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""S"", ""revised_winner"": ""Y"", ""largest_capacity_label"": ""E""}" +AF-APER-02-0232,constraint_obstruction-015,constraint_obstruction,Choose the cheapest feasible provider. Options: S costs 46 and supports 10 units; T costs 32 and supports 7 units; J costs 19 and supports 4 units; E costs 88 and supports 16 units; W costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,E,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 7, 4, 16, 13], ""costs"": [46, 32, 19, 88, 63], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""J"", ""revised_winner"": ""E"", ""largest_capacity_label"": ""E""}" +AF-APER-02-0233,constraint_obstruction-016,constraint_obstruction,Choose the cheapest feasible provider. Options: D costs 46 and supports 10 units; F costs 63 and supports 13 units; A costs 32 and supports 7 units; E costs 19 and supports 4 units; V costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,A,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 13, 7, 4, 16], ""costs"": [46, 63, 32, 19, 88], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""E"", ""revised_winner"": ""A"", ""largest_capacity_label"": ""V""}" +AF-APER-02-0234,constraint_obstruction-016,constraint_obstruction,Choose the cheapest feasible provider. Options: P costs 32 and supports 7 units; D costs 88 and supports 16 units; E costs 63 and supports 13 units; Z costs 19 and supports 4 units; G costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,G,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 16, 13, 4, 10], ""costs"": [32, 88, 63, 19, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""Z"", ""revised_winner"": ""G"", ""largest_capacity_label"": ""D""}" +AF-APER-02-0235,constraint_obstruction-017,constraint_obstruction,Choose the cheapest feasible provider. Options: Y costs 88 and supports 16 units; A costs 19 and supports 4 units; K costs 32 and supports 7 units; Z costs 63 and supports 13 units; B costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 7, 13, 10], ""costs"": [88, 19, 32, 63, 46], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""A"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0236,constraint_obstruction-017,constraint_obstruction,Choose the cheapest feasible provider. Options: C costs 19 and supports 4 units; B costs 32 and supports 7 units; Y costs 46 and supports 10 units; P costs 88 and supports 16 units; A costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,P,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 7, 10, 16, 13], ""costs"": [19, 32, 46, 88, 63], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""C"", ""revised_winner"": ""P"", ""largest_capacity_label"": ""P""}" +AF-APER-02-0237,constraint_obstruction-018,constraint_obstruction,Choose the cheapest feasible provider. Options: Z costs 88 and supports 16 units; V costs 63 and supports 13 units; G costs 46 and supports 10 units; A costs 19 and supports 4 units; C costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,C,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 10, 4, 7], ""costs"": [88, 63, 46, 19, 32], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""A"", ""revised_winner"": ""C"", ""largest_capacity_label"": ""Z""}" +AF-APER-02-0238,constraint_obstruction-018,constraint_obstruction,Choose the cheapest feasible provider. Options: E costs 19 and supports 4 units; Z costs 32 and supports 7 units; V costs 88 and supports 16 units; C costs 63 and supports 13 units; Q costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Q,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 7, 16, 13, 10], ""costs"": [19, 32, 88, 63, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""E"", ""revised_winner"": ""Q"", ""largest_capacity_label"": ""V""}" +AF-APER-02-0239,constraint_obstruction-019,constraint_obstruction,Choose the cheapest feasible provider. Options: T costs 46 and supports 10 units; E costs 19 and supports 4 units; H costs 88 and supports 16 units; W costs 32 and supports 7 units; F costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,F,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 4, 16, 7, 13], ""costs"": [46, 19, 88, 32, 63], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""E"", ""revised_winner"": ""F"", ""largest_capacity_label"": ""H""}" +AF-APER-02-0240,constraint_obstruction-019,constraint_obstruction,Choose the cheapest feasible provider. Options: T costs 63 and supports 13 units; J costs 32 and supports 7 units; L costs 88 and supports 16 units; Q costs 19 and supports 4 units; X costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,L,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 7, 16, 4, 10], ""costs"": [63, 32, 88, 19, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""Q"", ""revised_winner"": ""L"", ""largest_capacity_label"": ""L""}" +AF-APER-02-0241,constraint_obstruction-020,constraint_obstruction,Choose the cheapest feasible provider. Options: Q costs 63 and supports 13 units; D costs 46 and supports 10 units; S costs 19 and supports 4 units; E costs 88 and supports 16 units; X costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,X,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 10, 4, 16, 7], ""costs"": [63, 46, 19, 88, 32], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""S"", ""revised_winner"": ""X"", ""largest_capacity_label"": ""E""}" +AF-APER-02-0242,constraint_obstruction-020,constraint_obstruction,Choose the cheapest feasible provider. Options: V costs 46 and supports 10 units; A costs 63 and supports 13 units; B costs 32 and supports 7 units; Q costs 19 and supports 4 units; X costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,V,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 13, 7, 4, 16], ""costs"": [46, 63, 32, 19, 88], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""Q"", ""revised_winner"": ""V"", ""largest_capacity_label"": ""X""}" +AF-APER-02-0243,constraint_obstruction-021,constraint_obstruction,Choose the cheapest feasible provider. Options: Z costs 46 and supports 10 units; M costs 63 and supports 13 units; J costs 88 and supports 16 units; T costs 19 and supports 4 units; W costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,M,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 13, 16, 4, 7], ""costs"": [46, 63, 88, 19, 32], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""T"", ""revised_winner"": ""M"", ""largest_capacity_label"": ""J""}" +AF-APER-02-0244,constraint_obstruction-021,constraint_obstruction,Choose the cheapest feasible provider. Options: T costs 32 and supports 7 units; W costs 88 and supports 16 units; J costs 19 and supports 4 units; E costs 63 and supports 13 units; V costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,W,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 16, 4, 13, 10], ""costs"": [32, 88, 19, 63, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""J"", ""revised_winner"": ""W"", ""largest_capacity_label"": ""W""}" +AF-APER-02-0245,constraint_obstruction-022,constraint_obstruction,Choose the cheapest feasible provider. Options: V costs 46 and supports 10 units; H costs 19 and supports 4 units; T costs 63 and supports 13 units; Q costs 88 and supports 16 units; U costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,U,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 4, 13, 16, 7], ""costs"": [46, 19, 63, 88, 32], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""H"", ""revised_winner"": ""U"", ""largest_capacity_label"": ""Q""}" +AF-APER-02-0246,constraint_obstruction-022,constraint_obstruction,Choose the cheapest feasible provider. Options: C costs 88 and supports 16 units; S costs 32 and supports 7 units; B costs 63 and supports 13 units; Q costs 19 and supports 4 units; L costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,L,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 7, 13, 4, 10], ""costs"": [88, 32, 63, 19, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""Q"", ""revised_winner"": ""L"", ""largest_capacity_label"": ""C""}" +AF-APER-02-0247,constraint_obstruction-023,constraint_obstruction,Choose the cheapest feasible provider. Options: D costs 19 and supports 4 units; Y costs 88 and supports 16 units; F costs 46 and supports 10 units; T costs 63 and supports 13 units; J costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,T,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 16, 10, 13, 7], ""costs"": [19, 88, 46, 63, 32], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""D"", ""revised_winner"": ""T"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0248,constraint_obstruction-023,constraint_obstruction,Choose the cheapest feasible provider. Options: Z costs 88 and supports 16 units; M costs 19 and supports 4 units; S costs 46 and supports 10 units; V costs 63 and supports 13 units; H costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 10, 13, 7], ""costs"": [88, 19, 46, 63, 32], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""M"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""Z""}" +AF-APER-02-0249,constraint_obstruction-024,constraint_obstruction,Choose the cheapest feasible provider. Options: Y costs 88 and supports 16 units; G costs 63 and supports 13 units; X costs 19 and supports 4 units; D costs 32 and supports 7 units; F costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,D,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 4, 7, 10], ""costs"": [88, 63, 19, 32, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""X"", ""revised_winner"": ""D"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0250,constraint_obstruction-024,constraint_obstruction,Choose the cheapest feasible provider. Options: K costs 19 and supports 4 units; H costs 63 and supports 13 units; A costs 32 and supports 7 units; M costs 88 and supports 16 units; B costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,B,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 13, 7, 16, 10], ""costs"": [19, 63, 32, 88, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""K"", ""revised_winner"": ""B"", ""largest_capacity_label"": ""M""}" +AF-APER-02-0251,constraint_obstruction-025,constraint_obstruction,Choose the cheapest feasible provider. Options: W costs 19 and supports 4 units; E costs 63 and supports 13 units; V costs 88 and supports 16 units; G costs 46 and supports 10 units; D costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,E,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 13, 16, 10, 7], ""costs"": [19, 63, 88, 46, 32], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""W"", ""revised_winner"": ""E"", ""largest_capacity_label"": ""V""}" +AF-APER-02-0252,constraint_obstruction-025,constraint_obstruction,Choose the cheapest feasible provider. Options: A costs 88 and supports 16 units; L costs 19 and supports 4 units; B costs 46 and supports 10 units; H costs 63 and supports 13 units; Q costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,A,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 10, 13, 7], ""costs"": [88, 19, 46, 63, 32], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""L"", ""revised_winner"": ""A"", ""largest_capacity_label"": ""A""}" +AF-APER-02-0253,constraint_obstruction-026,constraint_obstruction,Choose the cheapest feasible provider. Options: X costs 88 and supports 16 units; M costs 63 and supports 13 units; D costs 32 and supports 7 units; P costs 19 and supports 4 units; K costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,D,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 7, 4, 10], ""costs"": [88, 63, 32, 19, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""P"", ""revised_winner"": ""D"", ""largest_capacity_label"": ""X""}" +AF-APER-02-0254,constraint_obstruction-026,constraint_obstruction,Choose the cheapest feasible provider. Options: Q costs 88 and supports 16 units; V costs 19 and supports 4 units; U costs 32 and supports 7 units; Y costs 63 and supports 13 units; L costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,L,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 7, 13, 10], ""costs"": [88, 19, 32, 63, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""V"", ""revised_winner"": ""L"", ""largest_capacity_label"": ""Q""}" +AF-APER-02-0255,constraint_obstruction-027,constraint_obstruction,Choose the cheapest feasible provider. Options: L costs 32 and supports 7 units; E costs 46 and supports 10 units; T costs 63 and supports 13 units; P costs 88 and supports 16 units; S costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,T,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 10, 13, 16, 4], ""costs"": [32, 46, 63, 88, 19], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""S"", ""revised_winner"": ""T"", ""largest_capacity_label"": ""P""}" +AF-APER-02-0256,constraint_obstruction-027,constraint_obstruction,Choose the cheapest feasible provider. Options: X costs 32 and supports 7 units; V costs 19 and supports 4 units; H costs 63 and supports 13 units; Z costs 46 and supports 10 units; W costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,W,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 4, 13, 10, 16], ""costs"": [32, 19, 63, 46, 88], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""V"", ""revised_winner"": ""W"", ""largest_capacity_label"": ""W""}" +AF-APER-02-0257,constraint_obstruction-028,constraint_obstruction,Choose the cheapest feasible provider. Options: Y costs 88 and supports 16 units; P costs 63 and supports 13 units; J costs 32 and supports 7 units; X costs 46 and supports 10 units; E costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,J,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 7, 10, 4], ""costs"": [88, 63, 32, 46, 19], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""E"", ""revised_winner"": ""J"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0258,constraint_obstruction-028,constraint_obstruction,Choose the cheapest feasible provider. Options: J costs 32 and supports 7 units; N costs 88 and supports 16 units; C costs 19 and supports 4 units; Z costs 63 and supports 13 units; A costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,A,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 16, 4, 13, 10], ""costs"": [32, 88, 19, 63, 46], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""C"", ""revised_winner"": ""A"", ""largest_capacity_label"": ""N""}" +AF-APER-02-0259,constraint_obstruction-029,constraint_obstruction,Choose the cheapest feasible provider. Options: U costs 32 and supports 7 units; H costs 46 and supports 10 units; B costs 19 and supports 4 units; Z costs 63 and supports 13 units; X costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 10, 4, 13, 16], ""costs"": [32, 46, 19, 63, 88], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""B"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""X""}" +AF-APER-02-0260,constraint_obstruction-029,constraint_obstruction,Choose the cheapest feasible provider. Options: F costs 19 and supports 4 units; R costs 88 and supports 16 units; Z costs 63 and supports 13 units; C costs 32 and supports 7 units; U costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,R,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 16, 13, 7, 10], ""costs"": [19, 88, 63, 32, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""F"", ""revised_winner"": ""R"", ""largest_capacity_label"": ""R""}" +AF-APER-02-0261,constraint_obstruction-030,constraint_obstruction,Choose the cheapest feasible provider. Options: D costs 63 and supports 13 units; R costs 46 and supports 10 units; Q costs 32 and supports 7 units; M costs 19 and supports 4 units; N costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Q,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 10, 7, 4, 16], ""costs"": [63, 46, 32, 19, 88], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""M"", ""revised_winner"": ""Q"", ""largest_capacity_label"": ""N""}" +AF-APER-02-0262,constraint_obstruction-030,constraint_obstruction,Choose the cheapest feasible provider. Options: K costs 32 and supports 7 units; J costs 63 and supports 13 units; H costs 19 and supports 4 units; U costs 46 and supports 10 units; D costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,U,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 13, 4, 10, 16], ""costs"": [32, 63, 19, 46, 88], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""H"", ""revised_winner"": ""U"", ""largest_capacity_label"": ""D""}" +AF-APER-02-0263,constraint_obstruction-031,constraint_obstruction,Choose the cheapest feasible provider. Options: M costs 63 and supports 13 units; F costs 19 and supports 4 units; G costs 88 and supports 16 units; Z costs 46 and supports 10 units; Q costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,M,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 4, 16, 10, 7], ""costs"": [63, 19, 88, 46, 32], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""F"", ""revised_winner"": ""M"", ""largest_capacity_label"": ""G""}" +AF-APER-02-0264,constraint_obstruction-031,constraint_obstruction,Choose the cheapest feasible provider. Options: G costs 88 and supports 16 units; J costs 63 and supports 13 units; P costs 19 and supports 4 units; K costs 32 and supports 7 units; A costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,G,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 13, 4, 7, 10], ""costs"": [88, 63, 19, 32, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""P"", ""revised_winner"": ""G"", ""largest_capacity_label"": ""G""}" +AF-APER-02-0265,constraint_obstruction-032,constraint_obstruction,Choose the cheapest feasible provider. Options: W costs 88 and supports 16 units; N costs 19 and supports 4 units; G costs 32 and supports 7 units; M costs 63 and supports 13 units; K costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,G,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 7, 13, 10], ""costs"": [88, 19, 32, 63, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""N"", ""revised_winner"": ""G"", ""largest_capacity_label"": ""W""}" +AF-APER-02-0266,constraint_obstruction-032,constraint_obstruction,Choose the cheapest feasible provider. Options: H costs 19 and supports 4 units; R costs 46 and supports 10 units; E costs 32 and supports 7 units; Y costs 63 and supports 13 units; P costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,R,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 10, 7, 13, 16], ""costs"": [19, 46, 32, 63, 88], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""H"", ""revised_winner"": ""R"", ""largest_capacity_label"": ""P""}" +AF-APER-02-0267,constraint_obstruction-033,constraint_obstruction,Choose the cheapest feasible provider. Options: R costs 32 and supports 7 units; X costs 88 and supports 16 units; E costs 19 and supports 4 units; P costs 63 and supports 13 units; S costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,P,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 16, 4, 13, 10], ""costs"": [32, 88, 19, 63, 46], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""E"", ""revised_winner"": ""P"", ""largest_capacity_label"": ""X""}" +AF-APER-02-0268,constraint_obstruction-033,constraint_obstruction,Choose the cheapest feasible provider. Options: S costs 19 and supports 4 units; X costs 32 and supports 7 units; N costs 63 and supports 13 units; Z costs 88 and supports 16 units; G costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 7, 13, 16, 10], ""costs"": [19, 32, 63, 88, 46], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""S"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""Z""}" +AF-APER-02-0269,constraint_obstruction-034,constraint_obstruction,Choose the cheapest feasible provider. Options: U costs 88 and supports 16 units; E costs 19 and supports 4 units; R costs 63 and supports 13 units; K costs 32 and supports 7 units; A costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,K,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 4, 13, 7, 10], ""costs"": [88, 19, 63, 32, 46], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""E"", ""revised_winner"": ""K"", ""largest_capacity_label"": ""U""}" +AF-APER-02-0270,constraint_obstruction-034,constraint_obstruction,Choose the cheapest feasible provider. Options: P costs 32 and supports 7 units; R costs 46 and supports 10 units; X costs 88 and supports 16 units; H costs 19 and supports 4 units; T costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,R,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [7, 10, 16, 4, 13], ""costs"": [32, 46, 88, 19, 63], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""H"", ""revised_winner"": ""R"", ""largest_capacity_label"": ""X""}" +AF-APER-02-0271,constraint_obstruction-035,constraint_obstruction,Choose the cheapest feasible provider. Options: X costs 63 and supports 13 units; F costs 19 and supports 4 units; J costs 32 and supports 7 units; P costs 88 and supports 16 units; D costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,X,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 4, 7, 16, 10], ""costs"": [63, 19, 32, 88, 46], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""F"", ""revised_winner"": ""X"", ""largest_capacity_label"": ""P""}" +AF-APER-02-0272,constraint_obstruction-035,constraint_obstruction,Choose the cheapest feasible provider. Options: M costs 88 and supports 16 units; C costs 46 and supports 10 units; S costs 63 and supports 13 units; P costs 19 and supports 4 units; A costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,M,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 10, 13, 4, 7], ""costs"": [88, 46, 63, 19, 32], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""P"", ""revised_winner"": ""M"", ""largest_capacity_label"": ""M""}" +AF-APER-02-0273,constraint_obstruction-036,constraint_obstruction,Choose the cheapest feasible provider. Options: W costs 46 and supports 10 units; M costs 32 and supports 7 units; P costs 63 and supports 13 units; K costs 19 and supports 4 units; N costs 88 and supports 16 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,M,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 7, 13, 4, 16], ""costs"": [46, 32, 63, 19, 88], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""K"", ""revised_winner"": ""M"", ""largest_capacity_label"": ""N""}" +AF-APER-02-0274,constraint_obstruction-036,constraint_obstruction,Choose the cheapest feasible provider. Options: G costs 63 and supports 13 units; K costs 19 and supports 4 units; T costs 46 and supports 10 units; U costs 88 and supports 16 units; P costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,T,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 4, 10, 16, 7], ""costs"": [63, 19, 46, 88, 32], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""K"", ""revised_winner"": ""T"", ""largest_capacity_label"": ""U""}" +AF-APER-02-0275,constraint_obstruction-037,constraint_obstruction,Choose the cheapest feasible provider. Options: Z costs 63 and supports 13 units; Q costs 88 and supports 16 units; N costs 32 and supports 7 units; P costs 19 and supports 4 units; U costs 46 and supports 10 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,Z,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 16, 7, 4, 10], ""costs"": [63, 88, 32, 19, 46], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""P"", ""revised_winner"": ""Z"", ""largest_capacity_label"": ""Q""}" +AF-APER-02-0276,constraint_obstruction-037,constraint_obstruction,Choose the cheapest feasible provider. Options: Z costs 19 and supports 4 units; M costs 88 and supports 16 units; U costs 46 and supports 10 units; K costs 32 and supports 7 units; F costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,M,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [4, 16, 10, 7, 13], ""costs"": [19, 88, 46, 32, 63], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""Z"", ""revised_winner"": ""M"", ""largest_capacity_label"": ""M""}" +AF-APER-02-0277,constraint_obstruction-038,constraint_obstruction,Choose the cheapest feasible provider. Options: P costs 63 and supports 13 units; V costs 19 and supports 4 units; H costs 46 and supports 10 units; T costs 88 and supports 16 units; J costs 32 and supports 7 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 7 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,J,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 4, 10, 16, 7], ""costs"": [63, 19, 46, 88, 32], ""initial"": 4, ""revised"": 7, ""initial_winner"": ""V"", ""revised_winner"": ""J"", ""largest_capacity_label"": ""T""}" +AF-APER-02-0278,constraint_obstruction-038,constraint_obstruction,Choose the cheapest feasible provider. Options: Y costs 88 and supports 16 units; J costs 32 and supports 7 units; S costs 46 and supports 10 units; X costs 19 and supports 4 units; N costs 63 and supports 13 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 10 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,S,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [16, 7, 10, 4, 13], ""costs"": [88, 32, 46, 19, 63], ""initial"": 4, ""revised"": 10, ""initial_winner"": ""X"", ""revised_winner"": ""S"", ""largest_capacity_label"": ""Y""}" +AF-APER-02-0279,constraint_obstruction-039,constraint_obstruction,Choose the cheapest feasible provider. Options: U costs 46 and supports 10 units; E costs 88 and supports 16 units; L costs 32 and supports 7 units; N costs 63 and supports 13 units; D costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 13 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,N,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [10, 16, 7, 13, 4], ""costs"": [46, 88, 32, 63, 19], ""initial"": 4, ""revised"": 13, ""initial_winner"": ""D"", ""revised_winner"": ""N"", ""largest_capacity_label"": ""E""}" +AF-APER-02-0280,constraint_obstruction-039,constraint_obstruction,Choose the cheapest feasible provider. Options: B costs 63 and supports 13 units; H costs 88 and supports 16 units; G costs 32 and supports 7 units; R costs 46 and supports 10 units; C costs 19 and supports 4 units. Initial minimum capacity: 4 units. A verified obstruction revises the required minimum to 16 units. Which provider is cheapest under the revised condition? Respond with its single-letter label.,H,Feasibility depends on current capacity constraint,Stricter threshold changes optimal provider,Exact label,"{""capacities"": [13, 16, 7, 10, 4], ""costs"": [63, 88, 32, 46, 19], ""initial"": 4, ""revised"": 16, ""initial_winner"": ""C"", ""revised_winner"": ""H"", ""largest_capacity_label"": ""H""}" +AF-APER-02-0301,reconditioning-000,reconditioning,"Directed routes: C→K, F→G, C→U, D→U, D→Q, Q→T, G→T, K→U, G→Q, Q→U, F→T, F→K, G→U, F→C, D→G, D→C, C→T, F→D, F→Q, T→U. Initially node D was forbidden. A policy revision permits D but a new obstruction forbids C. Find the shortest route from F to U after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",F→D→U,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""F\u2192C\u2192U"", ""new_forbidden"": ""C"", ""nodes"": 8, ""old_forbidden"": ""D"", ""revised_route"": ""F\u2192D\u2192U""}" +AF-APER-02-0302,reconditioning-000,reconditioning,"Directed routes: E→U, G→Z, W→U, Z→E, Z→R, G→B, Z→U, B→U, P→W, G→P, R→U, G→W, E→P, G→R, E→R, B→W, P→U, G→E. Initially node Z was forbidden. A policy revision permits Z but a new obstruction forbids B. Find the shortest route from G to U after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",G→E→U,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""G\u2192B\u2192U"", ""new_forbidden"": ""B"", ""nodes"": 8, ""old_forbidden"": ""Z"", ""revised_route"": ""G\u2192E\u2192U""}" +AF-APER-02-0303,reconditioning-001,reconditioning,"Directed routes: M→R, W→N, E→P, E→V, E→W, E→M, P→W, P→V, P→S, N→S, P→R, R→A, M→S, A→S, V→S, E→R, E→N, V→W, R→S, W→S, E→A. Initially node V was forbidden. A policy revision permits V but a new obstruction forbids A. Find the shortest route from E to S after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",E→M→S,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""E\u2192A\u2192S"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""V"", ""revised_route"": ""E\u2192M\u2192S""}" +AF-APER-02-0304,reconditioning-001,reconditioning,"Directed routes: R→B, R→V, R→M, R→C, A→B, M→S, C→Y, S→Y, B→Y, V→A, V→M, A→Y, U→Y, R→U, V→S, M→Y, V→Y, S→B, R→A, C→B, R→S. Initially node C was forbidden. A policy revision permits C but a new obstruction forbids A. Find the shortest route from R to Y after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",R→B→Y,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""R\u2192A\u2192Y"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""C"", ""revised_route"": ""R\u2192B\u2192Y""}" +AF-APER-02-0305,reconditioning-002,reconditioning,"Directed routes: E→F, N→E, C→T, C→W, C→N, V→F, Y→F, C→Y, C→X, X→Y, X→F, T→F, N→X, C→G, C→E, T→G, C→V, G→V, N→W, G→F, N→F, T→N, W→F. Initially node N was forbidden. A policy revision permits N but a new obstruction forbids E. Find the shortest route from C to F after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",C→G→F,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""C\u2192E\u2192F"", ""new_forbidden"": ""E"", ""nodes"": 10, ""old_forbidden"": ""N"", ""revised_route"": ""C\u2192G\u2192F""}" +AF-APER-02-0306,reconditioning-002,reconditioning,"Directed routes: P→B, X→L, X→V, F→S, X→P, L→B, F→B, S→B, V→B, S→Q, L→Q, Q→D, X→S, X→Q, X→N, L→D, S→P, S→D, D→B, N→B, X→F, X→D, V→L, Q→B. Initially node S was forbidden. A policy revision permits S but a new obstruction forbids D. Find the shortest route from X to B after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→F→B,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192D\u2192B"", ""new_forbidden"": ""D"", ""nodes"": 10, ""old_forbidden"": ""S"", ""revised_route"": ""X\u2192F\u2192B""}" +AF-APER-02-0307,reconditioning-003,reconditioning,"Directed routes: X→D, F→W, X→Q, X→F, D→W, Q→R, D→R, D→Q, F→R, X→A, A→R, B→R, W→R, F→B, X→P, X→B, K→R, X→Y, Y→F, Y→R, F→A, X→W, P→R, X→K. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids A. Find the shortest route from X to R after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→B→R,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192A\u2192R"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""Q"", ""revised_route"": ""X\u2192B\u2192R""}" +AF-APER-02-0308,reconditioning-003,reconditioning,"Directed routes: X→E, L→C, B→J, L→K, T→J, L→W, T→Y, K→Y, W→B, H→E, T→E, B→E, J→E, L→X, L→Y, L→B, B→X, K→B, L→H, L→T, H→B, Y→E, C→E, W→E, K→E, L→J. Initially node Y was forbidden. A policy revision permits Y but a new obstruction forbids B. Find the shortest route from L to E after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",L→C→E,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""L\u2192B\u2192E"", ""new_forbidden"": ""B"", ""nodes"": 11, ""old_forbidden"": ""Y"", ""revised_route"": ""L\u2192C\u2192E""}" +AF-APER-02-0309,reconditioning-004,reconditioning,"Directed routes: U→R, D→W, R→B, G→B, U→B, U→G, Y→B, Y→W, P→G, R→W, W→B, P→W, D→B, D→U, R→G, P→Y, P→D, P→U, P→R. Initially node W was forbidden. A policy revision permits W but a new obstruction forbids D. Find the shortest route from P to B after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",P→G→B,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""P\u2192D\u2192B"", ""new_forbidden"": ""D"", ""nodes"": 8, ""old_forbidden"": ""W"", ""revised_route"": ""P\u2192G\u2192B""}" +AF-APER-02-0310,reconditioning-004,reconditioning,"Directed routes: L→E, Z→A, F→A, N→Z, Z→P, P→A, V→A, L→V, Z→V, N→P, L→N, L→Z, L→P, E→A, N→E, V→P, N→A, L→F. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids E. Find the shortest route from L to A after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",L→F→A,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""L\u2192E\u2192A"", ""new_forbidden"": ""E"", ""nodes"": 8, ""old_forbidden"": ""P"", ""revised_route"": ""L\u2192F\u2192A""}" +AF-APER-02-0311,reconditioning-005,reconditioning,"Directed routes: H→Y, D→H, M→R, M→Y, D→R, D→V, G→L, D→L, R→Y, M→G, V→Y, R→V, G→A, D→G, D→M, D→A, H→A, L→Y, G→Y, A→Y. Initially node V was forbidden. A policy revision permits V but a new obstruction forbids A. Find the shortest route from D to Y after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",D→G→Y,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""D\u2192A\u2192Y"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""V"", ""revised_route"": ""D\u2192G\u2192Y""}" +AF-APER-02-0312,reconditioning-005,reconditioning,"Directed routes: H→W, S→Y, Q→P, Q→W, P→R, H→Y, R→W, S→E, Y→W, Q→V, V→W, Q→R, H→V, S→H, S→R, S→Q, Q→E, S→V, P→W, S→P, E→W. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids E. Find the shortest route from S to W after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",S→H→W,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""S\u2192E\u2192W"", ""new_forbidden"": ""E"", ""nodes"": 9, ""old_forbidden"": ""P"", ""revised_route"": ""S\u2192H\u2192W""}" +AF-APER-02-0313,reconditioning-006,reconditioning,"Directed routes: U→N, Q→U, P→B, G→M, A→N, G→Z, Q→M, Q→N, S→M, S→P, G→B, B→N, G→P, Z→N, P→N, Q→P, G→S, G→U, G→A, M→N, S→N, G→Q, M→U. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids A. Find the shortest route from G to N after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",G→B→N,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""G\u2192A\u2192N"", ""new_forbidden"": ""A"", ""nodes"": 10, ""old_forbidden"": ""P"", ""revised_route"": ""G\u2192B\u2192N""}" +AF-APER-02-0314,reconditioning-006,reconditioning,"Directed routes: Q→S, X→Q, V→S, X→Z, S→K, U→Q, W→K, X→V, W→S, Y→K, V→K, X→P, X→U, Z→K, X→Y, Q→K, P→K, V→Q, U→K, X→W, V→Y, X→S. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids P. Find the shortest route from X to K after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→Q→K,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192P\u2192K"", ""new_forbidden"": ""P"", ""nodes"": 10, ""old_forbidden"": ""Q"", ""revised_route"": ""X\u2192Q\u2192K""}" +AF-APER-02-0315,reconditioning-007,reconditioning,"Directed routes: L→M, W→M, D→A, B→T, A→L, D→Y, Z→C, D→W, A→M, D→N, D→Z, T→M, B→C, Z→M, Y→C, Y→B, N→M, B→M, D→B, N→A, N→W, C→M, D→T, D→C, D→L, Y→M. Initially node T was forbidden. A policy revision permits T but a new obstruction forbids A. Find the shortest route from D to M after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",D→B→M,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""D\u2192A\u2192M"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""T"", ""revised_route"": ""D\u2192B\u2192M""}" +AF-APER-02-0316,reconditioning-007,reconditioning,"Directed routes: Y→F, D→G, T→F, B→T, B→Y, L→G, L→T, F→G, B→A, Z→G, Z→N, T→Y, A→G, P→G, N→Y, B→N, B→L, B→D, T→G, B→Z, Y→G, B→F, N→G, A→T, B→P. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids A. Find the shortest route from B to G after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",B→D→G,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""B\u2192A\u2192G"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""P"", ""revised_route"": ""B\u2192D\u2192G""}" +AF-APER-02-0317,reconditioning-008,reconditioning,"Directed routes: V→C, C→T, Z→C, R→A, V→R, V→G, C→R, G→P, V→A, R→P, A→T, R→T, G→T, Z→P, V→P, P→T, Z→T, V→Z, C→G. Initially node R was forbidden. A policy revision permits R but a new obstruction forbids A. Find the shortest route from V to T after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",V→C→T,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""V\u2192A\u2192T"", ""new_forbidden"": ""A"", ""nodes"": 8, ""old_forbidden"": ""R"", ""revised_route"": ""V\u2192C\u2192T""}" +AF-APER-02-0318,reconditioning-008,reconditioning,"Directed routes: E→Y, E→T, S→W, M→S, E→W, W→L, Y→T, M→Y, S→T, M→A, L→T, A→L, E→S, M→E, A→T, W→T, M→W, M→L. Initially node A was forbidden. A policy revision permits A but a new obstruction forbids W. Find the shortest route from M to T after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",M→A→T,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""M\u2192E\u2192T"", ""new_forbidden"": ""W"", ""nodes"": 8, ""old_forbidden"": ""A"", ""revised_route"": ""M\u2192A\u2192T""}" +AF-APER-02-0319,reconditioning-009,reconditioning,"Directed routes: D→J, P→M, X→U, X→J, W→E, W→J, P→E, X→W, P→J, B→U, D→U, P→X, J→U, W→U, P→D, P→B, M→U, E→U, P→W, B→E, B→W. Initially node X was forbidden. A policy revision permits X but a new obstruction forbids B. Find the shortest route from P to U after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",P→D→U,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""P\u2192B\u2192U"", ""new_forbidden"": ""B"", ""nodes"": 9, ""old_forbidden"": ""X"", ""revised_route"": ""P\u2192D\u2192U""}" +AF-APER-02-0320,reconditioning-009,reconditioning,"Directed routes: F→J, A→V, J→K, F→S, F→K, V→J, Q→M, Q→V, N→K, S→K, M→K, V→K, Q→N, N→J, Q→J, A→F, Q→A, Q→S, Q→F, A→K. Initially node F was forbidden. A policy revision permits F but a new obstruction forbids A. Find the shortest route from Q to K after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",Q→F→K,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""Q\u2192A\u2192K"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""F"", ""revised_route"": ""Q\u2192F\u2192K""}" +AF-APER-02-0321,reconditioning-010,reconditioning,"Directed routes: U→R, F→C, C→P, V→P, F→V, F→U, V→R, W→R, P→R, C→R, E→X, E→D, F→P, F→D, U→V, C→X, D→R, C→U, X→R, F→W, F→E, F→X, E→R. Initially node C was forbidden. A policy revision permits C but a new obstruction forbids U. Find the shortest route from F to R after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",F→C→R,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""F\u2192D\u2192R"", ""new_forbidden"": ""U"", ""nodes"": 10, ""old_forbidden"": ""C"", ""revised_route"": ""F\u2192C\u2192R""}" +AF-APER-02-0322,reconditioning-010,reconditioning,"Directed routes: C→H, D→L, F→Y, L→S, F→L, F→C, L→H, Y→H, Q→H, Q→P, F→Q, B→D, F→P, F→S, S→H, S→Y, P→C, F→B, D→H, P→H, F→D, B→H, B→Y. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids B. Find the shortest route from F to H after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",F→C→H,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""F\u2192B\u2192H"", ""new_forbidden"": ""B"", ""nodes"": 10, ""old_forbidden"": ""P"", ""revised_route"": ""F\u2192C\u2192H""}" +AF-APER-02-0323,reconditioning-011,reconditioning,"Directed routes: Y→J, Y→E, G→B, G→E, T→Y, T→J, B→A, P→E, B→E, T→P, H→T, N→M, T→E, N→T, B→Y, H→E, J→E, N→B, N→G, M→E, N→Y, N→H, A→E, N→A, N→J, N→P. Initially node H was forbidden. A policy revision permits H but a new obstruction forbids A. Find the shortest route from N to E after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",N→B→E,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""N\u2192A\u2192E"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""H"", ""revised_route"": ""N\u2192B\u2192E""}" +AF-APER-02-0324,reconditioning-011,reconditioning,"Directed routes: F→V, M→L, K→H, M→A, L→H, X→H, M→T, M→X, V→H, V→D, X→F, X→V, A→K, M→Y, M→F, M→V, A→H, M→K, D→H, X→L, X→K, A→L, T→H, M→D, F→H, Y→H. Initially node Y was forbidden. A policy revision permits Y but a new obstruction forbids A. Find the shortest route from M to H after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",M→D→H,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""M\u2192A\u2192H"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""Y"", ""revised_route"": ""M\u2192D\u2192H""}" +AF-APER-02-0325,reconditioning-012,reconditioning,"Directed routes: W→C, F→B, S→T, C→T, F→L, F→W, L→P, F→S, L→W, F→C, W→B, L→T, B→S, F→P, P→T, B→T, W→T. Initially node L was forbidden. A policy revision permits L but a new obstruction forbids B. Find the shortest route from F to T after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",F→C→T,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""F\u2192B\u2192T"", ""new_forbidden"": ""B"", ""nodes"": 8, ""old_forbidden"": ""L"", ""revised_route"": ""F\u2192C\u2192T""}" +AF-APER-02-0326,reconditioning-012,reconditioning,"Directed routes: R→B, R→G, E→B, W→G, K→Y, W→C, E→G, W→Y, G→B, W→E, C→B, C→G, E→R, K→E, R→Y, Y→B, W→R, W→K, K→B. Initially node K was forbidden. A policy revision permits K but a new obstruction forbids C. Find the shortest route from W to B after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",W→E→B,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""W\u2192C\u2192B"", ""new_forbidden"": ""C"", ""nodes"": 8, ""old_forbidden"": ""K"", ""revised_route"": ""W\u2192E\u2192B""}" +AF-APER-02-0327,reconditioning-013,reconditioning,"Directed routes: D→U, D→Z, D→R, U→Q, R→Z, N→Q, Z→Q, D→F, S→Q, U→Z, D→B, F→Q, R→U, N→S, U→F, Z→N, D→N, D→S, B→Q, R→Q, U→N. Initially node B was forbidden. A policy revision permits B but a new obstruction forbids U. Find the shortest route from D to Q after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",D→B→Q,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""D\u2192F\u2192Q"", ""new_forbidden"": ""U"", ""nodes"": 9, ""old_forbidden"": ""B"", ""revised_route"": ""D\u2192B\u2192Q""}" +AF-APER-02-0328,reconditioning-013,reconditioning,"Directed routes: T→H, A→E, C→E, C→T, A→C, C→H, C→U, V→T, E→H, U→H, A→D, C→Q, V→H, A→V, A→U, D→H, T→D, A→T, U→D, A→Q, V→D, Q→H. Initially node D was forbidden. A policy revision permits D but a new obstruction forbids C. Find the shortest route from A to H after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",A→D→H,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""A\u2192C\u2192H"", ""new_forbidden"": ""C"", ""nodes"": 9, ""old_forbidden"": ""D"", ""revised_route"": ""A\u2192D\u2192H""}" +AF-APER-02-0329,reconditioning-014,reconditioning,"Directed routes: V→U, V→L, K→W, A→W, F→W, A→U, S→W, U→W, A→P, V→F, V→A, T→P, V→T, F→P, T→W, L→W, P→W, V→K, V→S, V→P, P→L, F→L. Initially node U was forbidden. A policy revision permits U but a new obstruction forbids A. Find the shortest route from V to W after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",V→F→W,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""V\u2192A\u2192W"", ""new_forbidden"": ""A"", ""nodes"": 10, ""old_forbidden"": ""U"", ""revised_route"": ""V\u2192F\u2192W""}" +AF-APER-02-0330,reconditioning-014,reconditioning,"Directed routes: M→V, P→X, X→V, Z→V, X→K, W→X, T→M, W→V, P→T, P→K, P→G, T→V, P→M, P→B, P→Z, K→V, G→V, B→V, G→X, M→K, P→W. Initially node B was forbidden. A policy revision permits B but a new obstruction forbids G. Find the shortest route from P to V after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",P→B→V,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""P\u2192G\u2192V"", ""new_forbidden"": ""G"", ""nodes"": 10, ""old_forbidden"": ""B"", ""revised_route"": ""P\u2192B\u2192V""}" +AF-APER-02-0331,reconditioning-015,reconditioning,"Directed routes: S→Q, N→F, N→S, N→K, Z→X, S→F, N→E, N→H, N→Q, E→X, K→S, H→X, C→X, Y→X, Z→H, F→X, N→C, N→Z, K→Q, K→X, K→H, Q→X, N→Y, S→X, E→H. Initially node C was forbidden. A policy revision permits C but a new obstruction forbids Y. Find the shortest route from N to X after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",N→C→X,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""N\u2192E\u2192X"", ""new_forbidden"": ""Y"", ""nodes"": 11, ""old_forbidden"": ""C"", ""revised_route"": ""N\u2192C\u2192X""}" +AF-APER-02-0332,reconditioning-015,reconditioning,"Directed routes: D→C, B→E, D→B, L→E, U→F, D→T, D→J, D→X, U→E, F→E, D→U, D→L, T→X, U→B, T→E, D→F, J→E, C→E, T→F, X→E, L→J, K→E, F→B, D→K. Initially node X was forbidden. A policy revision permits X but a new obstruction forbids B. Find the shortest route from D to E after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",D→C→E,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""D\u2192B\u2192E"", ""new_forbidden"": ""B"", ""nodes"": 11, ""old_forbidden"": ""X"", ""revised_route"": ""D\u2192C\u2192E""}" +AF-APER-02-0333,reconditioning-016,reconditioning,"Directed routes: Q→H, F→K, P→L, K→P, R→H, L→H, F→R, B→H, B→K, F→B, P→H, F→L, K→H, F→P, B→Q, R→P, K→L, F→Q, R→K. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids B. Find the shortest route from F to H after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",F→K→H,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""F\u2192B\u2192H"", ""new_forbidden"": ""B"", ""nodes"": 8, ""old_forbidden"": ""Q"", ""revised_route"": ""F\u2192K\u2192H""}" +AF-APER-02-0334,reconditioning-016,reconditioning,"Directed routes: V→Z, D→G, Z→L, J→G, Z→J, E→W, L→W, W→G, Z→G, V→J, V→E, W→D, J→L, J→D, L→G, V→L, V→W, E→G, V→D. Initially node W was forbidden. A policy revision permits W but a new obstruction forbids D. Find the shortest route from V to G after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",V→E→G,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""V\u2192D\u2192G"", ""new_forbidden"": ""D"", ""nodes"": 8, ""old_forbidden"": ""W"", ""revised_route"": ""V\u2192E\u2192G""}" +AF-APER-02-0335,reconditioning-017,reconditioning,"Directed routes: M→G, X→B, X→M, X→K, H→N, G→L, W→L, M→L, X→N, H→L, W→M, B→M, X→W, K→L, X→H, N→L, W→G, B→L, N→K, X→G, B→G. Initially node M was forbidden. A policy revision permits M but a new obstruction forbids B. Find the shortest route from X to L after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→G→L,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192B\u2192L"", ""new_forbidden"": ""B"", ""nodes"": 9, ""old_forbidden"": ""M"", ""revised_route"": ""X\u2192G\u2192L""}" +AF-APER-02-0336,reconditioning-017,reconditioning,"Directed routes: N→S, R→A, J→C, E→G, N→G, N→C, N→W, S→E, J→R, S→G, N→E, J→E, W→G, C→A, J→N, J→A, C→G, A→G, J→W, J→S, R→G. Initially node R was forbidden. A policy revision permits R but a new obstruction forbids A. Find the shortest route from J to G after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",J→C→G,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""J\u2192A\u2192G"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""R"", ""revised_route"": ""J\u2192C\u2192G""}" +AF-APER-02-0337,reconditioning-018,reconditioning,"Directed routes: X→U, T→J, H→Y, X→G, D→Y, U→Y, N→H, X→F, F→T, X→N, X→H, X→T, D→J, N→Y, T→Y, X→J, F→Y, F→G, J→Y, G→Y, H→G, X→D. Initially node H was forbidden. A policy revision permits H but a new obstruction forbids D. Find the shortest route from X to Y after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→F→Y,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192D\u2192Y"", ""new_forbidden"": ""D"", ""nodes"": 10, ""old_forbidden"": ""H"", ""revised_route"": ""X\u2192F\u2192Y""}" +AF-APER-02-0338,reconditioning-018,reconditioning,"Directed routes: J→K, B→D, J→H, H→Z, B→Q, J→U, D→Z, M→Q, J→Z, K→Q, H→Q, K→U, J→L, J→M, J→D, B→M, U→Q, H→D, Z→Q, L→Q, D→Q, Z→U, J→B. Initially node H was forbidden. A policy revision permits H but a new obstruction forbids B. Find the shortest route from J to Q after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",J→D→Q,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""J\u2192B\u2192Q"", ""new_forbidden"": ""B"", ""nodes"": 10, ""old_forbidden"": ""H"", ""revised_route"": ""J\u2192D\u2192Q""}" +AF-APER-02-0339,reconditioning-019,reconditioning,"Directed routes: S→X, R→X, L→D, C→S, L→S, L→R, H→N, L→C, Q→S, L→G, H→X, R→S, C→X, L→N, D→X, D→S, Q→X, N→X, G→X, Q→D, L→Q, Z→X, L→Z, L→H. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids C. Find the shortest route from L to X after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",L→D→X,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""L\u2192C\u2192X"", ""new_forbidden"": ""C"", ""nodes"": 11, ""old_forbidden"": ""Q"", ""revised_route"": ""L\u2192D\u2192X""}" +AF-APER-02-0340,reconditioning-019,reconditioning,"Directed routes: B→A, R→Y, B→E, B→T, L→J, B→C, T→Y, T→J, X→L, E→A, E→Y, B→F, B→L, T→R, F→C, T→C, B→J, X→Y, B→X, F→Y, B→R, L→Y, J→Y, C→Y, A→Y. Initially node F was forbidden. A policy revision permits F but a new obstruction forbids A. Find the shortest route from B to Y after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",B→C→Y,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""B\u2192A\u2192Y"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""F"", ""revised_route"": ""B\u2192C\u2192Y""}" +AF-APER-02-0341,reconditioning-020,reconditioning,"Directed routes: A→Q, R→F, P→R, L→M, H→F, L→P, Q→F, P→F, A→H, M→F, A→P, M→P, Q→H, R→Q, R→H, A→M, A→R, A→L, L→F. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids H. Find the shortest route from A to F after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",A→L→F,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""A\u2192H\u2192F"", ""new_forbidden"": ""H"", ""nodes"": 8, ""old_forbidden"": ""P"", ""revised_route"": ""A\u2192L\u2192F""}" +AF-APER-02-0342,reconditioning-020,reconditioning,"Directed routes: H→W, J→F, H→F, R→Y, G→Y, J→Y, F→Y, W→F, R→M, H→R, H→M, H→J, M→Y, H→G, W→J, W→Y, M→F, W→R. Initially node G was forbidden. A policy revision permits G but a new obstruction forbids F. Find the shortest route from H to Y after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",H→G→Y,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""H\u2192F\u2192Y"", ""new_forbidden"": ""F"", ""nodes"": 8, ""old_forbidden"": ""G"", ""revised_route"": ""H\u2192G\u2192Y""}" +AF-APER-02-0343,reconditioning-021,reconditioning,"Directed routes: G→Q, K→E, P→Y, M→Y, G→Y, G→A, P→Q, M→P, M→G, B→Q, M→E, M→A, Y→Q, M→B, A→P, A→B, E→Q, M→K, K→Q, P→B, A→Q. Initially node G was forbidden. A policy revision permits G but a new obstruction forbids A. Find the shortest route from M to Q after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",M→B→Q,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""M\u2192A\u2192Q"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""G"", ""revised_route"": ""M\u2192B\u2192Q""}" +AF-APER-02-0344,reconditioning-021,reconditioning,"Directed routes: F→T, E→U, U→W, C→T, W→F, E→C, E→F, E→R, L→B, L→R, B→T, L→W, R→T, E→W, C→R, E→B, E→L, W→T, B→F, W→C, U→T, L→T. Initially node U was forbidden. A policy revision permits U but a new obstruction forbids B. Find the shortest route from E to T after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",E→C→T,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""E\u2192B\u2192T"", ""new_forbidden"": ""B"", ""nodes"": 9, ""old_forbidden"": ""U"", ""revised_route"": ""E\u2192C\u2192T""}" +AF-APER-02-0345,reconditioning-022,reconditioning,"Directed routes: W→Z, N→P, M→K, M→Y, Y→P, E→K, Y→R, M→E, M→Z, R→P, M→T, T→Z, E→P, E→Z, T→N, M→R, T→P, Z→P, M→W, W→P, E→W, M→N, Y→Z, K→P. Initially node W was forbidden. A policy revision permits W but a new obstruction forbids E. Find the shortest route from M to P after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",M→K→P,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""M\u2192E\u2192P"", ""new_forbidden"": ""E"", ""nodes"": 10, ""old_forbidden"": ""W"", ""revised_route"": ""M\u2192K\u2192P""}" +AF-APER-02-0346,reconditioning-022,reconditioning,"Directed routes: R→C, X→C, Q→C, E→B, E→Q, J→X, M→C, E→R, F→C, F→B, M→Q, E→X, E→M, E→F, B→C, J→R, E→K, E→J, K→C, X→F, J→C, X→K, F→Q. Initially node K was forbidden. A policy revision permits K but a new obstruction forbids B. Find the shortest route from E to C after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",E→F→C,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""E\u2192B\u2192C"", ""new_forbidden"": ""B"", ""nodes"": 10, ""old_forbidden"": ""K"", ""revised_route"": ""E\u2192F\u2192C""}" +AF-APER-02-0347,reconditioning-023,reconditioning,"Directed routes: E→C, X→E, R→G, X→N, V→B, X→B, R→M, X→H, X→R, B→C, V→R, K→C, X→K, G→C, X→M, G→K, H→M, N→M, R→C, M→C, H→C, X→V, V→H, N→C, V→C, X→G. Initially node E was forbidden. A policy revision permits E but a new obstruction forbids B. Find the shortest route from X to C after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→E→C,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192B\u2192C"", ""new_forbidden"": ""B"", ""nodes"": 11, ""old_forbidden"": ""E"", ""revised_route"": ""X\u2192E\u2192C""}" +AF-APER-02-0348,reconditioning-023,reconditioning,"Directed routes: T→B, G→P, S→T, S→P, N→B, S→N, F→B, Z→B, P→B, N→M, J→B, S→Z, S→F, S→U, U→P, M→B, S→M, U→B, N→U, G→B, G→Z, S→G, T→F, S→J, P→T. Initially node Z was forbidden. A policy revision permits Z but a new obstruction forbids F. Find the shortest route from S to B after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",S→G→B,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""S\u2192F\u2192B"", ""new_forbidden"": ""F"", ""nodes"": 11, ""old_forbidden"": ""Z"", ""revised_route"": ""S\u2192G\u2192B""}" +AF-APER-02-0349,reconditioning-024,reconditioning,"Directed routes: D→L, D→G, D→E, G→X, G→C, C→X, E→G, L→X, D→S, E→S, D→N, N→G, E→L, S→X, N→X, E→X, D→C. Initially node E was forbidden. A policy revision permits E but a new obstruction forbids C. Find the shortest route from D to X after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",D→E→X,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""D\u2192C\u2192X"", ""new_forbidden"": ""C"", ""nodes"": 8, ""old_forbidden"": ""E"", ""revised_route"": ""D\u2192E\u2192X""}" +AF-APER-02-0350,reconditioning-024,reconditioning,"Directed routes: C→J, W→A, Z→A, C→U, X→W, X→U, T→A, T→Z, W→U, X→T, C→Z, X→J, C→A, J→U, U→A, X→Z, X→C, J→W, J→A. Initially node C was forbidden. A policy revision permits C but a new obstruction forbids T. Find the shortest route from X to A after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→C→A,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192J\u2192A"", ""new_forbidden"": ""T"", ""nodes"": 8, ""old_forbidden"": ""C"", ""revised_route"": ""X\u2192C\u2192A""}" +AF-APER-02-0351,reconditioning-025,reconditioning,"Directed routes: V→E, E→K, P→F, E→Y, V→F, R→U, R→Y, R→H, U→F, R→E, R→P, V→P, V→H, V→U, K→F, E→U, R→V, E→F, U→P, R→K, H→F, Y→F. Initially node H was forbidden. A policy revision permits H but a new obstruction forbids E. Find the shortest route from R to F after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",R→H→F,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""R\u2192E\u2192F"", ""new_forbidden"": ""E"", ""nodes"": 9, ""old_forbidden"": ""H"", ""revised_route"": ""R\u2192H\u2192F""}" +AF-APER-02-0352,reconditioning-025,reconditioning,"Directed routes: Q→B, T→K, R→B, T→W, W→M, K→P, Q→J, T→Q, T→P, Q→P, K→J, R→J, W→J, P→B, T→R, M→J, T→M, B→J, P→J, W→R, T→B. Initially node K was forbidden. A policy revision permits K but a new obstruction forbids B. Find the shortest route from T to J after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",T→K→J,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""T\u2192B\u2192J"", ""new_forbidden"": ""B"", ""nodes"": 9, ""old_forbidden"": ""K"", ""revised_route"": ""T\u2192K\u2192J""}" +AF-APER-02-0353,reconditioning-026,reconditioning,"Directed routes: V→Q, V→F, F→W, H→F, C→W, E→W, V→B, R→F, T→W, V→T, H→W, V→C, Q→F, F→B, B→W, V→H, T→B, R→W, C→H, V→R, H→R, V→E, Q→W, F→T. Initially node H was forbidden. A policy revision permits H but a new obstruction forbids B. Find the shortest route from V to W after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",V→C→W,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""V\u2192B\u2192W"", ""new_forbidden"": ""B"", ""nodes"": 10, ""old_forbidden"": ""H"", ""revised_route"": ""V\u2192C\u2192W""}" +AF-APER-02-0354,reconditioning-026,reconditioning,"Directed routes: D→P, W→M, D→Z, Z→C, P→C, R→M, D→C, D→U, D→R, D→E, U→M, P→M, C→R, S→R, U→E, E→M, U→P, D→S, S→M, Z→M, D→W, C→M. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids C. Find the shortest route from D to M after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",D→E→M,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""D\u2192C\u2192M"", ""new_forbidden"": ""C"", ""nodes"": 10, ""old_forbidden"": ""P"", ""revised_route"": ""D\u2192E\u2192M""}" +AF-APER-02-0355,reconditioning-027,reconditioning,"Directed routes: V→M, R→P, L→D, S→P, V→H, X→P, L→P, V→F, M→D, V→K, K→H, V→S, K→M, V→X, V→L, M→P, K→D, F→P, D→P, X→R, K→P, H→P, V→D, L→H, V→R. Initially node F was forbidden. A policy revision permits F but a new obstruction forbids D. Find the shortest route from V to P after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",V→F→P,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""V\u2192D\u2192P"", ""new_forbidden"": ""D"", ""nodes"": 11, ""old_forbidden"": ""F"", ""revised_route"": ""V\u2192F\u2192P""}" +AF-APER-02-0356,reconditioning-027,reconditioning,"Directed routes: H→A, A→E, N→E, C→E, H→E, L→E, U→W, W→E, U→M, U→L, Q→E, U→H, A→Q, C→A, M→L, Z→E, U→N, M→E, U→Q, M→C, A→Z, Q→Z, U→C, U→A, U→Z, W→N. Initially node W was forbidden. A policy revision permits W but a new obstruction forbids A. Find the shortest route from U to E after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",U→C→E,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""U\u2192A\u2192E"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""W"", ""revised_route"": ""U\u2192C\u2192E""}" +AF-APER-02-0357,reconditioning-028,reconditioning,"Directed routes: P→U, P→W, F→N, Q→C, P→C, C→W, F→W, U→N, Q→N, W→N, G→N, U→C, P→F, U→F, P→Q, G→U, P→G, C→N. Initially node C was forbidden. A policy revision permits C but a new obstruction forbids G. Find the shortest route from P to N after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",P→C→N,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""P\u2192F\u2192N"", ""new_forbidden"": ""G"", ""nodes"": 8, ""old_forbidden"": ""C"", ""revised_route"": ""P\u2192C\u2192N""}" +AF-APER-02-0358,reconditioning-028,reconditioning,"Directed routes: N→U, Q→U, Q→N, X→N, X→U, A→X, A→B, B→U, X→J, J→N, A→Q, Q→B, Q→J, R→U, A→R, J→U, A→J, A→N, R→N. Initially node B was forbidden. A policy revision permits B but a new obstruction forbids Q. Find the shortest route from A to U after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",A→B→U,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""A\u2192J\u2192U"", ""new_forbidden"": ""Q"", ""nodes"": 8, ""old_forbidden"": ""B"", ""revised_route"": ""A\u2192B\u2192U""}" +AF-APER-02-0359,reconditioning-029,reconditioning,"Directed routes: W→L, A→J, R→J, Y→L, Q→J, W→Q, Y→Q, W→Y, Y→J, V→J, V→Q, Y→R, E→Q, W→A, E→J, W→R, E→Y, R→Q, L→J, W→V, W→E, A→V. Initially node A was forbidden. A policy revision permits A but a new obstruction forbids V. Find the shortest route from W to J after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",W→A→J,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""W\u2192E\u2192J"", ""new_forbidden"": ""V"", ""nodes"": 9, ""old_forbidden"": ""A"", ""revised_route"": ""W\u2192A\u2192J""}" +AF-APER-02-0360,reconditioning-029,reconditioning,"Directed routes: E→N, L→N, L→R, Z→R, V→R, E→L, W→N, W→G, R→N, J→N, R→W, V→G, G→N, Z→L, V→W, V→E, V→L, V→Z, V→J, Z→N, Z→E. Initially node E was forbidden. A policy revision permits E but a new obstruction forbids R. Find the shortest route from V to N after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",V→E→N,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""V\u2192G\u2192N"", ""new_forbidden"": ""R"", ""nodes"": 9, ""old_forbidden"": ""E"", ""revised_route"": ""V\u2192E\u2192N""}" +AF-APER-02-0361,reconditioning-030,reconditioning,"Directed routes: E→Y, C→B, D→V, E→B, L→D, L→S, S→V, D→B, H→C, Y→B, H→E, L→B, V→B, H→D, S→B, A→C, H→L, H→S, H→Y, E→S, H→V, Y→D, A→B, H→A. Initially node V was forbidden. A policy revision permits V but a new obstruction forbids A. Find the shortest route from H to B after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",H→C→B,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""H\u2192A\u2192B"", ""new_forbidden"": ""A"", ""nodes"": 10, ""old_forbidden"": ""V"", ""revised_route"": ""H\u2192C\u2192B""}" +AF-APER-02-0362,reconditioning-030,reconditioning,"Directed routes: Y→T, Y→D, W→Z, D→Z, A→D, V→Z, E→D, T→W, A→Y, V→D, T→Z, A→W, J→Z, A→F, A→T, Y→Z, E→F, V→Y, A→E, E→Z, A→J, A→V, F→Z. Initially node W was forbidden. A policy revision permits W but a new obstruction forbids D. Find the shortest route from A to Z after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",A→E→Z,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""A\u2192D\u2192Z"", ""new_forbidden"": ""D"", ""nodes"": 10, ""old_forbidden"": ""W"", ""revised_route"": ""A\u2192E\u2192Z""}" +AF-APER-02-0363,reconditioning-031,reconditioning,"Directed routes: Z→L, E→D, Z→B, L→P, Z→A, Z→E, Z→U, Z→H, U→G, H→D, Z→P, G→D, Q→D, G→P, G→L, G→E, Z→G, P→D, U→E, L→D, A→D, H→U, U→A, U→D, Z→Q, B→D. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids A. Find the shortest route from Z to D after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",Z→B→D,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""Z\u2192A\u2192D"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""Q"", ""revised_route"": ""Z\u2192B\u2192D""}" +AF-APER-02-0364,reconditioning-031,reconditioning,"Directed routes: L→U, D→V, X→N, T→J, J→V, X→C, X→E, Z→V, T→D, D→N, X→J, N→V, C→V, E→V, L→J, U→V, X→T, L→V, C→N, U→D, X→L, X→Z, X→U, X→D, T→V. Initially node E was forbidden. A policy revision permits E but a new obstruction forbids C. Find the shortest route from X to V after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→D→V,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192C\u2192V"", ""new_forbidden"": ""C"", ""nodes"": 11, ""old_forbidden"": ""E"", ""revised_route"": ""X\u2192D\u2192V""}" +AF-APER-02-0365,reconditioning-032,reconditioning,"Directed routes: C→H, H→U, C→U, Z→U, M→U, M→G, U→G, T→U, Z→T, C→Z, H→M, H→G, Z→H, A→G, C→A, T→G, C→T, C→M, Z→G. Initially node H was forbidden. A policy revision permits H but a new obstruction forbids A. Find the shortest route from C to G after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",C→H→G,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""C\u2192A\u2192G"", ""new_forbidden"": ""A"", ""nodes"": 8, ""old_forbidden"": ""H"", ""revised_route"": ""C\u2192H\u2192G""}" +AF-APER-02-0366,reconditioning-032,reconditioning,"Directed routes: L→R, X→C, K→G, L→K, R→X, R→T, R→G, K→X, L→T, C→G, L→D, X→T, D→G, K→R, X→G, K→D, K→T, T→G, L→X, L→C. Initially node D was forbidden. A policy revision permits D but a new obstruction forbids C. Find the shortest route from L to G after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",L→D→G,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""L\u2192C\u2192G"", ""new_forbidden"": ""C"", ""nodes"": 8, ""old_forbidden"": ""D"", ""revised_route"": ""L\u2192D\u2192G""}" +AF-APER-02-0367,reconditioning-033,reconditioning,"Directed routes: F→V, B→E, B→H, A→F, A→V, B→Q, H→V, Q→V, L→Q, Z→V, H→Z, L→V, B→L, Q→H, B→Z, H→E, Q→Z, B→F, A→L, B→A, E→V, F→E. Initially node Z was forbidden. A policy revision permits Z but a new obstruction forbids A. Find the shortest route from B to V after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",B→E→V,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""B\u2192A\u2192V"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""Z"", ""revised_route"": ""B\u2192E\u2192V""}" +AF-APER-02-0368,reconditioning-033,reconditioning,"Directed routes: K→B, D→P, W→S, Q→P, Q→V, K→V, K→S, G→D, G→B, G→K, G→W, D→Q, G→Q, S→P, V→P, D→W, G→S, D→S, B→P, G→V, K→P, W→P. Initially node S was forbidden. A policy revision permits S but a new obstruction forbids B. Find the shortest route from G to P after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",G→D→P,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""G\u2192B\u2192P"", ""new_forbidden"": ""B"", ""nodes"": 9, ""old_forbidden"": ""S"", ""revised_route"": ""G\u2192D\u2192P""}" +AF-APER-02-0369,reconditioning-034,reconditioning,"Directed routes: F→V, U→W, H→F, U→M, W→F, V→X, S→X, U→V, U→Z, H→X, U→S, U→F, W→X, M→X, U→H, W→S, C→X, F→X, F→Z, M→Z, Z→X, W→C, U→C. Initially node F was forbidden. A policy revision permits F but a new obstruction forbids C. Find the shortest route from U to X after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",U→F→X,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""U\u2192C\u2192X"", ""new_forbidden"": ""C"", ""nodes"": 10, ""old_forbidden"": ""F"", ""revised_route"": ""U\u2192F\u2192X""}" +AF-APER-02-0370,reconditioning-034,reconditioning,"Directed routes: D→J, X→K, A→P, K→N, X→U, N→J, X→V, X→A, D→U, K→J, K→U, X→N, X→M, X→P, X→D, V→J, D→K, N→V, M→J, A→J, U→J, P→J, D→P. Initially node K was forbidden. A policy revision permits K but a new obstruction forbids A. Find the shortest route from X to J after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",X→D→J,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""X\u2192A\u2192J"", ""new_forbidden"": ""A"", ""nodes"": 10, ""old_forbidden"": ""K"", ""revised_route"": ""X\u2192D\u2192J""}" +AF-APER-02-0371,reconditioning-035,reconditioning,"Directed routes: A→L, A→T, L→F, A→K, N→F, A→E, N→P, A→S, A→P, S→F, E→F, P→F, T→F, A→D, A→N, A→G, D→P, D→F, T→L, G→F, N→K, E→G, K→F. Initially node P was forbidden. A policy revision permits P but a new obstruction forbids D. Find the shortest route from A to F after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",A→E→F,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""A\u2192D\u2192F"", ""new_forbidden"": ""D"", ""nodes"": 11, ""old_forbidden"": ""P"", ""revised_route"": ""A\u2192E\u2192F""}" +AF-APER-02-0372,reconditioning-035,reconditioning,"Directed routes: Q→J, B→K, J→K, T→K, L→K, C→K, W→Q, W→H, C→J, W→M, W→X, X→J, M→B, X→K, H→T, W→C, L→C, W→T, H→K, W→B, M→Q, Q→K, M→K, W→L, W→J. Initially node J was forbidden. A policy revision permits J but a new obstruction forbids B. Find the shortest route from W to K after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",W→C→K,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""W\u2192B\u2192K"", ""new_forbidden"": ""B"", ""nodes"": 11, ""old_forbidden"": ""J"", ""revised_route"": ""W\u2192C\u2192K""}" +AF-APER-02-0373,reconditioning-036,reconditioning,"Directed routes: D→J, Q→J, D→V, N→L, S→J, N→V, L→V, Q→D, N→X, D→L, V→J, Q→V, X→J, N→D, N→Q, N→S, L→J, L→S. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids D. Find the shortest route from N to J after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",N→L→J,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""N\u2192D\u2192J"", ""new_forbidden"": ""D"", ""nodes"": 8, ""old_forbidden"": ""Q"", ""revised_route"": ""N\u2192L\u2192J""}" +AF-APER-02-0374,reconditioning-036,reconditioning,"Directed routes: K→Z, S→Z, S→X, W→X, Q→X, G→Z, G→S, K→L, W→L, G→W, G→X, X→L, G→K, S→L, G→Q, Z→L, Q→L. Initially node W was forbidden. A policy revision permits W but a new obstruction forbids K. Find the shortest route from G to L after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",G→Q→L,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""G\u2192K\u2192L"", ""new_forbidden"": ""K"", ""nodes"": 8, ""old_forbidden"": ""W"", ""revised_route"": ""G\u2192Q\u2192L""}" +AF-APER-02-0375,reconditioning-037,reconditioning,"Directed routes: T→Y, T→P, R→P, H→P, W→Y, M→Y, H→R, T→E, E→M, E→Y, M→P, H→M, R→Y, B→Y, H→W, P→Y, H→B, H→E, H→T, R→M. Initially node T was forbidden. A policy revision permits T but a new obstruction forbids B. Find the shortest route from H to Y after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",H→E→Y,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""H\u2192B\u2192Y"", ""new_forbidden"": ""B"", ""nodes"": 9, ""old_forbidden"": ""T"", ""revised_route"": ""H\u2192E\u2192Y""}" +AF-APER-02-0376,reconditioning-037,reconditioning,"Directed routes: V→Z, N→P, H→Z, V→P, W→H, W→A, W→Z, A→P, W→V, Z→P, W→N, U→H, H→P, V→H, V→G, N→G, G→P, A→H, U→P, W→G, W→U. Initially node U was forbidden. A policy revision permits U but a new obstruction forbids A. Find the shortest route from W to P after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",W→G→P,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""W\u2192A\u2192P"", ""new_forbidden"": ""A"", ""nodes"": 9, ""old_forbidden"": ""U"", ""revised_route"": ""W\u2192G\u2192P""}" +AF-APER-02-0377,reconditioning-038,reconditioning,"Directed routes: N→W, N→J, X→W, N→X, F→J, A→Q, K→W, N→F, Q→H, A→H, F→K, S→K, N→A, N→S, N→K, N→Q, J→H, K→H, W→H, X→H, F→H, X→A, K→Q, S→H. Initially node Q was forbidden. A policy revision permits Q but a new obstruction forbids A. Find the shortest route from N to H after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",N→F→H,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""N\u2192A\u2192H"", ""new_forbidden"": ""A"", ""nodes"": 10, ""old_forbidden"": ""Q"", ""revised_route"": ""N\u2192F\u2192H""}" +AF-APER-02-0378,reconditioning-038,reconditioning,"Directed routes: C→Q, C→M, H→F, H→N, S→W, J→M, J→P, F→W, J→W, F→N, J→S, H→Q, W→N, P→N, C→N, J→H, H→C, S→N, J→F, J→C, M→N, Q→N, J→Q. Initially node S was forbidden. A policy revision permits S but a new obstruction forbids C. Find the shortest route from J to N after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",J→F→N,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""J\u2192C\u2192N"", ""new_forbidden"": ""C"", ""nodes"": 10, ""old_forbidden"": ""S"", ""revised_route"": ""J\u2192F\u2192N""}" +AF-APER-02-0379,reconditioning-039,reconditioning,"Directed routes: X→T, Y→C, T→A, Y→S, Y→X, U→N, X→Z, X→N, S→N, Y→T, Y→L, Y→A, T→S, C→N, Z→S, Z→N, Y→Z, Y→U, Y→M, U→T, T→N, U→C, M→N, A→N, L→N. Initially node Z was forbidden. A policy revision permits Z but a new obstruction forbids A. Find the shortest route from Y to N after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",Y→C→N,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""Y\u2192A\u2192N"", ""new_forbidden"": ""A"", ""nodes"": 11, ""old_forbidden"": ""Z"", ""revised_route"": ""Y\u2192C\u2192N""}" +AF-APER-02-0380,reconditioning-039,reconditioning,"Directed routes: T→H, S→W, K→W, S→B, S→K, N→H, K→V, V→T, U→H, S→N, W→U, N→C, B→U, E→H, C→T, S→T, B→V, V→H, S→V, S→C, S→E, S→U, K→H, B→H, C→H, W→H. Initially node N was forbidden. A policy revision permits N but a new obstruction forbids B. Find the shortest route from S to H after revision. If several shortest routes exist, select the lexicographically smallest node sequence. Respond as A→B→C (using the actual node labels).",S→C→H,Admissible paths exclude currently forbidden nodes,Release old exclusion and impose new exclusion,Exact path string,"{""initial_route"": ""S\u2192B\u2192H"", ""new_forbidden"": ""B"", ""nodes"": 11, ""old_forbidden"": ""N"", ""revised_route"": ""S\u2192C\u2192H""}"