{"id":"W2583707524","doi":"10.4230/lipics.itcs.2017.27","title":"An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity","year":2016,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Exploratory Research for Advanced Technology; National Institute of Informatics","keywords":"Homomorphism; Mathematics; Quantifier elimination; Rank (graph theory); Discrete mathematics; Upper and lower bounds; Quantifier (linguistics); Isomorphism (crystallography); Combinatorics; Sentence; Proof complexity; Function (biology); Order (exchange); Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003011403,0.001131092,0.001178547,0.001578662,0.001250236,0.00418493,0.004092749,0.00132884,0.01079248],"category_scores_gemma":[0.01400655,0.0007561932,0.00284467,0.002100811,0.003895789,0.01570353,0.00554661,0.008347115,0.001540129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003089971,"about_ca_system_score_gemma":0.001379858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001858088,"about_ca_topic_score_gemma":0.001467035,"domain_scores_codex":[0.995274,0.0007959324,0.0002256396,0.00131923,0.001756515,0.000628669],"domain_scores_gemma":[0.9861677,0.008992814,0.0004256944,0.003154961,0.0008716923,0.0003871471],"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.0001832853,0.000158607,0.001008597,0.0003602009,0.00005547775,0.0001998858,0.0004905637,0.01729872,0.008807624,0.9173258,0.005594458,0.04851684],"study_design_scores_gemma":[0.00003202811,0.00009769973,0.0007024058,0.00002746049,0.00005951887,0.0001627231,0.00005711921,0.05724274,0.008595088,0.9250044,0.007985131,0.00003362088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09124433,0.001746856,0.8210772,0.004916458,0.0003369795,0.00017488,0.001079699,0.003697713,0.07572585],"genre_scores_gemma":[0.8559287,0.001063853,0.1233465,0.002299506,0.001097584,0.0003309509,0.001298658,0.001106803,0.01352747],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01079248,"threshold_uncertainty_score":0.03610438,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09023575595849773,"score_gpt":0.189697042923352,"score_spread":0.09946128696485426,"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."}}