{"id":"W2521832422","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compact space; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Axiom; Hierarchy; Ultrafilter; Local consistency; Constraint satisfaction; Constraint logic programming; Discrete mathematics; Pure mathematics; Probabilistic logic; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.01021362,0.000536696,0.0009189717,0.0006489702,0.0006960686,0.002050163,0.005725055,0.0004297003,0.00001383061],"category_scores_gemma":[0.001070016,0.0004242634,0.0001373324,0.0008206278,0.005080994,0.001006236,0.0131899,0.002174148,0.000008929011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002406327,"about_ca_system_score_gemma":0.0004090697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006564135,"about_ca_topic_score_gemma":0.00001253985,"domain_scores_codex":[0.9928744,0.001529493,0.0007049546,0.002669226,0.001090391,0.001131529],"domain_scores_gemma":[0.9946309,0.0016423,0.0004587317,0.002429613,0.0003078025,0.000530672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009567154,0.00008199122,0.003290958,0.00008233535,0.000008056617,0.00008414413,0.0003276451,0.007122217,0.001093768,0.1406995,0.000005385978,0.8471944],"study_design_scores_gemma":[0.0002391391,0.0001443216,0.06161649,0.0001794577,0.000002582379,0.000107605,0.000003750384,0.3752865,0.0003422114,0.561587,0.0000636735,0.0004271979],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01602267,0.000310453,0.9792175,0.0008364352,0.001847894,0.0008230365,0.00000477157,0.0002389623,0.0006982621],"genre_scores_gemma":[0.3212909,0.00007662131,0.6783199,0.0001506272,0.0000917353,0.00005386652,7.364935e-7,0.000008600442,0.00000703125],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8467672,"threshold_uncertainty_score":0.9998209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1790849006281343,"score_gpt":0.4639551405760599,"score_spread":0.2848702399479256,"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."}}