{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002934027,0.001916945,0.003119596,0.002477144,0.001208858,0.005869945,0.006436293,0.003741224,0.01332636],"category_scores_gemma":[0.02386702,0.001312701,0.001450288,0.006797458,0.001889498,0.01512263,0.00597243,0.004827236,0.003124269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002546975,"about_ca_system_score_gemma":0.004513843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003309499,"about_ca_topic_score_gemma":0.004824099,"domain_scores_codex":[0.9941878,0.001204423,0.0006715584,0.0013175,0.001879947,0.0007387847],"domain_scores_gemma":[0.9745364,0.01601896,0.001141417,0.005526724,0.00165386,0.00112263],"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.004223868,0.00133735,0.006456416,0.002323129,0.000247258,0.0004554848,0.0006709159,0.09100002,0.03648608,0.1296534,0.05166179,0.6754842],"study_design_scores_gemma":[0.0009097754,0.0005016905,0.002528722,0.0001623712,0.0003064898,0.0008284702,0.0005319267,0.6545379,0.0201892,0.3031868,0.01614547,0.0001711909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08945737,0.001634401,0.8753163,0.002887486,0.0004106397,0.0004329793,0.005145281,0.01211365,0.01260204],"genre_scores_gemma":[0.4327038,0.0008842424,0.5474088,0.0006863649,0.0004428261,0.0005642464,0.009056839,0.00122462,0.007028317],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01332636,"threshold_uncertainty_score":0.04458106,"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."}}