{"id":"W4285773650","doi":"10.1016/j.tcs.2022.12.014","title":"The Maker-Breaker Largest Connected Subgraph game","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"European Research Council; Agence Nationale de la Recherche; H2020 European Research Council; Providence Health Care; University for the Creative Arts","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Connected component; Induced subgraph; Graph; Discrete mathematics; Factor-critical graph; Planar graph; Distance-hereditary graph; Graph power; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.005203391,0.0002485623,0.0002237808,0.0002981311,0.003682807,0.0008332814,0.00823984,0.0000324943,0.0001656066],"category_scores_gemma":[0.00025525,0.0001776321,0.0001291944,0.004491482,0.006373185,0.0006157741,0.006057683,0.0007650861,0.0001006568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001367254,"about_ca_system_score_gemma":0.0002569168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000340152,"about_ca_topic_score_gemma":0.000001356343,"domain_scores_codex":[0.994424,0.0007207812,0.0003585185,0.001078583,0.002041484,0.001376658],"domain_scores_gemma":[0.9956683,0.001501281,0.00009996101,0.002029934,0.0002996844,0.0004008601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002850879,0.00006654017,0.00007782404,0.000001684414,0.000006260099,0.00004031389,0.0002513707,0.000354151,0.0005322443,0.9775305,0.0001734418,0.02093719],"study_design_scores_gemma":[0.0003562451,0.0003812944,0.001172179,0.000004705573,0.000002832652,0.0001936254,0.00003174605,0.265164,0.001271201,0.7229826,0.008120936,0.0003185215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03740262,0.0001588609,0.9516558,0.005315783,0.001255876,0.0004132426,0.000007125649,0.0004568393,0.003333834],"genre_scores_gemma":[0.9805079,0.00001047902,0.01820152,0.001014032,0.00008004234,0.00007953137,0.000001272366,0.00001693585,0.00008825246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9431053,"threshold_uncertainty_score":0.9976143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01071599708364941,"score_gpt":0.2669679511793788,"score_spread":0.2562519540957294,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}