{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962319,0.0008845192,0.0006769371,0.001075874,0.0007286873,0.001556277,0.002186035,0.0009815772,0.01166904],"category_scores_gemma":[0.00350358,0.0006154094,0.0008711959,0.002144433,0.0007499913,0.00401529,0.002722259,0.001374866,0.002157227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008992052,"about_ca_system_score_gemma":0.001411386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00370482,"about_ca_topic_score_gemma":0.0100075,"domain_scores_codex":[0.9993595,0.00009086038,0.00004492337,0.000124759,0.0002386585,0.0001413433],"domain_scores_gemma":[0.9980814,0.0008739637,0.0001705757,0.0005845637,0.000202652,0.00008683248],"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.001332106,0.0006238947,0.003851882,0.001417642,0.00009920628,0.0005624893,0.0008938017,0.2640301,0.03736424,0.09657432,0.04603074,0.5472196],"study_design_scores_gemma":[0.0002296549,0.0002069406,0.0007787142,0.0001086585,0.00007974459,0.0002436527,0.0005056719,0.7901077,0.02780173,0.1683812,0.01151548,0.00004085567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1783381,0.0006788701,0.7785375,0.001200541,0.0001442279,0.0004600057,0.003987674,0.009357906,0.02729521],"genre_scores_gemma":[0.4827728,0.000474401,0.4965267,0.0003129765,0.00003703375,0.000253178,0.006372793,0.001422299,0.01182784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01166904,"threshold_uncertainty_score":0.03903681,"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."}}