{"id":"W1992010432","doi":"10.1109/honet.2010.5715768","title":"Novel techniques for deploying monitoring trails (m-trails) for fault localization in all-optical networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Fault (geology); Dijkstra's algorithm; Process (computing); Travelling salesman problem; Table (database); Real-time computing; Distributed computing; Algorithm; Data mining; Shortest path problem; Theoretical computer science; Graph","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.0004281237,0.0004379904,0.0002935525,0.0007827787,0.0006289866,0.000567763,0.0009969823,0.0003098008,0.001887109],"category_scores_gemma":[0.001289901,0.0002456171,0.0002756499,0.0008753359,0.0005085893,0.001548667,0.0008699222,0.0005141297,0.0004302582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004345576,"about_ca_system_score_gemma":0.000814282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00084874,"about_ca_topic_score_gemma":0.001816191,"domain_scores_codex":[0.9997008,0.00006040047,0.0000266894,0.00004554669,0.0001282305,0.00003840477],"domain_scores_gemma":[0.999117,0.0002019022,0.0002076535,0.0002274631,0.0001907945,0.00005523733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003594014,0.0001530803,0.001896221,0.0004866927,0.00003968164,0.000328595,0.0003668242,0.05573479,0.1003561,0.04627135,0.00470422,0.789303],"study_design_scores_gemma":[0.0001426717,0.0008983893,0.002082942,0.0001435266,0.00009020697,0.001298745,0.0004185697,0.6808739,0.1990093,0.05209558,0.06283817,0.0001080741],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01786638,0.0003232952,0.9791059,0.0001196084,0.00006870039,0.00006801303,0.00003521924,0.0007212856,0.00169157],"genre_scores_gemma":[0.3464174,0.000632836,0.648507,0.00008040698,0.00006168558,0.00009505572,0.0001122798,0.00009032489,0.004002993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001887109,"threshold_uncertainty_score":0.006313026,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02473917516353497,"score_gpt":0.2858237848887923,"score_spread":0.2610846097252573,"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."}}