{"id":"W2400152870","doi":"","title":"An algorithm to find k-tight optimal double-loop networks.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Algorithm; Mathematical optimization; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943292,0.00134893,0.0009905768,0.001440734,0.0009527684,0.001228612,0.001661785,0.001333747,0.01459887],"category_scores_gemma":[0.00416718,0.0007209449,0.0006620848,0.001586383,0.0006611985,0.002139928,0.002379881,0.001326662,0.003162993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009936421,"about_ca_system_score_gemma":0.001821979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002722896,"about_ca_topic_score_gemma":0.00512618,"domain_scores_codex":[0.9995885,0.00008749266,0.00002559547,0.0001132687,0.0001002867,0.00008478753],"domain_scores_gemma":[0.9991517,0.0003861588,0.00006981031,0.0001665596,0.0001531046,0.00007269994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005172261,0.0003506244,0.00114335,0.0006393294,0.0001128236,0.0002015525,0.0003772805,0.3016172,0.007391878,0.05467774,0.03694315,0.5960279],"study_design_scores_gemma":[0.0002372532,0.0001676177,0.0004149751,0.00008390617,0.00005369693,0.0002245535,0.0002282662,0.8692307,0.003954667,0.1125213,0.0128485,0.00003467565],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02036916,0.0005162698,0.9617018,0.000383468,0.00009841096,0.000270959,0.0004364972,0.003129244,0.01309425],"genre_scores_gemma":[0.1611698,0.0002950566,0.8289417,0.0001757924,0.00003594303,0.000424647,0.001183539,0.0004001596,0.007373328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01459887,"threshold_uncertainty_score":0.04883808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02315705714667728,"score_gpt":0.2425350326295899,"score_spread":0.2193779754829126,"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."}}