{"id":"W172001932","doi":"","title":"An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Algorithm; Computer science; Artificial intelligence","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.0006058331,0.0009889874,0.0007818983,0.001522619,0.001153288,0.001562767,0.002265244,0.001439179,0.01291329],"category_scores_gemma":[0.005187943,0.0005413515,0.0006779385,0.002441326,0.0007448544,0.002768027,0.002587673,0.001091236,0.003124771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00123566,"about_ca_system_score_gemma":0.002387986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004211855,"about_ca_topic_score_gemma":0.007298824,"domain_scores_codex":[0.9992423,0.0001764926,0.00005052051,0.0001786101,0.0002051053,0.0001469748],"domain_scores_gemma":[0.997798,0.001024328,0.0001291698,0.0006184932,0.0003028977,0.0001272834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007516216,0.0004520018,0.001614478,0.0006374573,0.0001143636,0.0003601419,0.0004440474,0.06013909,0.01278627,0.08645368,0.08352654,0.7527204],"study_design_scores_gemma":[0.0006460892,0.0003143371,0.0010449,0.0001065956,0.0001339533,0.0006724334,0.0003091977,0.6794746,0.0143574,0.2583005,0.0445622,0.00007779864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0530851,0.0008761409,0.9042123,0.001001841,0.0002358145,0.0007697657,0.001567667,0.009750132,0.02850129],"genre_scores_gemma":[0.2244477,0.0003861912,0.7585049,0.0002884542,0.0001085589,0.0008008722,0.004104257,0.0008102758,0.01054885],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01291329,"threshold_uncertainty_score":0.04319924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01060679274702316,"score_gpt":0.2452965118715161,"score_spread":0.234689719124493,"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."}}