{"id":"W4226482498","doi":"10.1016/j.tcs.2022.04.002","title":"An efficient oracle for counting shortest paths in planar graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Oracle; Combinatorics; Planar graph; Shortest path problem; Voronoi diagram; Vertex (graph theory); Mathematics; Discrete mathematics; Data structure; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003361171,0.0001503956,0.0001683148,0.0003539063,0.0008067674,0.0005947283,0.003971282,0.00001636842,0.00002506569],"category_scores_gemma":[0.00003281626,0.0001416903,0.00004710586,0.001813584,0.0006734431,0.0007085743,0.001362813,0.0001826215,0.000008930889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000788922,"about_ca_system_score_gemma":0.00007778575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000783875,"about_ca_topic_score_gemma":0.000001428357,"domain_scores_codex":[0.9972827,0.0001009233,0.0002716099,0.0008754184,0.0008078594,0.0006614582],"domain_scores_gemma":[0.9986937,0.0001809175,0.00006302707,0.0008366978,0.00006730686,0.0001583215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006104915,0.0001793095,0.000172998,0.000003722167,0.000001310845,0.00002014464,0.0003257272,0.00542532,0.000124328,0.9610471,0.00005447284,0.0326395],"study_design_scores_gemma":[0.0002614453,0.0003348072,0.0009792306,0.00000599085,0.000002205575,0.000009368788,0.00004007012,0.9273008,0.0001492286,0.07024491,0.0004657903,0.0002061187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05817122,0.00001362778,0.9396067,0.0004557028,0.0006935421,0.000346156,0.00001544547,0.000163587,0.0005340433],"genre_scores_gemma":[0.8383157,6.476042e-7,0.1610382,0.0005349477,0.00004564539,0.00004585347,0.000008411875,0.000007085705,0.000003499493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9218755,"threshold_uncertainty_score":0.7379696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01082355560255529,"score_gpt":0.2515598887280446,"score_spread":0.2407363331254893,"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."}}