{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411201,0.0009776461,0.001818011,0.001761866,0.002073215,0.004668416,0.002681728,0.002569608,0.01332352],"category_scores_gemma":[0.01605029,0.0007624279,0.0008409583,0.004509902,0.001778672,0.0136257,0.004990335,0.003353799,0.001883668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107223,"about_ca_system_score_gemma":0.001317319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005365726,"about_ca_topic_score_gemma":0.005775039,"domain_scores_codex":[0.9976135,0.0005564092,0.0001329397,0.0005345569,0.0006022018,0.0005603454],"domain_scores_gemma":[0.9881016,0.008771468,0.000688331,0.00120416,0.0006894991,0.000544898],"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.003844461,0.000908915,0.007486527,0.001543613,0.0001877955,0.00119699,0.003215604,0.1010063,0.01777486,0.6287759,0.06804156,0.1660175],"study_design_scores_gemma":[0.0001904978,0.00008727873,0.0009844792,0.00005108656,0.0000837688,0.0003204346,0.001151235,0.1625613,0.007114802,0.8149033,0.01251509,0.0000368455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6397703,0.002551429,0.2712559,0.01087703,0.0003596536,0.0004349576,0.005375842,0.003392241,0.06598262],"genre_scores_gemma":[0.8885148,0.001201623,0.07247469,0.0009407717,0.0003270211,0.000164242,0.005166868,0.001047758,0.03016244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01332352,"threshold_uncertainty_score":0.04457158,"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."}}