{"id":"W1735889906","doi":"10.1109/broadnets.2004.56","title":"p-cycle network design with hop limits and circumference limits","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Hop (telecommunications); Circumference; Limit (mathematics); Path (computing); Path protection; Limit cycle; Computer science; Span (engineering); Transmission (telecommunications); Noisy-channel coding theorem; Computer network; Mathematics; Topology (electrical circuits); Telecommunications; Engineering; Physics; Wavelength-division multiplexing; Structural engineering; Optics; Combinatorics; Geometry; Wavelength","routes":{"ca_aff":true,"ca_fund":true,"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.0005312721,0.0003547839,0.0002104486,0.0004441995,0.0003533447,0.000687529,0.00085601,0.0004904944,0.00208559],"category_scores_gemma":[0.001984963,0.0002209752,0.0002627198,0.000374554,0.0006659181,0.001408203,0.0007233653,0.0005373166,0.000328792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007289279,"about_ca_system_score_gemma":0.0006598696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008037707,"about_ca_topic_score_gemma":0.001089081,"domain_scores_codex":[0.9996316,0.0001029847,0.00002499615,0.00007316306,0.0001264544,0.00004068605],"domain_scores_gemma":[0.9990383,0.0003501371,0.0001553764,0.0001615966,0.0002369741,0.00005759535],"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.000188837,0.00007107016,0.001556231,0.0003130373,0.00003110887,0.0002470089,0.0002503265,0.3495422,0.05676121,0.4230117,0.002541913,0.1654854],"study_design_scores_gemma":[0.00003963213,0.0004784114,0.0006324044,0.00007410587,0.00003854107,0.0004643957,0.00009268385,0.6985492,0.03962958,0.2313762,0.02858097,0.00004376902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03934968,0.0002708667,0.9429464,0.0002344258,0.00004528786,0.00007648864,0.00005101602,0.0002012041,0.01682448],"genre_scores_gemma":[0.7367582,0.0006594624,0.2539431,0.0001854808,0.00004315526,0.0002837557,0.00007266346,0.0001031525,0.007950927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00208559,"threshold_uncertainty_score":0.006977022,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01683123666528727,"score_gpt":0.2048873394511175,"score_spread":0.1880561027858302,"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."}}