{"id":"W2049029582","doi":"10.1109/drcn.2009.5339999","title":"Near-optimal FIPP p-cycle network designs using general path-protecting p-cycles and combined GA-ILP methods","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Université de Montréal; Concordia University","keywords":"Disjoint sets; Path (computing); Independence (probability theory); Integer programming; Constraint (computer-aided design); Spare part; Mathematical optimization; Computer science; Set (abstract data type); Heuristics; Linear programming; Integer (computer science); Mathematics; Discrete mathematics; Engineering; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0003706366,0.0003130753,0.0003701304,0.00005017964,0.0003189197,0.0001129252,0.0001879673,0.0002289711,0.00002624327],"category_scores_gemma":[0.0001341212,0.0003017922,0.00006404678,0.0003853904,0.0001211708,0.0002351573,0.00009979528,0.0005041022,0.00000448866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007207043,"about_ca_system_score_gemma":0.00001136699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007238178,"about_ca_topic_score_gemma":0.00000166091,"domain_scores_codex":[0.9983952,0.000078995,0.0003392816,0.0003310946,0.0001183903,0.0007370263],"domain_scores_gemma":[0.9992483,0.000245928,0.00004551641,0.0003197313,0.00002884333,0.0001117125],"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.00001545029,0.00001087633,0.0001086477,0.00001358056,0.00002270733,0.00001188613,0.00004169284,0.8868544,0.0100215,0.001944688,0.0001196622,0.100835],"study_design_scores_gemma":[0.0003310641,0.000130895,0.0008686426,0.00004656732,0.00002212653,0.00002202632,0.00006449479,0.9827114,0.003156329,0.01187701,0.0003626594,0.0004067209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3697176,0.0009311594,0.6266252,0.00006257857,0.0001103109,0.0002107446,6.482954e-7,0.001506096,0.0008357135],"genre_scores_gemma":[0.3277626,0.00007518113,0.6719131,0.00005765978,0.0001190028,0.000007812203,0.000001030512,0.0000373084,0.00002634592],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1004283,"threshold_uncertainty_score":0.9999434,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02937260123223077,"score_gpt":0.3000176469550299,"score_spread":0.2706450457227991,"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."}}