{"id":"W6929452493","doi":"10.48550/arxiv.1406.6413","title":"A finer reduction of constraint problems to digraphs","year":2014,"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":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Nondeterministic algorithm; Complexity of constraint satisfaction; Constraint (computer-aided design); Conjecture; Constraint satisfaction; Reduction (mathematics); Algebraic number","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.001131709,0.0005430062,0.0008356546,0.001144837,0.001281902,0.004075377,0.001603205,0.001084901,0.01225823],"category_scores_gemma":[0.005256776,0.0005175106,0.001725973,0.002102858,0.002583524,0.006623514,0.004343601,0.0058917,0.0009494356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002045732,"about_ca_system_score_gemma":0.001153124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002954218,"about_ca_topic_score_gemma":0.003349731,"domain_scores_codex":[0.9977821,0.0006311633,0.0001343974,0.0007087032,0.0004889686,0.0002547454],"domain_scores_gemma":[0.9968821,0.001852549,0.0001692041,0.0006797331,0.0002050132,0.0002114071],"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.00001660346,0.00004486274,0.0001147599,0.00005529364,0.00000947071,0.00005902267,0.0001514333,0.004510298,0.0006850195,0.9836574,0.00146065,0.009235051],"study_design_scores_gemma":[0.00001878781,0.00001147043,0.0001193666,0.00001307502,0.000007135539,0.00005397302,0.00005111062,0.01674873,0.0004284769,0.9741977,0.008342244,0.000007830842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08870517,0.0009722986,0.8307698,0.005217464,0.000300426,0.0002266908,0.001219238,0.0007511575,0.07183781],"genre_scores_gemma":[0.6663185,0.001243884,0.2949934,0.001905292,0.0006390057,0.0003264557,0.002054984,0.0004516478,0.03206677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01225823,"threshold_uncertainty_score":0.04100788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06930224953546349,"score_gpt":0.2155134806905203,"score_spread":0.1462112311550568,"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."}}