{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002290519,0.0009292003,0.002202558,0.002118913,0.002247086,0.002623163,0.002682621,0.002547866,0.01249719],"category_scores_gemma":[0.02402884,0.0008680439,0.001501927,0.002381902,0.004802687,0.006082074,0.005439711,0.005805669,0.000681741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001860894,"about_ca_system_score_gemma":0.001573962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00257755,"about_ca_topic_score_gemma":0.002483608,"domain_scores_codex":[0.9986518,0.0005556571,0.00005753179,0.0002104325,0.0003308693,0.0001938089],"domain_scores_gemma":[0.9884039,0.008848316,0.0005439109,0.000731379,0.0004273664,0.001045129],"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.00007453344,0.00003327641,0.0001662134,0.00008810012,0.00001225879,0.00005005581,0.000138074,0.01722586,0.0004163033,0.9718169,0.002766714,0.007211708],"study_design_scores_gemma":[0.00003436949,0.00001956937,0.0001007056,0.0000193854,0.000009340026,0.00003862084,0.00004286748,0.1000491,0.0001659791,0.8977014,0.00180733,0.00001119306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1497114,0.002256826,0.7692838,0.005740235,0.0004950234,0.0001799187,0.0004560239,0.0007603673,0.07111634],"genre_scores_gemma":[0.8148021,0.001574198,0.1412955,0.001042901,0.0005353433,0.0004859617,0.000564712,0.0007122614,0.03898691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249719,"threshold_uncertainty_score":0.04180723,"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."}}