{"id":"W2142062721","doi":"10.1016/s0012-365x(99)00359-3","title":"On the problem of a matching orthogonal to a 2-factorization","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Graph factorization; Factorization; Bipartite graph; Enhanced Data Rates for GSM Evolution; Graph; Factor-critical graph; Discrete mathematics; Algorithm; Line graph; Graph power; Computer science; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636877,0.001091685,0.002177278,0.001110853,0.002048951,0.003244037,0.001731843,0.005726371,0.0160224],"category_scores_gemma":[0.01805709,0.0009878771,0.001326979,0.002144563,0.003555067,0.009055153,0.003289942,0.00362539,0.001617532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00138261,"about_ca_system_score_gemma":0.001792833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002872917,"about_ca_topic_score_gemma":0.001649012,"domain_scores_codex":[0.9984491,0.0005362637,0.00007949329,0.0004500441,0.0002376257,0.0002475468],"domain_scores_gemma":[0.9921257,0.006122138,0.0005480101,0.0004833537,0.0004010375,0.0003197149],"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.0004295555,0.0001673152,0.0004204638,0.000338003,0.00005382562,0.0001630409,0.0003049317,0.03365811,0.001349046,0.9078569,0.01623568,0.03902319],"study_design_scores_gemma":[0.00006785573,0.00004860635,0.0001253127,0.00003910483,0.00001591013,0.00009971778,0.0001741025,0.06299154,0.0004084535,0.9324659,0.003542812,0.00002074814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1807671,0.002093201,0.7315525,0.01350825,0.001141572,0.0003144048,0.001079035,0.0004360014,0.06910794],"genre_scores_gemma":[0.6489673,0.002991182,0.2854864,0.002210295,0.001840675,0.0003510385,0.001451749,0.0005459213,0.05615537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0160224,"threshold_uncertainty_score":0.05360031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007633022768852604,"score_gpt":0.1989644467495303,"score_spread":0.1913314239806777,"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."}}