{"id":"W3183008868","doi":"10.1007/s00373-021-02367-w","title":"Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts","year":2021,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Unanimity; Homomorphism; Discrete mathematics; Graph","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005517244,0.000311303,0.0003673467,0.0004002502,0.0005159925,0.0003816861,0.0008135036,0.0001697323,0.00002155774],"category_scores_gemma":[0.0001253363,0.0003212254,0.0001450754,0.003662342,0.0001186126,0.0009116044,0.0006362738,0.0005602772,0.00003128805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000357051,"about_ca_system_score_gemma":0.0001333501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000166217,"about_ca_topic_score_gemma":0.000008491081,"domain_scores_codex":[0.9971496,0.000176028,0.0003790101,0.0008482407,0.0006292252,0.0008178338],"domain_scores_gemma":[0.9977081,0.0001761607,0.0001496939,0.001074634,0.000444104,0.0004472414],"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.00001582221,0.0001906386,0.002326692,0.00004365386,0.00005674211,0.0002519347,0.0004034943,0.000001474161,0.0153331,0.9724979,0.0002370154,0.008641494],"study_design_scores_gemma":[0.0008132746,0.0001908503,0.01833211,0.00006359049,0.00001788403,0.0002215396,0.00003942539,0.001903587,0.01318226,0.9586357,0.006032405,0.0005673568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9404018,0.007313577,0.0406162,0.003555548,0.001972286,0.0004637297,0.00001923254,0.0008405632,0.004817043],"genre_scores_gemma":[0.9954745,0.001157699,0.002164396,0.0004971481,0.00002176484,0.00003361671,0.00001109872,0.00003289104,0.0006068896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05507268,"threshold_uncertainty_score":0.999924,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01779739320327826,"score_gpt":0.2520450839134008,"score_spread":0.2342476907101225,"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."}}