{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001282161,0.0004302323,0.0004071286,0.001624649,0.0003551537,0.0008263681,0.003138728,0.0002296123,0.00003168315],"category_scores_gemma":[0.0001619929,0.0003817077,0.0001398294,0.001104313,0.0008224719,0.000427201,0.001089022,0.001026796,0.0002144956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001431068,"about_ca_system_score_gemma":0.0005648799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001355324,"about_ca_topic_score_gemma":0.00006827198,"domain_scores_codex":[0.9959564,0.0000612305,0.0004228277,0.001426816,0.001366716,0.0007660205],"domain_scores_gemma":[0.9973783,0.000849392,0.0001556666,0.001164961,0.0002022186,0.0002494925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004221485,0.00002355587,0.00001181717,0.00002306623,0.00001164924,0.0001332717,0.0007260418,0.2467417,0.00006691754,0.2110474,0.0000644843,0.5411459],"study_design_scores_gemma":[0.0002745957,0.0002410169,0.00006435836,0.0003803693,0.000002104259,0.00002194147,1.94964e-7,0.7295316,0.0002089849,0.268203,0.0005756816,0.0004961949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001137416,0.00003519429,0.9802144,0.002203101,0.001174989,0.0003904457,0.00000660623,0.0004502511,0.01551366],"genre_scores_gemma":[0.09676453,0.0002821365,0.8872159,0.006554846,0.0008340615,0.00003762975,0.00002942344,0.0001595663,0.008121875],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5406497,"threshold_uncertainty_score":0.9998635,"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."}}