{"id":"W2951101008","doi":"10.48550/arxiv.1410.8756","title":"Contraction Obstructions for Connected Graph Searching","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Mitacs; University of British Columbia","funders":"","keywords":"Monotone polygon; Mathematics; Combinatorics; Connected component; Finite set; Bounded function; Contraction (grammar); Strongly connected component; Graph; Discrete mathematics; Mixed graph; Induced subgraph; Line graph; Voltage graph","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.001408683,0.0007322301,0.001411546,0.001458751,0.001255422,0.002346915,0.001643155,0.001287763,0.007229542],"category_scores_gemma":[0.01029086,0.0005312628,0.001635782,0.001285605,0.003487611,0.004703533,0.003358953,0.002772525,0.0004206305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139475,"about_ca_system_score_gemma":0.0009990551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001364639,"about_ca_topic_score_gemma":0.001392551,"domain_scores_codex":[0.9986318,0.0003710564,0.00007024663,0.0002913206,0.0003321884,0.0003034384],"domain_scores_gemma":[0.9921354,0.005035428,0.0006762562,0.0006848136,0.0002418249,0.001226157],"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.0003025397,0.0001152729,0.001684125,0.0001985379,0.00005221804,0.000265887,0.0004310516,0.05738326,0.004035573,0.9209675,0.001659589,0.01290444],"study_design_scores_gemma":[0.000066515,0.0001005821,0.0008423896,0.00003464146,0.00003453657,0.0001718006,0.0001389136,0.2553347,0.001292196,0.7390258,0.002924617,0.00003336315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5852794,0.000519451,0.376094,0.001506918,0.00006946122,0.0001809524,0.0005505329,0.0004338419,0.03536536],"genre_scores_gemma":[0.9478488,0.0003019447,0.04395346,0.0002236031,0.00006417857,0.0002147841,0.0004288889,0.0001247089,0.006839496],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007229542,"threshold_uncertainty_score":0.02418518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08985249067486402,"score_gpt":0.212596372958487,"score_spread":0.122743882283623,"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."}}