{"id":"W1793630144","doi":"10.1007/978-3-319-23219-5_29","title":"Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Upper and lower bounds; Computer science; Path (computing); Mathematical optimization; Relaxation (psychology); Graph; Longest path problem; Constraint (computer-aided design); Shortest path problem; Theoretical computer science; Mathematics; Artificial intelligence","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.001107626,0.002241655,0.002022277,0.00116751,0.001171948,0.002467431,0.003381369,0.003210106,0.008428697],"category_scores_gemma":[0.006794738,0.001432421,0.00166785,0.001601508,0.002474789,0.003836376,0.00342583,0.003471428,0.0009872284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002787887,"about_ca_system_score_gemma":0.00169641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008860713,"about_ca_topic_score_gemma":0.006590921,"domain_scores_codex":[0.9987356,0.0004501046,0.00003406332,0.000262705,0.000277949,0.0002395067],"domain_scores_gemma":[0.9971268,0.002260591,0.0001260452,0.0001493029,0.0001329419,0.0002044393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001148064,0.00006200318,0.0002218887,0.0001844439,0.00004442846,0.00009863467,0.0001161792,0.7943818,0.001187611,0.1798079,0.004934802,0.01884542],"study_design_scores_gemma":[0.00001482497,0.00002751667,0.0000778873,0.00002488122,0.00001176739,0.00002975369,0.00002542552,0.8503364,0.0002112253,0.147715,0.001513499,0.00001168003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04415133,0.0007072809,0.913681,0.0009110014,0.0001408056,0.000126882,0.0002692671,0.0004354054,0.03957706],"genre_scores_gemma":[0.5118248,0.001228335,0.4526362,0.0003598152,0.0002033567,0.0004275655,0.0006029565,0.0006399253,0.03207691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008860713,"threshold_uncertainty_score":0.02819681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02627997570309267,"score_gpt":0.263332280487377,"score_spread":0.2370523047842843,"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."}}