{"id":"W3208757949","doi":"10.1007/s00453-022-01045-4","title":"Shortest Beer Path Queries in Outerplanar Graphs","year":2022,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ackermann function; Combinatorics; Mathematics; Path graph; Shortest path problem; Graph; Distance; Inverse; Wheel graph; Discrete mathematics; Graph power; Line graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008463791,0.0004203393,0.0005232129,0.0007481046,0.000184635,0.0002279637,0.003786861,0.0002149493,0.0001653815],"category_scores_gemma":[0.0000846478,0.0004483236,0.0002160861,0.0009459509,0.0001930956,0.000340307,0.006185737,0.001984101,0.00004292137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002073749,"about_ca_system_score_gemma":0.0002916329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002120553,"about_ca_topic_score_gemma":0.00005256056,"domain_scores_codex":[0.9961539,0.0003775174,0.0004950561,0.001330796,0.0008668801,0.0007758681],"domain_scores_gemma":[0.9972756,0.0002721534,0.0001595957,0.002021693,0.00009225928,0.0001787258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008405344,0.0008090553,0.01102884,0.0002446627,0.0002859871,0.003584966,0.006034595,0.005315739,0.0002017836,0.6803206,0.005288037,0.2868016],"study_design_scores_gemma":[0.0005172673,0.000223646,0.005471207,0.0001256003,0.00001326017,0.00006098687,0.0002315678,0.03993663,0.000316474,0.9224233,0.02936996,0.001310107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04726456,0.004282966,0.9153967,0.006390228,0.006842834,0.003502124,0.0007289122,0.001932456,0.01365917],"genre_scores_gemma":[0.588618,0.000851882,0.4027906,0.001351541,0.000410865,0.002230935,0.0004833915,0.0002378584,0.003024936],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5413535,"threshold_uncertainty_score":0.9997969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02035405418938419,"score_gpt":0.295687206561516,"score_spread":0.2753331523721318,"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."}}