{"id":"W1992517803","doi":"10.1016/j.jalgor.2004.04.011","title":"A polynomial-time algorithm for near-unanimity graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Time complexity; Unanimity; Algorithm; Combinatorics; Polynomial; Mathematics; Computer science; 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.001698256,0.001627175,0.002307337,0.002158034,0.003739516,0.004022362,0.005986524,0.003089075,0.01279185],"category_scores_gemma":[0.008184201,0.001359407,0.002291949,0.00354126,0.002195335,0.0128541,0.005936399,0.003586406,0.003465193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003914798,"about_ca_system_score_gemma":0.004485105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00456562,"about_ca_topic_score_gemma":0.008688976,"domain_scores_codex":[0.9973602,0.0003815615,0.0001771594,0.0009914944,0.0006601568,0.0004294526],"domain_scores_gemma":[0.9936191,0.002986938,0.0003849212,0.001844989,0.0006477084,0.0005162696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002320883,0.001611638,0.002781615,0.001392564,0.0002252948,0.0003381101,0.001564823,0.07244643,0.02341389,0.2174543,0.05016851,0.626282],"study_design_scores_gemma":[0.0006682047,0.0003175712,0.0009723368,0.0001142455,0.0001970051,0.000448655,0.0005818245,0.2927638,0.01235268,0.673286,0.01819623,0.0001013827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.130797,0.0008084229,0.8264155,0.00427987,0.0004104811,0.001041015,0.00185186,0.01002357,0.02437231],"genre_scores_gemma":[0.248455,0.0003589411,0.7297264,0.0006199955,0.0001989382,0.0005911124,0.004119448,0.001165218,0.01476512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01279185,"threshold_uncertainty_score":0.04279298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01618163022204756,"score_gpt":0.2872839656478463,"score_spread":0.2711023354257988,"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."}}