{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002297657,0.0001405751,0.000306636,0.0001614583,0.00009048118,0.0000417497,0.0004803477,0.0000997045,0.00001449493],"category_scores_gemma":[0.00001630849,0.0001284039,0.0001162298,0.0005510916,0.00008506195,0.0002258171,0.00005933307,0.0001588944,0.00000768543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002476291,"about_ca_system_score_gemma":0.0000415672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003300187,"about_ca_topic_score_gemma":0.000002433738,"domain_scores_codex":[0.9987851,0.00006407678,0.0004631133,0.0002393658,0.0002331538,0.000215197],"domain_scores_gemma":[0.9988213,0.000147357,0.000248164,0.0005081888,0.0002116192,0.0000633305],"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.00003039289,0.00009440999,0.0003285956,0.000005805919,0.00002382451,0.000002306082,0.000199118,0.01082458,0.00009164192,0.9848748,0.001615959,0.001908545],"study_design_scores_gemma":[0.0104472,0.005150108,0.009691245,0.0008370171,0.00007050452,0.0001577083,0.0005451926,0.474074,0.01689924,0.4755228,0.005207383,0.001397587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9424741,0.000167776,0.03086026,0.0002158542,0.006802187,0.0002597117,0.000002596453,0.000131667,0.01908589],"genre_scores_gemma":[0.9988321,0.0000245976,0.0008880831,0.00008236929,0.00001928721,0.000005038874,0.000001795416,0.000005521715,0.0001411814],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.509352,"threshold_uncertainty_score":0.523616,"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."}}