{"id":"W2011663983","doi":"10.1016/s0012-365x(00)00127-8","title":"On constructible graphs, infinite bridged graphs and weakly cop-win graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Induced subgraph; Retract; Graph; Discrete mathematics; Bipartite graph; Pure mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062068,0.0003947832,0.0004658392,0.0004939511,0.0003694305,0.0003415375,0.001075652,0.0001209898,0.0001914817],"category_scores_gemma":[0.0001353812,0.0003432876,0.0001799838,0.00135636,0.0006275946,0.0005560398,0.0002243988,0.0004323879,0.000173487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002259236,"about_ca_system_score_gemma":0.00004712302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001061988,"about_ca_topic_score_gemma":0.000005872114,"domain_scores_codex":[0.997242,0.0001563463,0.0005247299,0.0006648703,0.0007134921,0.0006985165],"domain_scores_gemma":[0.9975104,0.0006659732,0.0001561577,0.001261756,0.00009737683,0.0003083266],"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.00002658254,0.00007886238,0.0002706186,0.00008536948,0.00005024728,0.000028918,0.0009640931,0.00004358147,0.000524867,0.9866744,0.0003908718,0.01086163],"study_design_scores_gemma":[0.0006730433,0.0002317066,0.0004821847,0.000137323,0.00001626258,0.0001068011,0.0001515578,0.006171423,0.00170036,0.9893331,0.000548851,0.0004473867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9349084,0.0003333743,0.03266198,0.000416244,0.0001824581,0.000800696,0.00005967081,0.0005836633,0.03005352],"genre_scores_gemma":[0.9183763,0.0004296002,0.07948248,0.0004297286,0.00001529191,0.00006383804,0.00001402062,0.00006895791,0.001119835],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0468205,"threshold_uncertainty_score":0.9999019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01628350846004417,"score_gpt":0.2735630802026106,"score_spread":0.2572795717425664,"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."}}