{"id":"W2059051297","doi":"10.1016/j.ipl.2009.02.013","title":"An algorithm for computing simple k-factors","year":2009,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple (philosophy); Combinatorics; Algorithm; SIMPLE algorithm; Factor (programming language); Degenerate energy levels; Graphics; Computer science; Simple graph; Mathematics; Graph theory; Factor graph; Graph; Discrete mathematics","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.0005437993,0.00165392,0.001388466,0.001681099,0.001496797,0.002278292,0.001754211,0.001147632,0.01942554],"category_scores_gemma":[0.003259314,0.0006529285,0.001565538,0.003057442,0.001040034,0.003938685,0.002600773,0.001397804,0.009580457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015709,"about_ca_system_score_gemma":0.001839313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002696301,"about_ca_topic_score_gemma":0.005073532,"domain_scores_codex":[0.999141,0.0001029984,0.00007338928,0.0002254764,0.0002777414,0.0001793504],"domain_scores_gemma":[0.9985999,0.0004087879,0.00006961184,0.0004673124,0.0003504537,0.000103912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001078853,0.0002489636,0.001463805,0.0005813205,0.0001182016,0.0001711919,0.0004616491,0.009890327,0.02075985,0.090918,0.02885126,0.8454565],"study_design_scores_gemma":[0.000793676,0.0005790347,0.001992119,0.0001688207,0.0003239381,0.001048714,0.0006151956,0.1549061,0.03713465,0.7183349,0.08385859,0.0002442216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03138113,0.0005619263,0.944168,0.0004396321,0.0002746141,0.0003403552,0.000849052,0.00717116,0.01481402],"genre_scores_gemma":[0.1082301,0.0002694943,0.8788674,0.0001457567,0.00007817672,0.0002850587,0.001592049,0.0006397539,0.009892128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01942554,"threshold_uncertainty_score":0.06498492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01734897957320729,"score_gpt":0.3084865655723162,"score_spread":0.2911375859991089,"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."}}