{"id":"W4280646555","doi":"10.1109/infocom48880.2022.9796816","title":"Opportunistic Routing in Quantum Networks","year":2022,"lang":"en","type":"article","venue":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Policy-based routing; Link-state routing protocol; Static routing; Multipath routing; Equal-cost multi-path routing; Computer network; Routing (electronic design automation); Distributed computing; Dynamic Source Routing; Routing protocol","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001003909,0.0003194534,0.0003736164,0.0007036619,0.001195566,0.0004677489,0.006444258,0.00008306767,0.000150746],"category_scores_gemma":[0.00001508163,0.0003759047,0.0001744991,0.001800822,0.0002229555,0.0007100794,0.0016448,0.001382521,0.00008609908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870492,"about_ca_system_score_gemma":0.0002997601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008126503,"about_ca_topic_score_gemma":0.00005281392,"domain_scores_codex":[0.9967122,0.0006719988,0.0009673047,0.0004621999,0.0006086652,0.0005776298],"domain_scores_gemma":[0.9952035,0.0004990106,0.0004337007,0.003503715,0.0001588874,0.0002011818],"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.00001018595,0.0003305393,0.0003880097,0.000006941958,0.00002473881,0.00001292909,0.00168912,0.02297665,0.00004046895,0.9422101,0.005839312,0.02647094],"study_design_scores_gemma":[0.0005445525,0.0002068963,0.0007794253,0.00004149472,0.000005277616,0.00002977261,0.0002446152,0.9816115,0.00001033606,0.005128996,0.01097311,0.0004239954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005017801,0.00004522192,0.9778783,0.004280942,0.002189608,0.0006205236,0.00003214365,0.0004936856,0.009441735],"genre_scores_gemma":[0.9870523,0.0001648458,0.008582943,0.003533021,0.00006898391,0.0004333105,0.00008306834,0.00002033358,0.00006118797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9820345,"threshold_uncertainty_score":0.9998693,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07081772621490857,"score_gpt":0.287412512928418,"score_spread":0.2165947867135094,"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."}}