{"id":"W2281191978","doi":"10.1007/s00453-015-0086-7","title":"I/O-Efficient Path Traversal in Succinct Planar Graphs","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Path (computing); Traverse; Tree traversal; Mathematics; Block (permutation group theory); Bounded function; Graph traversal; Graph; Terrain; Binary logarithm; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0003193432,0.0000916605,0.00009970134,0.0002015789,0.00004016507,0.0000541409,0.0003077878,0.00004024307,0.000005461105],"category_scores_gemma":[0.00001766058,0.00008889128,0.0000353059,0.0006547628,0.00001556612,0.00009728762,0.00005010917,0.00008625197,0.00007244985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005493411,"about_ca_system_score_gemma":0.000123647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000842906,"about_ca_topic_score_gemma":0.00002289215,"domain_scores_codex":[0.9990566,0.00005550202,0.0001671095,0.0002285757,0.0002948658,0.000197372],"domain_scores_gemma":[0.9995235,0.00004774334,0.00003735521,0.0002013486,0.00006775512,0.0001222819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007170359,0.0009021754,0.002630922,0.00001807093,0.0000489606,0.0003334685,0.008625713,0.30538,0.0005579384,0.3009609,0.01200904,0.3684612],"study_design_scores_gemma":[0.0006528361,0.0001285705,0.005292827,0.000007101368,0.000002157529,0.00002916152,0.00007859951,0.9826776,0.0003596133,0.00809049,0.002522819,0.00015816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2405671,0.0001229753,0.7565541,0.0006483942,0.0007040073,0.0001419925,0.000004200398,0.00009561083,0.00116155],"genre_scores_gemma":[0.9522056,0.000001677497,0.04742092,0.0002042426,0.00007732161,0.000008125387,0.00001376088,0.000004343936,0.00006402484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7116385,"threshold_uncertainty_score":0.3624882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01897710810358226,"score_gpt":0.2377351646306254,"score_spread":0.2187580565270432,"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."}}