{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927273,0.0007185267,0.0005103155,0.0005531832,0.0003436658,0.0004614989,0.0007564559,0.0004053339,0.002846642],"category_scores_gemma":[0.001431101,0.000318451,0.0005012058,0.000453709,0.0003847017,0.0007875733,0.0005652821,0.0005589232,0.0002842791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004747224,"about_ca_system_score_gemma":0.001289038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255923,"about_ca_topic_score_gemma":0.002485126,"domain_scores_codex":[0.9997485,0.00007846762,0.00001309089,0.00004827832,0.00007490461,0.00003666186],"domain_scores_gemma":[0.9993431,0.000351596,0.00008884357,0.0000827843,0.0001035093,0.00003008239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008504112,0.00006892858,0.000689275,0.0001901472,0.00002863465,0.0001044352,0.0000611027,0.8325619,0.01487689,0.01835462,0.00144811,0.1315309],"study_design_scores_gemma":[0.00002033729,0.0001134538,0.00008784518,0.00001030306,0.00001262968,0.00004553008,0.00001836351,0.9850287,0.005438848,0.007272683,0.001943858,0.000007463942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03182374,0.0001864154,0.9642876,0.00007681168,0.00002126898,0.0001181235,0.00005441811,0.0003457972,0.003085821],"genre_scores_gemma":[0.5091267,0.0002332189,0.488226,0.00008112916,0.00001483153,0.0002721211,0.0001573576,0.0001257304,0.001762852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002846642,"threshold_uncertainty_score":0.009522915,"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."}}