{"id":"W1991356098","doi":"10.1016/j.tcs.2013.04.015","title":"Fast–mixed searching and related problems on graphs","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Mixed graph; Combinatorics; Search algorithm; Graph; Degree (music); Search problem; Planar graph; Computer science; Discrete mathematics; Algorithm; Line 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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001420686,0.0001669555,0.000159703,0.0003086199,0.0005379007,0.001126589,0.001556162,0.00005051049,0.0001051922],"category_scores_gemma":[0.00008252836,0.0001264667,0.00003860061,0.00130834,0.002160283,0.001068336,0.001024801,0.0003242365,0.0002810009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002792586,"about_ca_system_score_gemma":0.00006859736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006598842,"about_ca_topic_score_gemma":2.015712e-7,"domain_scores_codex":[0.997438,0.0001870686,0.0002551192,0.000733455,0.0007492265,0.0006371342],"domain_scores_gemma":[0.9984501,0.000238989,0.00004882468,0.0006102365,0.0002036767,0.0004481985],"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":[7.410018e-7,0.00003645033,0.00004018356,0.000005685364,0.000002565153,0.000002184421,0.0005957309,0.001650996,0.0003138038,0.9332373,0.00006306286,0.06405129],"study_design_scores_gemma":[0.0001673787,0.0002075965,0.001359425,0.00002732663,6.625203e-7,0.00001957595,0.000004730929,0.6646808,0.0002670436,0.333112,0.00002228837,0.0001312325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04408246,0.00001419067,0.9370773,0.0040951,0.0003353328,0.0004710951,4.061821e-7,0.0003240452,0.0136],"genre_scores_gemma":[0.8963643,0.00001062228,0.102985,0.000547499,0.00001539848,0.00001668601,5.155204e-7,0.000007634318,0.00005236611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8522818,"threshold_uncertainty_score":0.9999104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01041735476262332,"score_gpt":0.2373964802332688,"score_spread":0.2269791254706455,"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."}}