{"id":"W2889518945","doi":"10.1016/j.tcs.2018.08.024","title":"Constant query time (1 + ϵ)-approximate distance oracle for planar graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Combinatorics; Mathematics; Binary logarithm; Time complexity; Graph; Constant (computer programming); Discrete mathematics; Computer science","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.003663202,0.002083091,0.004679054,0.001755014,0.001902581,0.00668294,0.008853763,0.004426484,0.02074032],"category_scores_gemma":[0.02730213,0.001197408,0.001904258,0.005852021,0.002724134,0.02001591,0.005845015,0.006416494,0.004896719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006493949,"about_ca_system_score_gemma":0.00647329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005666486,"about_ca_topic_score_gemma":0.009139726,"domain_scores_codex":[0.990495,0.001515805,0.0006432681,0.002439223,0.003041642,0.001865114],"domain_scores_gemma":[0.9703646,0.01704478,0.001721057,0.007772183,0.00171042,0.001387047],"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.01221032,0.00240949,0.01097793,0.003703171,0.0006593425,0.0005861163,0.001213478,0.2830333,0.03803473,0.1592533,0.08565646,0.4022624],"study_design_scores_gemma":[0.001356014,0.0006042723,0.003440483,0.0001317488,0.000584368,0.001274335,0.0007594351,0.6499577,0.01904697,0.3080487,0.01463223,0.0001638201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3313466,0.006178779,0.5703755,0.02166054,0.0008535778,0.0007353537,0.01209253,0.01470814,0.04204902],"genre_scores_gemma":[0.8115376,0.001544819,0.1611023,0.001651123,0.0007104605,0.0003947778,0.006910776,0.001062645,0.0150855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02074032,"threshold_uncertainty_score":0.06938332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01301865204600137,"score_gpt":0.2536365564653466,"score_spread":0.2406179044193452,"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."}}