{"id":"W1998036735","doi":"10.1109/icmult.2010.5630926","title":"Scalable Design of p-Cycles for Node Protection without Candidate Pre-Enumeration","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Scalability; Computer science; Node (physics); Integer programming; Spare part; Column generation; Enumeration; Network planning and design; Linear programming; Set (abstract data type); Distributed computing; Mathematical optimization; Computer network; Algorithm; Mathematics; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.00007269756,0.00007375767,0.00009505972,0.00003655047,0.00003269223,0.00001060422,0.00006478184,0.00009768995,0.00001403719],"category_scores_gemma":[0.00007800086,0.00006457781,0.00001633856,0.00008058531,0.00003510616,0.0001334069,0.00001050491,0.0001178694,0.000003379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001291348,"about_ca_system_score_gemma":0.000005205132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001043793,"about_ca_topic_score_gemma":0.00004183576,"domain_scores_codex":[0.9995998,0.000003427634,0.0001232295,0.00008907056,0.00004965694,0.0001347873],"domain_scores_gemma":[0.9997486,0.00003311069,0.00001956797,0.0001452471,0.0000367129,0.00001674582],"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.00003418893,0.00001202357,0.00022033,0.00005963762,0.00001446664,7.779465e-8,0.00001906159,0.4999112,0.4709377,0.002447007,0.0001986443,0.0261456],"study_design_scores_gemma":[0.0001533121,0.00003953843,0.0002009811,0.000008809447,0.000005763206,9.54275e-7,0.000007167265,0.7137607,0.2809551,0.004432296,0.0003536814,0.00008167822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08098482,0.00001473443,0.9173796,0.00003745756,0.0001182875,0.0005598767,0.000002123784,0.0005923243,0.0003107469],"genre_scores_gemma":[0.6092624,0.000007274692,0.3904798,0.000002735192,0.00002174345,0.0001321805,0.000001545487,0.00001323933,0.00007907592],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5282776,"threshold_uncertainty_score":0.2633407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01325719290183197,"score_gpt":0.2375857896996922,"score_spread":0.2243285967978602,"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."}}