{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005783571,0.000438556,0.0005282738,0.0003966541,0.0001632393,0.0003742992,0.001112999,0.0002873692,0.00001729617],"category_scores_gemma":[0.00001380167,0.0003732749,0.00009986877,0.00429887,0.0001643803,0.001045874,0.0002668292,0.0008067452,0.00001445705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002395061,"about_ca_system_score_gemma":0.0001213192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005195273,"about_ca_topic_score_gemma":0.001362313,"domain_scores_codex":[0.9964519,0.0001726546,0.0006420867,0.0009727028,0.0005472703,0.001213395],"domain_scores_gemma":[0.997871,0.0004119011,0.0002698055,0.001190551,0.00008636413,0.0001703965],"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.00007359953,0.000147941,0.02703408,0.000006691598,0.00002788274,0.0004485562,0.00002768548,0.9170507,0.000001947752,0.03295488,0.008396235,0.01382981],"study_design_scores_gemma":[0.001607728,0.000188829,0.02254374,0.0001593129,0.00001846568,0.00008980303,0.00002071832,0.9703873,0.00001197016,0.0004991574,0.003831257,0.0006416701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0145208,0.002552143,0.9715655,0.0001421316,0.000980277,0.0005635384,0.000003568908,0.00031571,0.009356306],"genre_scores_gemma":[0.9907703,0.0001371113,0.006828981,0.0005020323,0.0008083415,0.00009072202,0.00005741628,0.00004778749,0.0007572899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9762495,"threshold_uncertainty_score":0.9998719,"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."}}