{"id":"W4386155733","doi":"10.1007/978-3-031-39344-0_18","title":"Constrained Graph Searching on Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Path graph; Computer science; Distance; Wheel graph; Graph; Time complexity; Mathematics; Discrete mathematics; Graph power; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292703,0.0006729449,0.001013777,0.001012858,0.0004969716,0.001017373,0.00133259,0.001003913,0.01944639],"category_scores_gemma":[0.002423963,0.0005646771,0.0005091769,0.003100215,0.0007247715,0.002127683,0.001435668,0.001474198,0.002830277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007461748,"about_ca_system_score_gemma":0.0005896706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002522235,"about_ca_topic_score_gemma":0.003322906,"domain_scores_codex":[0.9997094,0.00007895374,0.000009900992,0.00006452896,0.000105601,0.00003161979],"domain_scores_gemma":[0.9994084,0.0003767762,0.00003008102,0.0001011234,0.00005124617,0.00003244888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001425105,0.0001048171,0.0002130478,0.0005422625,0.00004733264,0.0001062142,0.0001216477,0.2482107,0.005052862,0.3204495,0.05350472,0.3715044],"study_design_scores_gemma":[0.00003643441,0.00005316039,0.0002295788,0.0001128125,0.00001669351,0.0001395329,0.0000580852,0.5056088,0.002212389,0.4512865,0.04022414,0.00002181242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01883041,0.004391434,0.8635879,0.0008910362,0.0002760536,0.0001170255,0.000625263,0.001085705,0.1101952],"genre_scores_gemma":[0.2200324,0.004811386,0.6854718,0.0005407651,0.0002330793,0.0003068651,0.001793049,0.001308516,0.0855021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01944639,"threshold_uncertainty_score":0.06505471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03391685590947484,"score_gpt":0.2761777690574971,"score_spread":0.2422609131480222,"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."}}