{"id":"W2731797971","doi":"10.1007/978-3-319-62389-4_6","title":"Constrained Routing Between Non-Visible Vertices","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Combinatorics; Equal-cost multi-path routing; Set (abstract data type); Line segment; Line (geometry); Routing table; Algorithm; Mathematics; Computer network; Artificial intelligence; Routing protocol","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001303083,0.0004482209,0.0005511227,0.0006351473,0.0006959736,0.00180061,0.005104827,0.0003032387,0.00003487042],"category_scores_gemma":[0.0001995571,0.0004115709,0.0001211434,0.0002547117,0.0009793952,0.001129399,0.001796736,0.0008195613,0.00009632959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001622517,"about_ca_system_score_gemma":0.000928684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003234078,"about_ca_topic_score_gemma":0.00003086949,"domain_scores_codex":[0.996276,0.00003284283,0.0005152308,0.001376748,0.001009705,0.000789433],"domain_scores_gemma":[0.9968252,0.0004669804,0.0004001523,0.001732521,0.0003069355,0.000268235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002694994,0.00001988231,0.0005491136,0.00005581667,0.00002482607,0.00008225787,0.00121276,0.03111688,0.0000805267,0.02349853,0.0000390024,0.9433177],"study_design_scores_gemma":[0.0004361239,0.0001623104,0.0003297066,0.0005727234,0.000008814064,0.00002040404,1.641122e-7,0.9275494,0.0007148145,0.0678914,0.001580135,0.0007339588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002470265,0.00007766858,0.9699111,0.001243431,0.0009030655,0.0003808794,0.000005271129,0.000158265,0.02729563],"genre_scores_gemma":[0.3881243,0.00004867378,0.6084219,0.0009480439,0.0006763163,0.000008091371,0.00001037397,0.00004198907,0.001720354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9425837,"threshold_uncertainty_score":0.9998336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03226791445916056,"score_gpt":0.2866327263484828,"score_spread":0.2543648118893223,"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."}}