{"id":"W2046012872","doi":"10.1016/j.comnet.2009.05.009","title":"Heuristic algorithms for designing self-repairing protection trees in mesh networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Path protection; Backup; Redundancy (engineering); Unicast; Network topology; Distributed computing; Multicast; Tree (set theory); Heuristic; Computer network; Tree network; Mesh networking; Algorithm; Time complexity; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002151126,0.0003137402,0.0003579123,0.0001410232,0.0001010026,0.00007313224,0.0002799667,0.0003039762,0.000001616008],"category_scores_gemma":[0.00001846835,0.0003346559,0.00009639916,0.0004983379,0.00003132102,0.0001905341,0.00005910922,0.0005612853,0.000002459433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001647468,"about_ca_system_score_gemma":0.000005561224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.893083e-7,"about_ca_topic_score_gemma":0.000006237852,"domain_scores_codex":[0.9983483,0.00002810485,0.0004054793,0.0003868011,0.0001026376,0.0007286607],"domain_scores_gemma":[0.9993236,0.0001979088,0.00005050498,0.0003126197,0.00003910455,0.00007623871],"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.000009594283,0.00002053963,0.00005675068,0.000009792152,0.00001791938,0.00001047365,0.00002033499,0.7373038,0.00001061808,0.0003378125,0.0005256555,0.2616767],"study_design_scores_gemma":[0.0004635701,0.0001953352,0.001075972,0.00014819,0.00001545785,0.00001147903,0.000005612376,0.9948738,0.00002991028,0.002316626,0.0004980238,0.0003660461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002570999,0.0009562228,0.9912964,0.00005053172,0.0007544184,0.000814505,4.226536e-7,0.003449377,0.0001071024],"genre_scores_gemma":[0.6181616,0.0001475727,0.3806061,0.00006010896,0.0008535435,0.0001130878,0.000006502187,0.00004573594,0.000005769979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6155906,"threshold_uncertainty_score":0.9999105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01406975404724735,"score_gpt":0.2229072855366198,"score_spread":0.2088375314893725,"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."}}