{"id":"W2142295403","doi":"10.1109/pdcat.2007.67","title":"Two Tree-Based Algorithms for Network Spare Capacity Design","year":2007,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Spare part; Survivability; Backup; Computer science; Algorithm; Tree (set theory); Steiner tree problem; Mathematical optimization; Computer network; Mathematics; Engineering; Combinatorics; Database","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.001809197,0.0001386674,0.0001768558,0.00005698975,0.0002015407,0.0001397947,0.0004519899,0.00006990992,0.00002377378],"category_scores_gemma":[0.00002065486,0.0001139663,0.0001164944,0.0003024625,0.00002185268,0.0001770722,0.0000342692,0.00008314447,0.00002537357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006153953,"about_ca_system_score_gemma":0.0000381587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001004582,"about_ca_topic_score_gemma":0.0003433871,"domain_scores_codex":[0.9986171,0.00007421998,0.0003025855,0.0003384324,0.0001758506,0.0004918549],"domain_scores_gemma":[0.9987918,0.0004788659,0.00008446311,0.0003824835,0.0001441882,0.0001182314],"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.0001236189,0.0001702655,0.001226512,0.00003727155,0.00008190623,0.00002839746,0.0004295163,0.2766951,0.0002165461,0.4317141,0.1234502,0.1658266],"study_design_scores_gemma":[0.0006328906,0.0001691388,0.0001782875,0.00002099615,0.000003579248,0.000008645127,0.00002022687,0.9767517,0.001884153,0.00257957,0.01755239,0.0001983564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002475408,0.00003518896,0.9904196,0.0002167264,0.001934714,0.0004086584,8.689863e-7,0.0002438261,0.00649292],"genre_scores_gemma":[0.4795684,3.744461e-7,0.5175351,0.0009572712,0.0009671654,0.00003042713,0.000001572319,0.000009867444,0.0009297944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7000566,"threshold_uncertainty_score":0.4647412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08022670335958362,"score_gpt":0.2858698216112084,"score_spread":0.2056431182516248,"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."}}