{"id":"W2562647514","doi":"10.1145/3026744.3026746","title":"An improved homomorphism preservation theorem from lower bounds in circuit complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphism; Quantifier elimination; Rank (graph theory); Mathematics; Isomorphism (crystallography); Sentence; Quantifier (linguistics); Discrete mathematics; Upper and lower bounds; Function (biology); Combinatorics; Computer science","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.0006199116,0.0002018487,0.0002517623,0.0001782265,0.0001277038,0.0001618679,0.003373464,0.0001188713,0.0001835831],"category_scores_gemma":[0.0006278562,0.0001492485,0.00006701777,0.000570303,0.0003178118,0.002224498,0.0007095621,0.0002142976,0.0001151994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271231,"about_ca_system_score_gemma":0.00009316282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006099009,"about_ca_topic_score_gemma":0.0008905889,"domain_scores_codex":[0.99763,0.0003660937,0.0003275318,0.0007525306,0.0003658589,0.0005579957],"domain_scores_gemma":[0.9961503,0.0007156314,0.0001148959,0.002718478,0.0001214067,0.0001793337],"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.0001491535,0.0003861666,0.02675619,0.000006631422,0.00002573679,0.00005427158,0.001030602,0.00001242,0.2913641,0.5195251,0.0005978914,0.1600917],"study_design_scores_gemma":[0.0009975608,0.0002195507,0.03472203,0.00002267153,0.000001863916,0.000002475695,0.00002148936,0.003267331,0.003093441,0.9556391,0.001765418,0.0002470712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5252822,0.00007179305,0.4695104,0.002795838,0.0003535875,0.0004285387,0.00003207085,0.000239963,0.001285653],"genre_scores_gemma":[0.9794418,0.00001870409,0.01961931,0.0004655436,0.00009209056,0.00005165687,0.00001328958,0.00002135532,0.0002762302],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4541596,"threshold_uncertainty_score":0.6268791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06368496125477932,"score_gpt":0.3068169852129929,"score_spread":0.2431320239582136,"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."}}