{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001308518,0.0001107418,0.000298586,0.0001068993,0.00004333687,0.00000218827,0.0001308298,0.00004862528,0.0001485814],"category_scores_gemma":[0.00005687346,0.0001047149,0.0001057501,0.000226932,0.0001177824,0.00005260845,0.00001588996,0.0000562952,0.00002901997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005799169,"about_ca_system_score_gemma":0.000008941551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002563052,"about_ca_topic_score_gemma":7.052226e-7,"domain_scores_codex":[0.999172,0.00002865481,0.0004249075,0.00008258835,0.0001479824,0.0001439075],"domain_scores_gemma":[0.9994106,0.0001660725,0.00006796562,0.0002682657,0.00004343647,0.00004371504],"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.00001720861,0.0002080715,0.004457319,0.002580529,0.0003006741,0.000007664555,0.01425686,0.0005633548,0.02564994,0.9502369,0.001381322,0.0003401536],"study_design_scores_gemma":[0.003767732,0.0008682918,0.06811505,0.003120892,0.0005786518,0.0005858181,0.01037645,0.1194434,0.0789757,0.7071775,0.004438386,0.002552114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9756554,0.0003288635,0.001817075,0.000003607425,0.0001053582,0.00013086,0.0001072863,0.0001070911,0.0217445],"genre_scores_gemma":[0.9970431,0.00001075826,0.002881628,0.000001880717,0.000003194303,0.000009579816,0.000009939906,0.00001878602,0.00002109282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2430594,"threshold_uncertainty_score":0.4270148,"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."}}