{"id":"W78060492","doi":"10.1007/978-3-642-30507-8_38","title":"An Efficient Algorithm for Enumerating Minimal PathSets in Communication Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm","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.002449803,0.000278951,0.0003237714,0.0008143413,0.000646872,0.000737576,0.003882934,0.0002137096,0.000002802733],"category_scores_gemma":[0.00003432923,0.0002929087,0.00005612196,0.0005203732,0.0004993281,0.005148069,0.001739684,0.0005475631,0.000009743371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001814383,"about_ca_system_score_gemma":0.0002183501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001743488,"about_ca_topic_score_gemma":0.00001415729,"domain_scores_codex":[0.9978552,0.00007670047,0.0009325703,0.0003458874,0.0003504143,0.0004392326],"domain_scores_gemma":[0.9956859,0.0005765895,0.0004536085,0.002769564,0.0003598957,0.0001544613],"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.0000016741,0.00003962567,0.00005586025,0.00001280818,0.000002474734,1.148432e-7,0.001709269,0.01039823,3.039043e-7,0.1804242,0.0000557866,0.8072997],"study_design_scores_gemma":[0.0003586171,0.00006268844,0.001198902,0.0002487508,0.000004163927,0.00001063442,0.00002060831,0.9780306,0.000001350876,0.001520652,0.01822255,0.0003204805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006719558,0.003580853,0.9885228,0.0002736939,0.0002980527,0.0006871914,0.00001195245,0.0001062099,0.006452098],"genre_scores_gemma":[0.09413075,0.004063431,0.9004956,0.0007438553,0.0001043737,0.0001604372,0.0001876131,0.00001981481,0.00009412441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9676324,"threshold_uncertainty_score":0.9999523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02816278530959043,"score_gpt":0.2845177376795149,"score_spread":0.2563549523699244,"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."}}