{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302144,0.0002079433,0.0004139813,0.0003335242,0.0002731619,0.0002540574,0.001574959,0.0001004275,0.0000139258],"category_scores_gemma":[0.0001533159,0.0001753239,0.00041794,0.0007331198,0.0001809935,0.001137604,0.0001919837,0.0004076565,0.00003813539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499167,"about_ca_system_score_gemma":0.0004579985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008880475,"about_ca_topic_score_gemma":7.80766e-7,"domain_scores_codex":[0.9977977,0.00008184788,0.0005873626,0.0002992196,0.0006741456,0.000559772],"domain_scores_gemma":[0.9979412,0.0002398637,0.0004182765,0.0004615553,0.000604258,0.0003348673],"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.0000978124,0.0004479803,0.0000272383,0.00001791036,0.0002029211,0.0002756802,0.0006743121,0.00124915,0.003970396,0.006935403,0.003619155,0.982482],"study_design_scores_gemma":[0.0175605,0.007368229,0.001547858,0.0003085429,0.0001114698,0.004402134,0.0001791266,0.2313463,0.04547009,0.6353648,0.0546672,0.001673751],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005499127,0.0004106601,0.9917136,0.001199576,0.0006646909,0.0002678261,0.0000133973,0.00005635418,0.0001748037],"genre_scores_gemma":[0.006499431,0.00004971782,0.9926227,0.0002336647,0.0003273895,0.000009633986,9.994026e-7,0.00002745943,0.0002289896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9808083,"threshold_uncertainty_score":0.71495,"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."}}