{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001757275,0.0002685084,0.000313082,0.0002374744,0.001096028,0.0006487151,0.003555102,0.00006371033,0.00005823009],"category_scores_gemma":[0.0001006835,0.0002264506,0.0001297338,0.001636169,0.008890465,0.0008007311,0.0007495952,0.0001706973,0.0001481741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005260399,"about_ca_system_score_gemma":0.0001671422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002675434,"about_ca_topic_score_gemma":0.000001409039,"domain_scores_codex":[0.9968112,0.00008502913,0.0003745527,0.001091013,0.0006904206,0.0009477891],"domain_scores_gemma":[0.9974822,0.0004559644,0.0001074356,0.001194164,0.0004113252,0.0003489081],"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.00002200636,0.00006922549,0.0000156042,0.000009610569,0.000005963151,0.000006925259,0.0002523833,0.000003226289,0.000518914,0.9724671,0.0003567551,0.02627233],"study_design_scores_gemma":[0.000210476,0.00031448,0.00005973385,0.00002835349,0.00000336668,0.00002927968,0.000003142639,0.4596936,0.0026988,0.535732,0.0009943877,0.000232407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003673248,0.00003741164,0.9885337,0.0009652131,0.0009758021,0.000368566,0.00002283797,0.000420414,0.005002859],"genre_scores_gemma":[0.5310331,0.000002934329,0.4680194,0.000703985,0.0001855825,0.00001780747,0.000001912249,0.00001038283,0.00002487499],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5273598,"threshold_uncertainty_score":0.9938068,"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."}}