{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003555066,0.0003598567,0.0003631247,0.0005145535,0.00009789482,0.0002911758,0.003018745,0.0002164281,0.00003868073],"category_scores_gemma":[0.00001462024,0.0004123222,0.0002603737,0.0004977225,0.00008500832,0.001006595,0.002261887,0.000437922,0.00008747556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001334175,"about_ca_system_score_gemma":0.00009249481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004178626,"about_ca_topic_score_gemma":0.00003550809,"domain_scores_codex":[0.9977018,0.00008022115,0.0002502256,0.001320848,0.0001269034,0.0005199969],"domain_scores_gemma":[0.9982535,0.0000797358,0.0002124828,0.001206638,0.00009051222,0.0001571731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005738144,0.0005137667,0.002123596,0.0003705022,0.0002322489,0.001228747,0.0006882506,0.03677804,0.00004138349,0.884477,0.005685574,0.06780357],"study_design_scores_gemma":[0.001128561,0.00006658813,0.002080783,0.0001059024,0.00003992382,0.000001927872,0.00008606603,0.8230333,0.00003949738,0.1719982,0.0008579943,0.0005612487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06596605,0.00006450656,0.9297972,0.00007939212,0.001297398,0.0008321176,0.00005821794,0.0001986114,0.00170647],"genre_scores_gemma":[0.9442248,0.0003109994,0.04821002,0.0002123935,0.0001971541,0.00001564647,0.00009698515,0.00003869993,0.006693265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8815872,"threshold_uncertainty_score":0.9998329,"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."}}