{"id":"W36932259","doi":"10.1007/s00247-023-05643-4","title":"Minimal Defining Sets of 1-Factorizations of Complete Graphs","year":2008,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Equivalence (formal languages); Combinatorics; Set (abstract data type); Graph; Unipotent; Discrete mathematics; Computer science; Algorithm","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.0008683661,0.0004559252,0.0005798529,0.001154136,0.001474516,0.00167028,0.0007986291,0.0004321843,0.002706277],"category_scores_gemma":[0.002377616,0.0005451633,0.0008097447,0.0005040992,0.002035781,0.002271564,0.001603823,0.001388849,0.0004050844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008018833,"about_ca_system_score_gemma":0.0004445634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003836587,"about_ca_topic_score_gemma":0.000658405,"domain_scores_codex":[0.9990157,0.0002442308,0.00007068707,0.0002549101,0.0002508439,0.0001635732],"domain_scores_gemma":[0.9979468,0.0009404938,0.000314517,0.0002683032,0.0002597505,0.0002701825],"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.00005814384,0.00004320785,0.0008067805,0.00005759401,0.000008988862,0.00008326489,0.0004008579,0.002141139,0.005342171,0.9804223,0.0008843099,0.00975116],"study_design_scores_gemma":[0.00004171616,0.00008049808,0.001083546,0.00002874225,0.00002104521,0.0003899085,0.0002542308,0.009852557,0.009288447,0.9680669,0.01084972,0.00004255943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7228079,0.0004138931,0.2363745,0.0003237858,0.00007258499,0.0001322424,0.0007893771,0.000237132,0.03884866],"genre_scores_gemma":[0.8805949,0.0002661152,0.1077298,0.0001752037,0.0001261124,0.0002492349,0.001308881,0.0001054773,0.009444304],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002706277,"threshold_uncertainty_score":0.009053469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02718840041487686,"score_gpt":0.2203121419055028,"score_spread":0.193123741490626,"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."}}