{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001851021,0.0002207441,0.0002427215,0.0001146485,0.00005374096,0.00004725803,0.000226229,0.0004266801,0.000003680191],"category_scores_gemma":[0.0002587637,0.000218191,0.00007105739,0.000219974,0.00006570535,0.0002419627,0.00003676244,0.0004050318,9.537019e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006521878,"about_ca_system_score_gemma":0.000006252584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002507294,"about_ca_topic_score_gemma":0.00007560198,"domain_scores_codex":[0.9987071,0.000002267644,0.0003545884,0.0002686109,0.00009380057,0.0005736265],"domain_scores_gemma":[0.9992571,0.0003610647,0.00002436938,0.0002280935,0.00006175892,0.00006755035],"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.00003313084,0.00006026608,0.0004044475,0.0001082438,0.00003180044,0.000001380791,0.00003890548,0.6479772,0.1154937,0.02727081,0.0003541654,0.2082259],"study_design_scores_gemma":[0.0004085767,0.00005392588,0.00008036487,0.00004933084,0.00001375184,0.000003674689,0.00006226394,0.925232,0.0658879,0.00315785,0.004731532,0.0003188661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01144245,0.00006450386,0.9841434,0.00008982763,0.0004098491,0.0008987877,0.000003801799,0.002567993,0.0003793493],"genre_scores_gemma":[0.4711016,0.00003672644,0.5280948,0.00002648753,0.0002157036,0.0004465358,0.000007153355,0.00006058153,0.0000103402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4596592,"threshold_uncertainty_score":0.8897569,"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."}}