{"id":"W2400880491","doi":"10.1007/978-3-662-48971-0_53","title":"Constant Query Time $$(1+\\epsilon )$$ -Approximate Distance Oracle for Planar Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Oracle; Binary logarithm; Time complexity; Graph; Constant (computer programming); Mathematics; Physics; Computer science","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.002541794,0.0026342,0.0042913,0.001539681,0.001976235,0.006127036,0.009228534,0.003957134,0.04665676],"category_scores_gemma":[0.0153522,0.001220828,0.002930915,0.005690419,0.002610539,0.02053187,0.006859501,0.007996319,0.01308417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006720175,"about_ca_system_score_gemma":0.005099763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005803588,"about_ca_topic_score_gemma":0.009225731,"domain_scores_codex":[0.9925936,0.001051112,0.0004262586,0.001959022,0.002594887,0.001375156],"domain_scores_gemma":[0.9847247,0.007285635,0.0005501204,0.005883326,0.001010947,0.0005452462],"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.004118911,0.0009881606,0.002402929,0.002707902,0.0003848931,0.0002768202,0.0005172752,0.08725421,0.02385515,0.2141978,0.1527694,0.5105265],"study_design_scores_gemma":[0.0008317652,0.0003769417,0.002146454,0.0002543305,0.0005437696,0.001086064,0.0005115411,0.3592296,0.02129284,0.5666759,0.04686647,0.0001843463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1165927,0.008329487,0.6957428,0.01734517,0.00174357,0.0006740196,0.0121123,0.02232271,0.1251372],"genre_scores_gemma":[0.5476369,0.0038424,0.3612992,0.002782502,0.001298202,0.0006892015,0.01332907,0.004013891,0.06510863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04665676,"threshold_uncertainty_score":0.1560824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03021250463092352,"score_gpt":0.2571965310609866,"score_spread":0.226984026430063,"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."}}