{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003693441,0.001027355,0.001405846,0.002050445,0.002083875,0.005609294,0.00284273,0.001808162,0.007273237],"category_scores_gemma":[0.02176529,0.001146542,0.003710204,0.003530319,0.004081654,0.01595865,0.004080839,0.005920087,0.001173576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002644943,"about_ca_system_score_gemma":0.003740742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003432979,"about_ca_topic_score_gemma":0.004909399,"domain_scores_codex":[0.9936795,0.001230616,0.0004456956,0.001392812,0.002280511,0.0009708852],"domain_scores_gemma":[0.962002,0.02542665,0.001812834,0.007918484,0.002244134,0.000595843],"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.0004466163,0.0004049701,0.004729462,0.0007857523,0.0001410341,0.0002007035,0.001424226,0.07351736,0.006490885,0.8259906,0.008873774,0.07699476],"study_design_scores_gemma":[0.00004721849,0.00004056603,0.0007137967,0.00003567415,0.00003551481,0.0001493974,0.0001606569,0.08756646,0.004612987,0.9031843,0.003431304,0.00002204496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2123309,0.0006232032,0.7555904,0.004655181,0.00007586611,0.0002463852,0.003011441,0.003002645,0.02046401],"genre_scores_gemma":[0.7248502,0.0007402597,0.2579609,0.0009237909,0.0003335589,0.0003735494,0.00614015,0.000836562,0.007841016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007273237,"threshold_uncertainty_score":0.02433139,"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."}}