{"id":"W4244133084","doi":"10.1137/1.9781611974782.141","title":"Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California, San Diego; National Science Foundation","keywords":"Tuple; Completeness (order theory); Property (philosophy); Exponential time hypothesis; Time complexity; Exponential function; Set (abstract data type); Computer science; PSPACE; Class (philosophy); Data structure; Mathematics; Order (exchange); Algorithm; Computational complexity theory; Discrete mathematics; Combinatorics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00008831322,0.0001650865,0.0001674342,0.00006584316,0.001399636,0.0005624401,0.001666067,0.0000382553,0.00001420078],"category_scores_gemma":[0.00001836196,0.0001101292,0.00005106473,0.00009514497,0.0002180304,0.0003380091,0.000225215,0.00008644291,0.00001520184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001509176,"about_ca_system_score_gemma":0.00004697436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008407808,"about_ca_topic_score_gemma":0.0001521346,"domain_scores_codex":[0.9989643,0.00001064083,0.000137145,0.0004230471,0.0002044397,0.0002604947],"domain_scores_gemma":[0.9982652,0.00005868282,0.0001079137,0.001324492,0.0001740558,0.00006967619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003274425,0.0001210451,0.0002419973,0.00006000862,0.00004887607,0.000002599359,0.0002757324,0.00061671,0.00008665641,0.8692055,0.0006032295,0.128705],"study_design_scores_gemma":[0.002453313,0.0007896897,0.01623761,0.0001112756,0.00003016146,0.00005279365,0.0001318135,0.6289887,0.004787338,0.2281778,0.1171011,0.001138341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001321176,0.00003042325,0.9925107,0.003174626,0.0001528026,0.0008272499,0.00001298199,0.0001712953,0.001798792],"genre_scores_gemma":[0.5895782,0.000006572984,0.4086255,0.0004776794,0.0001590507,0.0006165578,0.000005126125,0.00001567995,0.000515545],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6410276,"threshold_uncertainty_score":0.9999004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06519014408323036,"score_gpt":0.2715318482800997,"score_spread":0.2063417041968693,"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."}}