{"id":"W2951681033","doi":"10.48550/arxiv.0805.1401","title":"Approximation Algorithms for Shortest Descending Paths in Terrains","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Algorithm; Computer science; Terrain; Geography; Cartography","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.001162559,0.001258156,0.001218795,0.001223582,0.0007209335,0.001644901,0.002102442,0.00158347,0.005162679],"category_scores_gemma":[0.007563542,0.0006380238,0.001162449,0.002288785,0.0009786218,0.002798676,0.002020224,0.002471861,0.0006937443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001743956,"about_ca_system_score_gemma":0.001086049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005043942,"about_ca_topic_score_gemma":0.005150042,"domain_scores_codex":[0.9991818,0.00016051,0.00005902766,0.0001866359,0.0002418482,0.000170202],"domain_scores_gemma":[0.9977223,0.001504089,0.0001607716,0.000323538,0.0001787062,0.0001104732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002219194,0.0001078857,0.001455613,0.0002413222,0.00005990856,0.00009243402,0.0002447223,0.7925236,0.001523796,0.08411171,0.007267557,0.1121496],"study_design_scores_gemma":[0.00004942399,0.00003242096,0.0001420134,0.00002345978,0.00001426682,0.00005294891,0.00006111487,0.918781,0.0005261776,0.07789305,0.00241601,0.000007985608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02875489,0.0008052205,0.9644341,0.0004635257,0.0000662375,0.0001018574,0.0004550602,0.0009490435,0.003970092],"genre_scores_gemma":[0.3306008,0.0009466554,0.6614702,0.0001804831,0.00008553138,0.0003340982,0.001907197,0.0002868063,0.004188271],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005162679,"threshold_uncertainty_score":0.01727092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1028770499663755,"score_gpt":0.3073499802901857,"score_spread":0.2044729303238102,"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."}}