{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00168834,0.0008002078,0.0009230449,0.0009189195,0.0004899899,0.0007494688,0.004698549,0.0003859692,0.00002379854],"category_scores_gemma":[0.000133745,0.0007494633,0.0002885339,0.0009193732,0.001562797,0.0008258981,0.001014057,0.000803533,0.00005904964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000352062,"about_ca_system_score_gemma":0.0008560335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002092662,"about_ca_topic_score_gemma":0.00007130655,"domain_scores_codex":[0.994568,0.00004856484,0.000773491,0.0021849,0.001315654,0.001109361],"domain_scores_gemma":[0.9958652,0.000773716,0.0004614199,0.001981673,0.0005511465,0.0003668027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004442154,0.00009003273,0.00002136141,0.0001249431,0.00003669851,0.0001423198,0.0006143354,0.003719821,0.0001084111,0.5991147,0.0007613104,0.3952217],"study_design_scores_gemma":[0.000362304,0.0002156754,0.000005947971,0.0002966697,0.000009439127,0.00006600181,2.007699e-7,0.3841213,0.0001921144,0.605218,0.008813007,0.0006994123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001617951,0.001474527,0.9892231,0.000725214,0.002050464,0.000916637,0.0001205648,0.0003728249,0.005100497],"genre_scores_gemma":[0.006936201,0.00006932054,0.9903045,0.001097077,0.0003533465,0.00005070639,0.00004607675,0.0000780977,0.001064715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3945223,"threshold_uncertainty_score":0.9994956,"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."}}