{"id":"W2546541767","doi":"","title":"Minimum CAPEX Design of Segment p -Cycles with Full Node Protection","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Node (physics); Context (archaeology); Compromise; Path (computing); Computer science; Network Access Protection; Reliability engineering; Computer network; 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.0004643784,0.0006185029,0.0005106903,0.0005011053,0.0004384213,0.0008377763,0.001521026,0.0003773376,0.003189772],"category_scores_gemma":[0.001271021,0.0002428512,0.0002612386,0.0004036362,0.000410792,0.0008253723,0.0005664177,0.0003917946,0.0002767272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008624007,"about_ca_system_score_gemma":0.0008285333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001051385,"about_ca_topic_score_gemma":0.001622968,"domain_scores_codex":[0.9996464,0.00008682145,0.00002387638,0.00008240851,0.000081584,0.00007892791],"domain_scores_gemma":[0.9992592,0.0001873414,0.0001337763,0.0001435534,0.0002143552,0.00006190337],"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.001446155,0.0002276725,0.002159361,0.0005789023,0.0001492657,0.0005729376,0.0003568644,0.5572937,0.1582978,0.07381166,0.004111461,0.2009943],"study_design_scores_gemma":[0.0001302543,0.001022769,0.001086095,0.00005769827,0.00009241635,0.0004517149,0.00007372179,0.9122583,0.05822135,0.01811567,0.008455091,0.00003499727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1902781,0.0007251473,0.793187,0.000206343,0.00007183012,0.0003498019,0.0001297711,0.0005577917,0.01449428],"genre_scores_gemma":[0.959547,0.0001258581,0.03799078,0.0000378891,0.00001473885,0.00008922134,0.00003572288,0.00004581461,0.002112942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003189772,"threshold_uncertainty_score":0.01067084,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01929257296477394,"score_gpt":0.2044228798776518,"score_spread":0.1851303069128779,"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."}}