{"id":"W4249052652","doi":"10.1002/net.20114","title":"Route discovery with constant memory in oriented planar geometric networks","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Planar graph; Planar; Routing (electronic design automation); Computer science; Face (sociological concept); Combinatorics; Constant (computer programming); Eulerian path; Spatial network; Topology (electrical circuits); Graph; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Pure mathematics","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.0006731806,0.0004105819,0.0007929149,0.00121651,0.0006394659,0.001313893,0.001771491,0.000760109,0.001512003],"category_scores_gemma":[0.008472495,0.0003464704,0.0003093436,0.001473576,0.001138654,0.00332788,0.001784067,0.0005342555,0.000288806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008089669,"about_ca_system_score_gemma":0.0005172446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001754736,"about_ca_topic_score_gemma":0.001279984,"domain_scores_codex":[0.999415,0.000125434,0.00003866022,0.0001510637,0.0001438176,0.0001261303],"domain_scores_gemma":[0.9960174,0.002149829,0.0008529882,0.0004671421,0.0003494211,0.0001632511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000788609,0.0000892065,0.004387523,0.0002796227,0.00009099155,0.0005085096,0.0004766984,0.6956422,0.008797536,0.1116367,0.00295567,0.1743467],"study_design_scores_gemma":[0.0000555436,0.0001500148,0.0005646165,0.00002817644,0.00005434393,0.0003397987,0.0001870495,0.8596055,0.007559587,0.127954,0.003469617,0.00003174494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4380991,0.001277889,0.5536168,0.0008694704,0.00005477244,0.000100195,0.0002528882,0.000615526,0.005113452],"genre_scores_gemma":[0.9381745,0.0005782326,0.05909223,0.00007837274,0.00005045553,0.00007288776,0.0002327347,0.00002788142,0.001692702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001771491,"threshold_uncertainty_score":0.005869508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005255363127485251,"score_gpt":0.1910402697009692,"score_spread":0.1857849065734839,"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."}}