{"id":"W2320258239","doi":"10.1007/s11432-016-5539-3","title":"Quantum network coding for multi-unicast problem based on 2D and 3D cluster states","year":2016,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unicast; Computer science; Bottleneck; Linear network coding; Quantum entanglement; Distributed computing; Topology (electrical circuits); Computer network; Quantum; Theoretical computer science; Mathematics; Multicast; Physics","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004016051,0.0001847671,0.000154414,0.00065394,0.001684959,0.001459146,0.001518635,0.00004432806,0.00001030437],"category_scores_gemma":[0.0002356838,0.0001098118,0.00005689902,0.002030743,0.001365777,0.01226822,0.0002228205,0.00007218141,0.00005173101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004909483,"about_ca_system_score_gemma":0.0002974547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008497206,"about_ca_topic_score_gemma":0.00000382268,"domain_scores_codex":[0.9975334,0.00003678931,0.000528086,0.0003455906,0.0009101337,0.0006459384],"domain_scores_gemma":[0.9985731,0.0002488295,0.0003582567,0.0003635852,0.0002502038,0.0002060698],"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.00003345889,0.00005182785,0.002668694,0.00006585917,0.000004072219,1.86624e-7,0.004510919,0.01951207,0.0001558463,0.8197482,0.00218945,0.1510595],"study_design_scores_gemma":[0.0006971927,0.0002852786,0.004553393,0.00009308071,0.000001533883,0.000003925204,0.0001864871,0.9815257,0.0003189536,0.005735279,0.006373515,0.0002257118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01512895,0.000008646542,0.9770409,0.003637469,0.0004378634,0.0005082594,0.00001158863,0.0001708269,0.003055477],"genre_scores_gemma":[0.8235236,0.00002318294,0.1735765,0.002769399,0.00002638082,0.000058845,0.000002454385,0.000002940266,0.00001661935],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9620136,"threshold_uncertainty_score":0.9996147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02679616935303457,"score_gpt":0.2838811590770396,"score_spread":0.2570849897240051,"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."}}