{"id":"W2406787877","doi":"","title":"On constructions of infinite families of k-tight optimal double-loop networks.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Loop (graph theory); Double loop; Combinatorics; Business","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.001110384,0.0006821575,0.0006720998,0.001158842,0.001741362,0.002098045,0.00145143,0.0008868364,0.01018014],"category_scores_gemma":[0.007419346,0.0007621167,0.0007532674,0.001215419,0.001798347,0.004183758,0.002961966,0.001969402,0.001466042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595948,"about_ca_system_score_gemma":0.0006877201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009120757,"about_ca_topic_score_gemma":0.001428305,"domain_scores_codex":[0.9992348,0.0002465688,0.00004430961,0.0001388437,0.0001677226,0.0001677297],"domain_scores_gemma":[0.9975361,0.001427721,0.000220062,0.0003599995,0.0002378172,0.0002182795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001200593,0.00004787666,0.0005509958,0.0001801147,0.00002381829,0.000158022,0.000546204,0.03419248,0.002772131,0.9260218,0.004474998,0.03091149],"study_design_scores_gemma":[0.00003407005,0.00004747204,0.0003009748,0.0001390361,0.00002854733,0.0002221695,0.0002657869,0.09331848,0.002404052,0.8909876,0.01221725,0.00003460934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1522231,0.00126438,0.7590256,0.0008381923,0.0001235882,0.0001146664,0.0004507212,0.001090455,0.08486929],"genre_scores_gemma":[0.8112981,0.00116334,0.1716691,0.0003228716,0.00005999166,0.0003082303,0.0007182647,0.0003945327,0.0140657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01018014,"threshold_uncertainty_score":0.03405601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01153215209361586,"score_gpt":0.2313971801972421,"score_spread":0.2198650281036263,"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."}}