{"id":"W2123195111","doi":"10.1109/milcom.1994.473973","title":"Routing algorithms in the bidirectional de Bruijn graph metropolitan area networks","year":2002,"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":"De Bruijn graph; De Bruijn sequence; Computer science; Routing algorithm; Routing (electronic design automation); Network topology; Metropolitan area; Graph; Computer network; Topology (electrical circuits); Algorithm; Routing protocol; Distributed computing; Theoretical computer science; Mathematics; Discrete mathematics; Geography; Combinatorics","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.000143323,0.0001193929,0.0001083902,0.00008693645,0.00005784226,0.00002557453,0.0002098114,0.0001039171,0.00009758436],"category_scores_gemma":[0.00005931432,0.00008759322,0.00004482085,0.0006376237,0.00006351427,0.00008117891,0.00002722128,0.000364286,0.00001214557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001638669,"about_ca_system_score_gemma":0.000001177313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002346277,"about_ca_topic_score_gemma":0.00005712537,"domain_scores_codex":[0.9991885,0.00001791708,0.0001553705,0.0001216921,0.0001066131,0.0004098605],"domain_scores_gemma":[0.9995559,0.000212383,0.00001080567,0.0001822073,0.00001006345,0.00002864344],"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.000001572326,0.0000407037,0.004324552,0.00000536686,0.00003335686,0.00002754685,0.00009596394,0.8922517,0.00004186789,0.04443815,0.007125317,0.05161393],"study_design_scores_gemma":[0.00009549852,0.00001350583,0.001288465,0.000009238663,0.000004120285,0.00001874446,0.0005193112,0.9911107,0.00004853985,0.005779171,0.0009800174,0.0001326681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02656494,0.002623138,0.8945884,0.0005117366,0.0002808927,0.0001832701,0.000001555793,0.002061971,0.07318415],"genre_scores_gemma":[0.9510389,0.0003597159,0.0482402,0.0001133623,0.0001051891,0.00002475418,0.000001161416,0.00001936947,0.0000973684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9244739,"threshold_uncertainty_score":0.3571948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01758263132684394,"score_gpt":0.2215859689891237,"score_spread":0.2040033376622798,"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."}}