File size: 67,021 Bytes
39d58d6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 | id,family,challenge,expected_answer,relational_invariant,scoring_rule,metadata
AF-GENVAR-01-0127,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N1"",""N2""],[""N3"",""N0""],[""N3"",""N1""],[""N4"",""N2""],[""N5"",""N0""],[""N5"",""N1""],[""N6"",""N4""],[""N7"",""N0""],[""N7"",""N1""],[""N7"",""N5""]]},""candidate_edges"":[[""N7"",""N2""],[""N3"",""N2""],[""N6"",""N2""],[""N5"",""N2""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":10,""candidate_count"":4,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0258,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N3""],[""N1"",""N4""],[""N3"",""N5""],[""N3"",""N6""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N5""],[""N1"",""N6""],[""N3"",""N4""],[""N5"",""N6""]]}","{""distinct_consequential_outcomes"":4,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0210,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N6""],[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N4""],[""N2"",""N4""],[""N2"",""N5""],[""N2"",""N6""],[""N3"",""N6""],[""N4"",""N5""],[""N4"",""N6""]]},""candidate_edges"":[[""N0"",""N2""],[""N0"",""N5""],[""N1"",""N5""],[""N1"",""N6""],[""N3"",""N4""],[""N5"",""N6""]]}","{""distinct_consequential_outcomes"":3,""nonconsequential_candidates"":3}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":12,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0217,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N6""],[""N1"",""N7""],[""N2"",""N4""],[""N2"",""N6""],[""N3"",""N5""],[""N4"",""N5""],[""N4"",""N6""],[""N5"",""N6""],[""N5"",""N7""],[""N6"",""N7""]]},""candidate_edges"":[[""N0"",""N6""],[""N0"",""N7""],[""N2"",""N3""],[""N2"",""N7""],[""N3"",""N4""],[""N3"",""N7""]]}","{""distinct_consequential_outcomes"":2,""nonconsequential_candidates"":4}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":16,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0120,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N5""],[""N1"",""N7""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N4""],[""N4"",""N0""],[""N4"",""N5""],[""N6"",""N1""],[""N6"",""N3""],[""N6"",""N5""]]},""candidate_edges"":[[""N6"",""N4""],[""N2"",""N0""],[""N6"",""N0""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":13,""candidate_count"":3,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0069,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N5""],[""N1"",""N4""],[""N3"",""N4""],[""N5"",""N2""],[""N5"",""N8""],[""N6"",""N4""],[""N7"",""N5""]]},""proposed_edge"":[""N0"",""N6""]}","{""consequential"":true,""new_reachable_pairs"":1}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":10,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0158,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N4""],[""N2"",""N6""],[""N2"",""N7""],[""N2"",""N8""],[""N3"",""N1""],[""N3"",""N4""],[""N3"",""N5""],[""N4"",""N5""],[""N6"",""N5""],[""N7"",""N1""],[""N7"",""N3""],[""N7"",""N4""],[""N7"",""N8""]]},""candidate_edges"":[[""N7"",""N5""],[""N0"",""N5""],[""N2"",""N3""],[""N0"",""N4""],[""N2"",""N1""],[""N2"",""N5""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":16,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0034,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N1"",""N0""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N5""],[""N4"",""N3""],[""N6"",""N0""],[""N6"",""N1""]]},""proposed_edge"":[""N5"",""N4""]}","{""consequential"":true,""new_reachable_pairs"":2}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0286,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N6""],[""N1"",""N3""],[""N1"",""N5""],[""N1"",""N6""],[""N2"",""N4""],[""N3"",""N5""],[""N3"",""N6""],[""N4"",""N5""],[""N4"",""N6""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N5""],[""N1"",""N2""],[""N2"",""N3""],[""N2"",""N5""],[""N2"",""N6""],[""N3"",""N4""]]}","{""distinct_consequential_outcomes"":4,""nonconsequential_candidates"":3}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":10,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0324,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N4 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N1"",""N2""],[""N1"",""N4""],[""N2"",""N4""],[""N3"",""N4""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N4""],[""N1"",""N3""],[""N2"",""N3""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":3}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":5,""edge_count"":6,""candidate_count"":4,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0279,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N4""],[""N0"",""N5""],[""N3"",""N4""],[""N4"",""N5""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N3""],[""N0"",""N6""],[""N1"",""N2""],[""N2"",""N4""],[""N3"",""N6""]]}","{""distinct_consequential_outcomes"":3,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":5,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0375,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N7 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N5""],[""N0"",""N6""],[""N1"",""N3""],[""N1"",""N6""],[""N1"",""N7""],[""N2"",""N5""],[""N2"",""N7""],[""N3"",""N7""],[""N5"",""N6""],[""N6"",""N7""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N1"",""N4""],[""N2"",""N4""],[""N2"",""N6""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":4}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":8,""edge_count"":10,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0216,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N7""],[""N1"",""N2""],[""N1"",""N5""],[""N1"",""N6""],[""N2"",""N3""],[""N2"",""N4""],[""N6"",""N7""]]},""candidate_edges"":[[""N1"",""N3""],[""N1"",""N7""],[""N2"",""N5""],[""N3"",""N6""],[""N3"",""N7""],[""N4"",""N7""],[""N5"",""N6""]]}","{""distinct_consequential_outcomes"":5,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":9,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0358,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N7 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N6""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N7""],[""N2"",""N3""],[""N2"",""N7""],[""N3"",""N5""],[""N3"",""N6""],[""N4"",""N7""],[""N5"",""N7""]]},""candidate_edges"":[[""N0"",""N1""],[""N2"",""N4""],[""N2"",""N6""],[""N3"",""N7""],[""N4"",""N6""],[""N6"",""N7""]],""required_shortest_path_length"":3}","{""maximum_new_reachable_pairs"":1,""valid_extensions"":2}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":8,""edge_count"":11,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0013,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N4""],[""N0"",""N5""],[""N3"",""N1""],[""N3"",""N5""],[""N4"",""N2""],[""N4"",""N5""],[""N5"",""N1""],[""N6"",""N0""],[""N6"",""N5""]]},""proposed_edge"":[""N6"",""N1""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":10,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0338,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N6 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N4""],[""N1"",""N6""],[""N2"",""N4""],[""N4"",""N6""]]},""candidate_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N0"",""N6""],[""N1"",""N5""],[""N2"",""N3""],[""N3"",""N4""],[""N4"",""N5""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":4,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":7,""edge_count"":6,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0131,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N4""],[""N2"",""N5""],[""N2"",""N7""],[""N6"",""N7""],[""N7"",""N1""],[""N7"",""N3""],[""N7"",""N5""],[""N8"",""N0""],[""N8"",""N1""]]},""candidate_edges"":[[""N8"",""N5""],[""N2"",""N1""],[""N6"",""N1""],[""N2"",""N3""],[""N8"",""N3""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":15,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0219,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N4""],[""N1"",""N5""],[""N1"",""N6""],[""N2"",""N3""],[""N3"",""N4""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N5""],[""N1"",""N3""],[""N2"",""N4""],[""N2"",""N6""],[""N3"",""N6""],[""N5"",""N6""]]}","{""distinct_consequential_outcomes"":5,""nonconsequential_candidates"":3}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0371,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N6 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N4""],[""N0"",""N5""],[""N0"",""N6""],[""N2"",""N6""],[""N3"",""N4""],[""N4"",""N5""],[""N5"",""N6""]]},""candidate_edges"":[[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N5""],[""N1"",""N6""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N5""],[""N4"",""N6""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":4,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0206,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N6""],[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N6""],[""N2"",""N5""],[""N3"",""N4""],[""N4"",""N6""],[""N4"",""N7""],[""N5"",""N6""],[""N5"",""N7""],[""N6"",""N7""]]},""candidate_edges"":[[""N2"",""N3""],[""N2"",""N4""],[""N2"",""N6""],[""N3"",""N7""]]}","{""distinct_consequential_outcomes"":2,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":12,""candidate_count"":4,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0329,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N5""],[""N1"",""N2""],[""N1"",""N3""],[""N2"",""N3""],[""N2"",""N5""],[""N3"",""N4""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N4""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N4""],[""N4"",""N5""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":4,""valid_extensions"":5}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0039,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N5""],[""N6"",""N1""],[""N6"",""N2""],[""N6"",""N3""],[""N6"",""N4""],[""N6"",""N5""]]},""proposed_edge"":[""N5"",""N3""]}","{""consequential"":true,""new_reachable_pairs"":2}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0264,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N2""],[""N1"",""N2""],[""N2"",""N5""],[""N2"",""N6""],[""N3"",""N4""],[""N3"",""N6""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N6""],[""N2"",""N4""],[""N4"",""N6""]]}","{""distinct_consequential_outcomes"":5,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0062,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N2""],[""N1"",""N3""],[""N1"",""N5""],[""N1"",""N7""],[""N4"",""N0""],[""N4"",""N3""],[""N6"",""N7""],[""N7"",""N2""]]},""proposed_edge"":[""N1"",""N2""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":8,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0173,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N1"",""N7""],[""N1"",""N8""],[""N2"",""N0""],[""N3"",""N5""],[""N3"",""N8""],[""N4"",""N6""],[""N5"",""N4""],[""N6"",""N0""],[""N6"",""N2""],[""N6"",""N7""],[""N8"",""N0""]]},""candidate_edges"":[[""N5"",""N2""],[""N3"",""N0""],[""N5"",""N6""],[""N3"",""N4""],[""N1"",""N0""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":11,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0385,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N6 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N4""],[""N0"",""N5""],[""N0"",""N6""],[""N1"",""N2""],[""N2"",""N5""],[""N3"",""N5""],[""N3"",""N6""],[""N4"",""N5""],[""N4"",""N6""]]},""candidate_edges"":[[""N0"",""N2""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N6""],[""N5"",""N6""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":4,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":7,""edge_count"":9,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0119,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N8""],[""N1"",""N3""],[""N1"",""N8""],[""N2"",""N0""],[""N2"",""N3""],[""N2"",""N6""],[""N2"",""N8""],[""N3"",""N8""],[""N4"",""N0""],[""N4"",""N1""],[""N4"",""N7""],[""N5"",""N2""],[""N6"",""N1""],[""N7"",""N2""]]},""candidate_edges"":[[""N5"",""N7""],[""N1"",""N0""],[""N5"",""N8""],[""N6"",""N0""],[""N0"",""N3""],[""N5"",""N4""]]}","{""admissible_consequential_extensions"":5,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":14,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0142,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N6""],[""N0"",""N8""],[""N1"",""N3""],[""N2"",""N1""],[""N4"",""N1""],[""N5"",""N6""],[""N5"",""N7""],[""N6"",""N1""],[""N6"",""N3""],[""N7"",""N3""]]},""candidate_edges"":[[""N2"",""N3""],[""N0"",""N1""],[""N5"",""N1""],[""N4"",""N3""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":11,""candidate_count"":4,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0257,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N7""],[""N2"",""N6""],[""N3"",""N4""],[""N3"",""N5""],[""N3"",""N7""],[""N4"",""N6""],[""N4"",""N7""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N4""],[""N0"",""N6""],[""N1"",""N5""],[""N1"",""N7""]]}","{""distinct_consequential_outcomes"":3,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":8,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0164,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N2"",""N5""],[""N3"",""N5""],[""N4"",""N1""]]},""candidate_edges"":[[""N2"",""N3""],[""N2"",""N1""]]}","{""admissible_consequential_extensions"":2,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":3,""candidate_count"":2,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0053,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N8""],[""N1"",""N3""],[""N1"",""N4""],[""N3"",""N2""],[""N3"",""N8""],[""N4"",""N0""],[""N4"",""N5""],[""N5"",""N3""],[""N6"",""N5""],[""N7"",""N3""]]},""proposed_edge"":[""N6"",""N3""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":10,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0370,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N6 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N5""],[""N0"",""N6""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N5""],[""N3"",""N6""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N4""],[""N1"",""N2""],[""N1"",""N6""],[""N2"",""N6""],[""N3"",""N4""],[""N4"",""N5""],[""N4"",""N6""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":5}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":7,""edge_count"":12,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0070,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N1"",""N0""],[""N2"",""N3""],[""N4"",""N0""],[""N4"",""N3""],[""N5"",""N2""],[""N6"",""N1""]]},""proposed_edge"":[""N5"",""N0""]}","{""consequential"":true,""new_reachable_pairs"":1}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":6,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0278,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N3""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N6""],[""N3"",""N4""],[""N3"",""N5""],[""N4"",""N7""],[""N5"",""N6""],[""N5"",""N7""]]},""candidate_edges"":[[""N0"",""N4""],[""N0"",""N5""],[""N0"",""N7""],[""N1"",""N2""],[""N2"",""N4""],[""N3"",""N6""]]}","{""distinct_consequential_outcomes"":1,""nonconsequential_candidates"":5}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":9,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0045,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N1"",""N0""],[""N1"",""N6""],[""N2"",""N1""],[""N2"",""N4""],[""N2"",""N5""],[""N2"",""N6""],[""N5"",""N6""],[""N7"",""N0""],[""N7"",""N4""]]},""proposed_edge"":[""N2"",""N0""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":9,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0175,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N3"",""N0""],[""N3"",""N4""],[""N5"",""N1""],[""N5"",""N2""],[""N6"",""N7""],[""N7"",""N0""]]},""candidate_edges"":[[""N6"",""N0""],[""N4"",""N7""],[""N6"",""N4""],[""N6"",""N1""],[""N3"",""N7""],[""N1"",""N2""]]}","{""admissible_consequential_extensions"":5,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":6,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0201,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N3""],[""N1"",""N6""],[""N4"",""N5""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N6""],[""N1"",""N2""],[""N2"",""N5""],[""N3"",""N5""],[""N3"",""N6""]]}","{""distinct_consequential_outcomes"":5,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":6,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0310,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N6 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N4""],[""N0"",""N6""],[""N1"",""N4""],[""N2"",""N6""],[""N3"",""N5""],[""N4"",""N5""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N0"",""N3""],[""N1"",""N3""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N6""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0240,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N4""],[""N1"",""N2""],[""N2"",""N3""],[""N3"",""N6""],[""N4"",""N5""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N5""],[""N1"",""N3""],[""N1"",""N5""],[""N2"",""N4""],[""N3"",""N4""],[""N3"",""N5""]]}","{""distinct_consequential_outcomes"":5,""nonconsequential_candidates"":3}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0256,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N1"",""N2""],[""N1"",""N3""],[""N2"",""N3""],[""N3"",""N5""]]},""candidate_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N4""],[""N1"",""N5""],[""N4"",""N5""]]}","{""distinct_consequential_outcomes"":3,""nonconsequential_candidates"":3}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":5,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0359,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N5""],[""N1"",""N3""],[""N1"",""N4""],[""N2"",""N4""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N3""],[""N1"",""N2""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N5""],[""N3"",""N4""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":4}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0170,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N6""],[""N2"",""N0""],[""N2"",""N8""],[""N3"",""N7""],[""N4"",""N3""],[""N4"",""N7""],[""N5"",""N8""],[""N8"",""N0""]]},""candidate_edges"":[[""N5"",""N0""],[""N2"",""N6""],[""N8"",""N6""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":8,""candidate_count"":3,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0205,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N1"",""N2""],[""N1"",""N3""],[""N2"",""N4""],[""N3"",""N4""],[""N3"",""N6""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N2""],[""N0"",""N5""],[""N1"",""N4""],[""N2"",""N3""],[""N2"",""N6""],[""N4"",""N6""],[""N5"",""N6""]]}","{""distinct_consequential_outcomes"":4,""nonconsequential_candidates"":3}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":8,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0047,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N1"",""N0""],[""N3"",""N2""],[""N4"",""N0""],[""N4"",""N1""],[""N5"",""N1""],[""N5"",""N2""]]},""proposed_edge"":[""N5"",""N0""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0141,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N0"",""N3""],[""N4"",""N0""]]},""candidate_edges"":[[""N1"",""N2""],[""N4"",""N1""],[""N1"",""N3""],[""N4"",""N3""],[""N2"",""N3""],[""N4"",""N2""]]}","{""admissible_consequential_extensions"":3,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":5,""edge_count"":4,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0315,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N2"",""N3""],[""N2"",""N5""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N3""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N4""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":5}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":5,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0010,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N4"",""N0""],[""N5"",""N1""],[""N5"",""N3""]]},""proposed_edge"":[""N4"",""N1""]}","{""consequential"":true,""new_reachable_pairs"":1}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":3,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0305,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N7 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N1"",""N7""],[""N2"",""N6""],[""N3"",""N5""],[""N3"",""N7""],[""N4"",""N7""]]},""candidate_edges"":[[""N0"",""N5""],[""N0"",""N7""],[""N2"",""N3""],[""N2"",""N4""],[""N2"",""N5""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":3,""valid_extensions"":3}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":8,""edge_count"":7,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0108,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N3""],[""N1"",""N0""],[""N2"",""N3""],[""N3"",""N4""],[""N3"",""N5""]]},""candidate_edges"":[[""N0"",""N5""],[""N1"",""N5""],[""N2"",""N4""],[""N1"",""N4""],[""N0"",""N4""],[""N2"",""N5""],[""N1"",""N3""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":5,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0001,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N1"",""N4""],[""N2"",""N0""],[""N2"",""N3""],[""N3"",""N0""],[""N4"",""N2""]]},""proposed_edge"":[""N1"",""N0""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":5,""edge_count"":5,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0383,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N2""],[""N1"",""N3""],[""N2"",""N5""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N4""],[""N3"",""N5""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":4,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0110,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N1""],[""N1"",""N2""],[""N3"",""N0""],[""N3"",""N1""],[""N5"",""N1""],[""N5"",""N3""],[""N5"",""N4""]]},""candidate_edges"":[[""N5"",""N2""],[""N3"",""N4""],[""N4"",""N1""]]}","{""admissible_consequential_extensions"":2,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":7,""candidate_count"":3,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0321,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N4 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N1"",""N3""],[""N3"",""N4""]]},""candidate_edges"":[[""N0"",""N2""],[""N0"",""N4""],[""N1"",""N2""],[""N1"",""N4""],[""N2"",""N4""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":3}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":5,""edge_count"":4,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0079,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N2"",""N4""],[""N3"",""N5""],[""N3"",""N6""],[""N4"",""N0""],[""N5"",""N0""],[""N5"",""N1""],[""N5"",""N2""],[""N6"",""N1""],[""N6"",""N4""]]},""proposed_edge"":[""N3"",""N0""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":9,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0172,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N1""],[""N1"",""N4""],[""N4"",""N3""],[""N5"",""N0""],[""N5"",""N1""],[""N5"",""N2""],[""N5"",""N3""]]},""candidate_edges"":[[""N0"",""N4""],[""N5"",""N4""],[""N0"",""N3""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":7,""candidate_count"":3,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0296,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N2""],[""N2"",""N3""],[""N2"",""N5""],[""N2"",""N6""],[""N3"",""N5""],[""N3"",""N6""]]},""candidate_edges"":[[""N0"",""N5""],[""N0"",""N6""],[""N1"",""N3""],[""N1"",""N5""],[""N2"",""N4""],[""N3"",""N4""]]}","{""distinct_consequential_outcomes"":2,""nonconsequential_candidates"":4}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":8,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0035,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N1"",""N0""],[""N1"",""N3""],[""N2"",""N5""],[""N3"",""N0""],[""N4"",""N5""]]},""proposed_edge"":[""N4"",""N3""]}","{""consequential"":true,""new_reachable_pairs"":2}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":5,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0072,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N1""],[""N3"",""N1""],[""N4"",""N1""],[""N4"",""N2""],[""N5"",""N1""],[""N5"",""N2""],[""N5"",""N4""]]},""proposed_edge"":[""N4"",""N0""]}","{""consequential"":true,""new_reachable_pairs"":2}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":7,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0211,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N5""],[""N2"",""N5""],[""N3"",""N4""],[""N3"",""N5""]]},""candidate_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N4""],[""N2"",""N3""]]}","{""distinct_consequential_outcomes"":1,""nonconsequential_candidates"":4}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":8,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0396,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N4""],[""N2"",""N3""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N1""],[""N1"",""N2""],[""N1"",""N3""],[""N1"",""N5""],[""N2"",""N4""],[""N2"",""N5""],[""N3"",""N5""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0180,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N1"",""N2""],[""N1"",""N7""],[""N1"",""N8""],[""N2"",""N5""],[""N3"",""N7""],[""N3"",""N8""],[""N4"",""N0""],[""N4"",""N3""],[""N6"",""N2""],[""N8"",""N5""],[""N8"",""N7""]]},""candidate_edges"":[[""N6"",""N3""],[""N4"",""N5""],[""N3"",""N2""],[""N6"",""N8""],[""N7"",""N2""],[""N6"",""N7""]]}","{""admissible_consequential_extensions"":5,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":13,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0307,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N6 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N1"",""N5""],[""N1"",""N6""],[""N2"",""N4""],[""N3"",""N6""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N2""],[""N0"",""N5""],[""N0"",""N6""],[""N2"",""N3""],[""N2"",""N5""],[""N2"",""N6""],[""N3"",""N4""],[""N4"",""N5""]],""required_shortest_path_length"":2}","{""maximum_new_reachable_pairs"":5,""valid_extensions"":7}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0376,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N1"",""N3""],[""N1"",""N5""],[""N2"",""N4""],[""N3"",""N4""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N4""],[""N2"",""N3""],[""N2"",""N5""],[""N3"",""N5""]],""required_shortest_path_length"":3}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":2}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0076,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N4""],[""N0"",""N5""],[""N1"",""N4""],[""N2"",""N3""],[""N4"",""N2""]]},""proposed_edge"":[""N1"",""N2""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":6,""edge_count"":7,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0301,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N7 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N0"",""N4""],[""N0"",""N6""],[""N0"",""N7""],[""N1"",""N3""],[""N1"",""N4""],[""N3"",""N4""],[""N4"",""N5""],[""N4"",""N6""],[""N5"",""N6""],[""N5"",""N7""],[""N6"",""N7""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N2"",""N6""],[""N3"",""N6""],[""N4"",""N7""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":3}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":8,""edge_count"":11,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0193,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N8""],[""N1"",""N6""],[""N3"",""N4""],[""N3"",""N6""],[""N3"",""N8""],[""N4"",""N0""],[""N4"",""N1""],[""N4"",""N2""],[""N4"",""N5""],[""N4"",""N6""],[""N5"",""N0""],[""N5"",""N1""],[""N5"",""N8""],[""N7"",""N4""],[""N7"",""N5""],[""N8"",""N1""]]},""candidate_edges"":[[""N2"",""N6""],[""N2"",""N0""],[""N7"",""N6""],[""N2"",""N8""],[""N3"",""N0""],[""N0"",""N6""]]}","{""admissible_consequential_extensions"":3,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":17,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0346,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N5""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N4""],[""N2"",""N5""],[""N4"",""N5""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N4""],[""N1"",""N2""],[""N1"",""N3""],[""N2"",""N3""],[""N3"",""N4""],[""N3"",""N5""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":2,""valid_extensions"":6}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":8,""candidate_count"":7,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0152,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N0"",""N3""],[""N1"",""N3""]]},""candidate_edges"":[[""N1"",""N4""],[""N2"",""N0""],[""N1"",""N0""],[""N4"",""N3""],[""N2"",""N4""]]}","{""admissible_consequential_extensions"":5,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":5,""edge_count"":2,""candidate_count"":5,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0023,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N5""],[""N0"",""N6""],[""N2"",""N0""],[""N2"",""N4""],[""N2"",""N7""],[""N2"",""N8""],[""N3"",""N6""],[""N4"",""N8""],[""N7"",""N5""],[""N8"",""N3""]]},""proposed_edge"":[""N4"",""N6""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":11,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0033,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N1"",""N0""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N1""],[""N4"",""N7""],[""N5"",""N0""],[""N6"",""N0""],[""N6"",""N7""],[""N8"",""N0""],[""N8"",""N1""],[""N8"",""N2""],[""N8"",""N4""]]},""proposed_edge"":[""N3"",""N6""]}","{""consequential"":true,""new_reachable_pairs"":4}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":12,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0241,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7""],""directed_edges"":[[""N1"",""N3""],[""N2"",""N3""],[""N2"",""N7""],[""N3"",""N4""],[""N4"",""N5""],[""N4"",""N7""],[""N5"",""N6""],[""N5"",""N7""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N4""],[""N3"",""N6""],[""N3"",""N7""]]}","{""distinct_consequential_outcomes"":4,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":8,""edge_count"":8,""candidate_count"":6,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0038,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N3""],[""N1"",""N3""],[""N2"",""N0""],[""N2"",""N4""],[""N4"",""N1""],[""N4"",""N5""],[""N4"",""N6""],[""N5"",""N3""]]},""proposed_edge"":[""N0"",""N5""]}","{""consequential"":true,""new_reachable_pairs"":1}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":8,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0105,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N0"",""N3""],[""N0"",""N4""],[""N2"",""N4""]]},""candidate_edges"":[[""N2"",""N1""],[""N0"",""N2""]]}","{""admissible_consequential_extensions"":2,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":5,""edge_count"":3,""candidate_count"":2,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0274,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4""],""directed_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N1"",""N2""],[""N2"",""N3""],[""N2"",""N4""]]},""candidate_edges"":[[""N0"",""N1""],[""N1"",""N3""],[""N1"",""N4""],[""N3"",""N4""]]}","{""distinct_consequential_outcomes"":2,""nonconsequential_candidates"":2}",Directed reachability closure,strict_json_object,"{""node_count"":5,""edge_count"":5,""candidate_count"":4,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0116,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N6""],[""N4"",""N2""],[""N4"",""N6""]]},""candidate_edges"":[[""N4"",""N3""],[""N2"",""N1""],[""N5"",""N6""],[""N5"",""N4""]]}","{""admissible_consequential_extensions"":4,""open"":true}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":3,""candidate_count"":4,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0003,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N8""],[""N2"",""N3""],[""N2"",""N7""],[""N4"",""N1""],[""N4"",""N2""],[""N4"",""N8""],[""N5"",""N7""],[""N6"",""N7""],[""N6"",""N8""],[""N7"",""N1""],[""N7"",""N3""],[""N8"",""N1""],[""N8"",""N7""]]},""proposed_edge"":[""N6"",""N3""]}","{""consequential"":false,""new_reachable_pairs"":0}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":13,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0214,generative_branching,"{""instruction"":""Each candidate is an independent one-edge extension of the SAME base graph. Count distinct nonempty sets of newly reachable ordered pairs, identifying identical effects as one outcome. Also count candidates that change no reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6""],""directed_edges"":[[""N0"",""N1""],[""N1"",""N3""],[""N1"",""N4""],[""N2"",""N3""],[""N2"",""N5""],[""N3"",""N5""],[""N5"",""N6""]]},""candidate_edges"":[[""N0"",""N2""],[""N0"",""N3""],[""N0"",""N5""],[""N1"",""N2""],[""N1"",""N5""],[""N1"",""N6""],[""N2"",""N6""],[""N4"",""N5""]]}","{""distinct_consequential_outcomes"":3,""nonconsequential_candidates"":5}",Directed reachability closure,strict_json_object,"{""node_count"":7,""edge_count"":7,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0012,consequential_differentiation,"{""instruction"":""Add the proposed directed edge. Is this a consequential change in transitive reachability? Count newly reachable ordered node pairs. Do not count mere edge-list changes."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N7""],[""N1"",""N4""],[""N1"",""N5""],[""N2"",""N0""],[""N2"",""N6""],[""N2"",""N7""],[""N4"",""N5""],[""N8"",""N1""],[""N8"",""N3""],[""N8"",""N4""],[""N8"",""N7""]]},""proposed_edge"":[""N7"",""N6""]}","{""consequential"":true,""new_reachable_pairs"":3}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":11,""candidate_count"":1,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0160,nonclosure_detection,"{""instruction"":""Within the supplied finite candidate set, is consequential differentiation still open? Count candidate single-edge additions that increase transitive reachability."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5"",""N6"",""N7"",""N8""],""directed_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N5""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N4""],[""N3"",""N4""],[""N3"",""N5""],[""N6"",""N2""],[""N6"",""N5""],[""N8"",""N0""],[""N8"",""N3""],[""N8"",""N4""]]},""candidate_edges"":[[""N8"",""N1""],[""N6"",""N3""],[""N0"",""N4""]]}","{""admissible_consequential_extensions"":0,""open"":false}",Directed reachability closure,strict_json_object,"{""node_count"":9,""edge_count"":13,""candidate_count"":3,""certificate"":""exhaustive finite graph enumeration""}"
AF-GENVAR-01-0351,invariant_preserving_novelty,"{""instruction"":""Find candidate one-edge extensions that preserve the shortest directed path length from N0 to N5 while adding at least one newly reachable ordered pair. Count them and report the maximum number of newly reachable pairs among valid extensions."",""base_graph"":{""nodes"":[""N0"",""N1"",""N2"",""N3"",""N4"",""N5""],""directed_edges"":[[""N0"",""N5""],[""N1"",""N2""],[""N1"",""N5""],[""N2"",""N3""],[""N2"",""N5""],[""N3"",""N5""]]},""candidate_edges"":[[""N0"",""N1""],[""N0"",""N3""],[""N0"",""N4""],[""N1"",""N3""],[""N1"",""N4""],[""N2"",""N4""],[""N3"",""N4""],[""N4"",""N5""]],""required_shortest_path_length"":1}","{""maximum_new_reachable_pairs"":3,""valid_extensions"":7}",Shortest-path length N0 to terminal node,strict_json_object,"{""node_count"":6,""edge_count"":6,""candidate_count"":8,""certificate"":""exhaustive finite graph enumeration""}"
|