{"id":"W2159652182","doi":"10.1002/jcd.20280","title":"An existence theory for loopy graph decompositions","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Simple graph; Complement graph; Line graph; Graph power","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297333,0.000128586,0.0002447652,0.0001621372,0.00009692719,0.00003286726,0.0003221573,0.00008826567,0.0000367346],"category_scores_gemma":[0.00002919018,0.0001149117,0.0001986668,0.0001420355,0.00004604043,0.0003396457,0.000004820674,0.0001564027,0.000005093791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002627722,"about_ca_system_score_gemma":0.0000266779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.689271e-7,"about_ca_topic_score_gemma":3.360535e-7,"domain_scores_codex":[0.9990411,0.0001525057,0.0004033734,0.0000733959,0.0001404348,0.0001892026],"domain_scores_gemma":[0.9991943,0.0001616724,0.000130115,0.0001794067,0.0001796104,0.0001548819],"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.0003692273,0.0002016195,0.00009721542,0.00004336247,0.0001451761,0.00001979074,0.001095463,0.0002131678,0.02825636,0.9684165,0.0006188408,0.0005233393],"study_design_scores_gemma":[0.001146081,0.001033711,0.0003161511,0.00006572647,0.00008848615,0.0000942229,0.0002673612,0.0001871967,0.03290552,0.9630829,0.0006229033,0.0001897039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.491038,0.0006685148,0.4848159,0.000008822977,0.01680049,0.0004116962,0.00001645082,0.0001597608,0.006080315],"genre_scores_gemma":[0.9960828,0.00001674778,0.003412663,0.00001211741,0.0004244801,0.00001149423,0.000001130513,0.00002741878,0.00001111956],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5050448,"threshold_uncertainty_score":0.4685962,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03905277402300821,"score_gpt":0.2514002905828278,"score_spread":0.2123475165598196,"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."}}