{"id":"W4205679529","doi":"10.1007/978-3-030-93176-6_35","title":"An Efficient Oracle for Counting Shortest Paths in Planar Graphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Voronoi diagram; Planar graph; Shortest path problem; Mathematics; Path (computing); Binary logarithm; Planar; Discrete mathematics; Computer science; Graph; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002201637,0.002260633,0.003149858,0.002143779,0.001298516,0.00552499,0.006959876,0.00352936,0.02146043],"category_scores_gemma":[0.01491649,0.001681436,0.001917174,0.00688221,0.001762183,0.01587324,0.006441431,0.005926986,0.005897358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002598234,"about_ca_system_score_gemma":0.003584467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002642613,"about_ca_topic_score_gemma":0.004102962,"domain_scores_codex":[0.9951567,0.0009061431,0.0004676335,0.0009774719,0.00193121,0.0005608457],"domain_scores_gemma":[0.9844765,0.009875654,0.0004937422,0.003574682,0.001010416,0.0005689493],"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.002054824,0.0008887912,0.002200349,0.001745983,0.0001595066,0.0003288355,0.0004414163,0.04178857,0.03070916,0.1576015,0.07372327,0.6883578],"study_design_scores_gemma":[0.0007503276,0.0004634972,0.002380432,0.0002440496,0.0003184635,0.001087725,0.0005085931,0.4321297,0.02468583,0.488813,0.04841202,0.000206455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04552281,0.002199776,0.8964543,0.002423035,0.0006069112,0.0005201732,0.005148456,0.01432372,0.0328009],"genre_scores_gemma":[0.2496929,0.001569323,0.7085631,0.0008568921,0.0007014252,0.0008564848,0.01189311,0.002276803,0.02358997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02146043,"threshold_uncertainty_score":0.07179236,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02233131585826487,"score_gpt":0.2918757310423811,"score_spread":0.2695444151841162,"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."}}