{"id":"W1685824674","doi":"10.48550/arxiv.1308.4469","title":"External Memory Algorithms For Path Traversal in Graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Graph traversal; Polygon mesh; Data structure; Computer science; Path (computing); Representation (politics); Binary tree; Bounded function; Planar graph; Tree (set theory); Longest path problem; Algorithm; Shortest path problem; Theoretical computer science; Mathematics; Graph; Combinatorics","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.001115694,0.001326313,0.001062512,0.001975339,0.001322214,0.003805668,0.003052986,0.001300425,0.01544782],"category_scores_gemma":[0.008283611,0.000737177,0.001660917,0.003827282,0.00138427,0.008711912,0.00498926,0.002517913,0.004535208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002384821,"about_ca_system_score_gemma":0.001634884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00426015,"about_ca_topic_score_gemma":0.006108406,"domain_scores_codex":[0.9980021,0.0003645133,0.0002229964,0.0004432148,0.0006870712,0.0002801339],"domain_scores_gemma":[0.9952679,0.002117357,0.0003235103,0.001656262,0.0005178804,0.0001169849],"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.0005050223,0.0002197205,0.00128241,0.0007860081,0.00009000995,0.0002139434,0.0009084711,0.09325447,0.005963552,0.3809555,0.02932983,0.4864911],"study_design_scores_gemma":[0.0001639786,0.0001239417,0.0002664368,0.0001595224,0.0000571721,0.000270493,0.0003759057,0.3905601,0.007123427,0.5569949,0.04384661,0.00005747864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01152258,0.0004770539,0.9727321,0.0003983027,0.00007448626,0.000172127,0.0008193154,0.00515575,0.008648249],"genre_scores_gemma":[0.1371537,0.0007200793,0.845297,0.0002869441,0.00008853753,0.000595915,0.004005914,0.001671715,0.01018023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01544782,"threshold_uncertainty_score":0.05167812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0707405642959143,"score_gpt":0.1957798860186248,"score_spread":0.1250393217227105,"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."}}