{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006835531,0.0002975882,0.0003329251,0.0007206,0.0001178158,0.0003455193,0.000828404,0.0001532846,0.00001896443],"category_scores_gemma":[0.00002592735,0.0002445738,0.00003651603,0.0004573315,0.0007824398,0.0005776469,0.0003303092,0.0004442114,0.000003260673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303085,"about_ca_system_score_gemma":0.0005490246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002024892,"about_ca_topic_score_gemma":0.00004966296,"domain_scores_codex":[0.9975461,0.00003826751,0.0002732926,0.0009313663,0.0008734932,0.0003374547],"domain_scores_gemma":[0.9984951,0.0001629831,0.0001628539,0.0006662058,0.0003101043,0.0002027592],"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.00004155586,0.00003747465,0.0004524337,0.00003468512,0.00001300345,0.00005176069,0.00238975,0.3067202,0.00006619876,0.06065698,0.000007143745,0.6295288],"study_design_scores_gemma":[0.0005906358,0.001139809,0.0008555174,0.0004442588,0.000008241239,0.0001626882,0.000001579635,0.9773611,0.0003913806,0.01832051,0.0001793891,0.0005448446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00277901,0.0000829575,0.9946569,0.000188328,0.0003037961,0.000256679,0.00000404927,0.00006614484,0.001662093],"genre_scores_gemma":[0.6096181,0.00002267334,0.3899626,0.0002404174,0.00006030242,0.000002747732,0.000003937338,0.00001818262,0.00007102011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.670641,"threshold_uncertainty_score":0.9973431,"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."}}