{"id":"W2063991224","doi":"10.1016/s0304-3975(01)00152-9","title":"Lower bounds for invariant queries in logics with counting","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Preorder; Unary operation; Locality; Transitive closure; Mathematics; Discrete mathematics; Complexity class; Expressive power; First-order logic; Binary relation; Transitive relation; Second-order logic; Succinctness; Invariant (physics); Proof theory; Combinatorics; Time complexity; Higher-order logic; Computer science; Mathematical proof; Theoretical computer science; Description logic","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.03695344,0.006875473,0.0106745,0.01518863,0.009433473,0.03565769,0.02281089,0.01115163,0.03724897],"category_scores_gemma":[0.1986121,0.006021284,0.009559476,0.01922091,0.01725947,0.09404856,0.02272994,0.03189531,0.005980928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.02502489,"about_ca_system_score_gemma":0.01210869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006435675,"about_ca_topic_score_gemma":0.009827159,"domain_scores_codex":[0.9306872,0.01777509,0.003892061,0.01003113,0.02223197,0.01538245],"domain_scores_gemma":[0.5746979,0.3710812,0.00829072,0.02503864,0.0104907,0.01040095],"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.003483757,0.001312573,0.004732781,0.001532431,0.0005090221,0.000308134,0.001691732,0.05973632,0.003265507,0.8157648,0.03332645,0.07433649],"study_design_scores_gemma":[0.0001919933,0.00009780898,0.0004391562,0.0001567845,0.000359271,0.0001603013,0.0002220854,0.1356379,0.001843734,0.8578503,0.002942232,0.00009850121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08792121,0.01015186,0.7637694,0.03828401,0.00149961,0.0008676043,0.004355214,0.006920708,0.08623037],"genre_scores_gemma":[0.710402,0.007124416,0.2176957,0.01264348,0.007378161,0.00198035,0.008350865,0.007311928,0.02711325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03724897,"threshold_uncertainty_score":0.1954308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02230894930910513,"score_gpt":0.2362898047697848,"score_spread":0.2139808554606797,"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."}}