{"id":"W2794477591","doi":"10.1371/journal.pone.0193350","title":"Exact and heuristic algorithms for Space Information Flow","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Delaunay triangulation; Algorithm; Computer science; Heuristic; Multicast; Linear programming; Multi-commodity flow problem; Consistent heuristic; Mathematics; Mathematical optimization; Topology (electrical circuits); Flow network; Search algorithm; Beam search; Combinatorics; Incremental heuristic search; Distributed computing","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899138,0.0013026,0.001156264,0.001962602,0.001168055,0.002105032,0.001867916,0.001784765,0.006253343],"category_scores_gemma":[0.008357703,0.0005164539,0.001215106,0.002684059,0.001527281,0.00380254,0.001889095,0.001966053,0.0009715992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002916081,"about_ca_system_score_gemma":0.002748966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006350176,"about_ca_topic_score_gemma":0.004688976,"domain_scores_codex":[0.9985979,0.0004347182,0.0000656171,0.0002047747,0.0004632609,0.0002336991],"domain_scores_gemma":[0.9967662,0.002083412,0.0002169748,0.0004644316,0.0003923895,0.00007662218],"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.00008192284,0.00007159256,0.0003886884,0.0001394943,0.00002950545,0.00004375945,0.0001431321,0.678004,0.0007952128,0.1588968,0.005048297,0.1563576],"study_design_scores_gemma":[0.00001857431,0.00002307317,0.00005782573,0.00001811976,0.000006039248,0.00003154848,0.00003660117,0.9162271,0.0005280949,0.08082549,0.002218351,0.000009181114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004181006,0.0003225486,0.9911119,0.0001824074,0.00004553827,0.00006398286,0.00007036317,0.0003862427,0.003635858],"genre_scores_gemma":[0.1618827,0.0006290076,0.8328927,0.0001578398,0.00009678709,0.0003552386,0.0003484105,0.0001931306,0.003444182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006350176,"threshold_uncertainty_score":0.02115774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07484449065572621,"score_gpt":0.2692955351138611,"score_spread":0.1944510444581349,"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."}}