{"id":"W1717727751","doi":"10.1016/j.dam.2015.07.036","title":"Contraction obstructions for connected graph searching","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Mitacs; University of British Columbia","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Mitacs","keywords":"Mathematics; Monotone polygon; Combinatorics; Connected component; Finite set; Bounded function; Discrete mathematics; Graph; Mixed graph; Strongly connected component; Induced subgraph; Contraction (grammar); Line graph; Voltage graph","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0004089208,0.0001093949,0.0001533475,0.0001036466,0.0001666849,0.0002089959,0.000345815,0.00005181698,0.000006948534],"category_scores_gemma":[0.0001392676,0.00009773372,0.00005144288,0.0002909318,0.00004116031,0.0002604714,0.00008108231,0.0001102364,0.00003194535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003390095,"about_ca_system_score_gemma":0.00006994024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003160595,"about_ca_topic_score_gemma":0.00000273155,"domain_scores_codex":[0.9990084,0.00001597681,0.0002387396,0.0002152001,0.0002681974,0.0002534771],"domain_scores_gemma":[0.9990094,0.0001965597,0.0001017956,0.0003502493,0.0001718532,0.0001701796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005329266,0.00004416929,0.000002151847,0.00003984812,0.00001946378,4.098905e-7,0.001935331,0.00238729,0.001397518,0.9909111,0.0008597276,0.002397638],"study_design_scores_gemma":[0.001112389,0.00005593229,0.00001312466,0.00001599575,0.00001268969,0.00001188544,0.001144428,0.5453852,0.001661514,0.447627,0.002735727,0.0002240427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001148484,0.000009844122,0.9849498,0.0004691028,0.0001481157,0.0006464099,0.000007224726,0.0002700294,0.01235101],"genre_scores_gemma":[0.1553358,0.000006068101,0.8440547,0.000116555,0.00005061885,0.0001915135,0.00002901531,0.00001904558,0.0001966853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5432841,"threshold_uncertainty_score":0.3985465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05334818489376948,"score_gpt":0.299537856910135,"score_spread":0.2461896720163655,"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."}}