{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004587196,0.0001274917,0.0001652447,0.00008490716,0.000149883,0.0000506257,0.000235744,0.00009501621,0.00001222424],"category_scores_gemma":[0.00001163654,0.00009816774,0.00004861578,0.0001972008,0.00006573542,0.000323922,0.00002946257,0.0001368661,0.00001619921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046721,"about_ca_system_score_gemma":0.00002638195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009229568,"about_ca_topic_score_gemma":0.000008613008,"domain_scores_codex":[0.9989074,0.0001510137,0.0002162166,0.0001945965,0.0002145571,0.0003162258],"domain_scores_gemma":[0.999347,0.00005033551,0.0001444671,0.0002896614,0.00007408031,0.00009449595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001445164,0.002048822,0.02215189,0.0008732943,0.001158469,0.00008866243,0.1161961,0.04770713,0.1788763,0.407581,0.01820464,0.2036685],"study_design_scores_gemma":[0.006399781,0.0050117,0.0180917,0.0008654221,0.0001729057,0.002148463,0.005466881,0.7835358,0.125487,0.004971062,0.04442167,0.003427595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1280616,0.0001329356,0.8701332,0.000235314,0.0005726033,0.0003000905,6.151297e-7,0.00007508694,0.0004885597],"genre_scores_gemma":[0.9594927,0.000006651547,0.03978267,0.0001019778,0.0002556226,0.0000579465,6.595744e-7,0.00001045756,0.0002912875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8314312,"threshold_uncertainty_score":0.4003164,"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."}}