{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348209,0.001198392,0.001297368,0.001781035,0.001387818,0.004477561,0.004322381,0.001532579,0.01218472],"category_scores_gemma":[0.016101,0.0008792534,0.003482698,0.001941919,0.004199268,0.01814589,0.00637249,0.009212848,0.001525039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003579796,"about_ca_system_score_gemma":0.001481823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002001854,"about_ca_topic_score_gemma":0.001802984,"domain_scores_codex":[0.9944938,0.0009275178,0.0002616675,0.001613063,0.001967249,0.0007367354],"domain_scores_gemma":[0.9843329,0.01026562,0.0005071498,0.003499236,0.0009609738,0.0004340856],"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.0001629351,0.0001417235,0.0009494232,0.0003570773,0.00006215413,0.0001971934,0.0004708238,0.01575638,0.007621459,0.9286951,0.005232395,0.04035328],"study_design_scores_gemma":[0.00002918257,0.00008492065,0.0006168797,0.00002852594,0.00006099258,0.0001590518,0.00005631533,0.04333575,0.006835472,0.9417393,0.007019604,0.00003393395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08584034,0.001901857,0.821829,0.005293597,0.0004149865,0.0001855297,0.001074472,0.003577242,0.07988297],"genre_scores_gemma":[0.8572087,0.001174017,0.1199626,0.002632183,0.001246811,0.0003536783,0.001337932,0.001264197,0.01481976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01218472,"threshold_uncertainty_score":0.04076189,"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."}}