{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004250792,0.0002275498,0.0002620089,0.0001824318,0.0001395439,0.0001233674,0.001947853,0.0001315921,0.0001415383],"category_scores_gemma":[0.00006381374,0.0002045199,0.00009819917,0.0008202637,0.0002888071,0.002087817,0.0005316415,0.0001643411,0.00007261331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00033299,"about_ca_system_score_gemma":0.0001068978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009759467,"about_ca_topic_score_gemma":0.0005413366,"domain_scores_codex":[0.997869,0.0002771196,0.0002326188,0.001073324,0.0001203244,0.0004276454],"domain_scores_gemma":[0.9977116,0.0002872235,0.0001349753,0.001518858,0.0001591122,0.0001882307],"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.0001243727,0.001120263,0.0892036,0.00001233518,0.00005180769,0.0003144633,0.0008791283,0.002337109,0.01075274,0.8786035,0.0001005041,0.01650022],"study_design_scores_gemma":[0.001038532,0.0001635984,0.08855491,0.00001610965,0.000007145311,0.000001763778,0.00001925959,0.4354401,0.0003051262,0.4739939,0.0001657596,0.0002938338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4984274,0.000006231271,0.5001553,0.0001639944,0.0002384474,0.0001576062,0.00001255803,0.0001752711,0.0006631549],"genre_scores_gemma":[0.9962449,0.000007403149,0.003308211,0.0001189847,0.00006239386,0.000001046236,0.000007254975,0.00001242486,0.000237396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4978175,"threshold_uncertainty_score":0.8340079,"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."}}