{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079506,0.001160503,0.001308209,0.002714377,0.003518765,0.003675646,0.001988441,0.002040815,0.008243455],"category_scores_gemma":[0.004851013,0.0008622388,0.001290191,0.003801584,0.005957292,0.009782222,0.004037449,0.004968771,0.0007919242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002498921,"about_ca_system_score_gemma":0.0008991431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00315524,"about_ca_topic_score_gemma":0.003788895,"domain_scores_codex":[0.9991711,0.000248628,0.00003921069,0.0001871549,0.000161964,0.0001919534],"domain_scores_gemma":[0.9966433,0.001954868,0.0003683989,0.0003383189,0.0002728864,0.0004222281],"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.0000188711,0.00001793504,0.0001775931,0.00003355467,0.000005295366,0.00004908202,0.0002538977,0.001308709,0.0002683666,0.9941895,0.0008413498,0.002835911],"study_design_scores_gemma":[0.000005029984,0.000004685984,0.00009439458,0.00001142582,0.000004336022,0.0000204005,0.00009530865,0.001987469,0.00007191386,0.996672,0.001029162,0.000003846815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4655165,0.002947299,0.3271712,0.00697978,0.0004020066,0.0001581236,0.0006351627,0.0003319032,0.195858],"genre_scores_gemma":[0.9156324,0.003068748,0.04009464,0.001238511,0.0005178231,0.0002624988,0.00117302,0.0002529661,0.0377594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008243455,"threshold_uncertainty_score":0.02757704,"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."}}