{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001932273,0.001133034,0.001920675,0.0007436873,0.002117638,0.00308333,0.003377977,0.004212869,0.01680427],"category_scores_gemma":[0.01124015,0.0006398924,0.0008400373,0.0008935329,0.002193573,0.005045258,0.002613831,0.003338381,0.001303494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001490003,"about_ca_system_score_gemma":0.001943922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00185806,"about_ca_topic_score_gemma":0.002306385,"domain_scores_codex":[0.9980146,0.001036886,0.00005356872,0.0003356939,0.0002532876,0.0003059888],"domain_scores_gemma":[0.9942189,0.003775234,0.0003450733,0.0004314918,0.0002216914,0.001007519],"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.00123738,0.0003204081,0.0007635273,0.0003191166,0.0001492229,0.0005931283,0.0006124437,0.06338807,0.005110363,0.8838779,0.01881794,0.02481045],"study_design_scores_gemma":[0.0003085336,0.0001601337,0.0002881598,0.00002656378,0.00005966441,0.0001982903,0.000271773,0.1678931,0.001371629,0.8230777,0.006311459,0.00003293487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4215473,0.0005947669,0.4120096,0.0102679,0.0004155097,0.0006087112,0.001156016,0.0006287888,0.1527715],"genre_scores_gemma":[0.9195304,0.0003965147,0.0455988,0.0006347506,0.0001224286,0.0002376058,0.0003745322,0.0001391595,0.03296589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01680427,"threshold_uncertainty_score":0.05621588,"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."}}