{"id":"W2952754000","doi":"10.7155/jgaa.00421","title":"Lower Bounds for Graph Exploration Using Local Policies","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounded function; Graph; Computer science; Abstraction; Exponential function; Theoretical computer science; Enhanced Data Rates for GSM Evolution; Robot; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0005378976,0.0001872332,0.0003175168,0.0004293683,0.0006382595,0.000890915,0.0008720455,0.0001634681,0.00000199538],"category_scores_gemma":[0.00002494504,0.0001653141,0.0002155832,0.0002384537,0.0002064667,0.0006935433,0.0003213472,0.0003615254,6.688314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003801782,"about_ca_system_score_gemma":0.0002980183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003341509,"about_ca_topic_score_gemma":0.000005963935,"domain_scores_codex":[0.998629,0.00003466097,0.0005253351,0.0002842656,0.0003086804,0.0002180966],"domain_scores_gemma":[0.9973639,0.00006118194,0.0008732713,0.0005351451,0.0009822974,0.0001841673],"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.0000456612,0.0007898962,0.0001601349,0.0004222645,0.0005206533,0.00001020444,0.002176038,0.116385,0.0004697654,0.2717833,0.005124452,0.6021126],"study_design_scores_gemma":[0.0008746068,0.0002608943,0.000173651,0.0002125857,0.00009925823,0.00008926757,0.000192426,0.4618252,0.0002077034,0.4976819,0.0379005,0.0004820018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002079336,0.0007802626,0.9959007,0.002019629,0.0003725722,0.0005460707,0.0000319201,0.00002572561,0.0001151944],"genre_scores_gemma":[0.0611298,0.004596781,0.9321246,0.0003266253,0.001189043,0.0003420059,0.00003758294,0.00004485884,0.0002086741],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6016306,"threshold_uncertainty_score":0.8591114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06704610915214952,"score_gpt":0.3427686469278052,"score_spread":0.2757225377756556,"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."}}