{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004825418,0.000225496,0.000262132,0.0001223633,0.0002179687,0.0002493801,0.00130202,0.0001437454,0.00009107986],"category_scores_gemma":[0.000005371701,0.0002105661,0.00009090771,0.0005604601,0.00002797571,0.0006974705,0.0002237655,0.000214825,0.000227527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005933298,"about_ca_system_score_gemma":0.00004160376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001868172,"about_ca_topic_score_gemma":0.000009235346,"domain_scores_codex":[0.9981758,0.0001069237,0.0003536096,0.000576604,0.0002664969,0.0005205842],"domain_scores_gemma":[0.9983837,0.00003596835,0.0001002723,0.0009566938,0.000179841,0.0003435433],"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.00003773842,0.0002724955,0.0005246717,0.0000041562,0.00004566322,0.00006084084,0.001987192,0.001605008,0.0000501152,0.9598787,0.01224773,0.02328566],"study_design_scores_gemma":[0.002566306,0.001616336,0.004347114,0.00007802241,0.00001865288,0.0001117153,0.00013382,0.9438845,0.001945961,0.03096668,0.01322127,0.001109657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2070334,0.0001295174,0.7608159,0.0001793882,0.02006859,0.0005522768,0.000001788141,0.000561131,0.01065801],"genre_scores_gemma":[0.9755623,0.000004636791,0.02279416,0.0003908124,0.0001089889,0.00005334925,0.000003513966,0.00002462287,0.0010576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9422795,"threshold_uncertainty_score":0.8586637,"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."}}