{"id":"W2949599905","doi":"10.48550/arxiv.1206.4854","title":"Constraint satisfaction parameterized by solution size","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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; Hungarian Scientific Research Fund","keywords":"Parameterized complexity; Constraint satisfaction problem; Cardinality (data modeling); Mathematics; Complexity of constraint satisfaction; Constraint satisfaction dual problem; Constraint (computer-aided design); Constraint satisfaction; Combinatorics; Set (abstract data type); Vertex cover; Variable (mathematics); Mathematical optimization; Discrete mathematics; Local consistency; Time complexity; Computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00224109,0.001162283,0.001484801,0.00078264,0.0009254924,0.004226556,0.002502307,0.002068336,0.01177376],"category_scores_gemma":[0.02948577,0.0009008384,0.001819378,0.002485605,0.001652751,0.007754348,0.002299221,0.003136124,0.0009372355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003631396,"about_ca_system_score_gemma":0.002571495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003347842,"about_ca_topic_score_gemma":0.003890051,"domain_scores_codex":[0.9951251,0.001611328,0.000283733,0.001489285,0.0008026144,0.0006878484],"domain_scores_gemma":[0.9788859,0.0152474,0.001795891,0.002772169,0.0008028731,0.0004957479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00069956,0.0003552293,0.00486647,0.0008581044,0.000296705,0.0003301479,0.0006752175,0.7053078,0.01315227,0.2031316,0.01061532,0.05971153],"study_design_scores_gemma":[0.0001049444,0.00008239967,0.0007380163,0.00004434903,0.00006352936,0.0001820436,0.0001493978,0.770032,0.00342584,0.2209301,0.004216162,0.00003130213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3051755,0.001262574,0.6484081,0.006003665,0.00009590463,0.0004394829,0.004004261,0.0025031,0.03210749],"genre_scores_gemma":[0.8107976,0.0007196202,0.1747143,0.0006367473,0.0001222478,0.0007354809,0.003595426,0.0009288806,0.007749525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01177376,"threshold_uncertainty_score":0.03938717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07530897034138763,"score_gpt":0.221879966966427,"score_spread":0.1465709966250394,"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."}}