{"id":"W1561229603","doi":"10.1007/11564751_30","title":"Maximum Constraint Satisfaction on Diamonds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constraint satisfaction problem; Constraint (computer-aided design); Computer science; Constraint satisfaction dual problem; Lattice (music); Constraint satisfaction; Domain (mathematical analysis); Mathematical optimization; Combinatorics; Mathematics; Local consistency; Artificial intelligence; Geometry","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001045832,0.0005959623,0.0005020854,0.001422305,0.0003237025,0.0004868319,0.003045337,0.0003533062,0.00008823154],"category_scores_gemma":[0.0001263432,0.0005501723,0.0001635887,0.0007450071,0.00146191,0.0007447088,0.001093152,0.001504212,0.0002340849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005999727,"about_ca_system_score_gemma":0.0004943454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009833951,"about_ca_topic_score_gemma":0.00008334064,"domain_scores_codex":[0.9950818,0.00006212077,0.0004935599,0.001872631,0.001555506,0.000934372],"domain_scores_gemma":[0.9965897,0.0007828446,0.0002399175,0.00188162,0.0002272051,0.0002787031],"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.000008398046,0.00001575026,0.00004342066,0.00001001856,0.000006631743,0.00007459675,0.0001587713,0.0187393,0.0001225917,0.1430023,0.00001255051,0.8378056],"study_design_scores_gemma":[0.0003740826,0.0004106062,0.0004799525,0.0003115081,0.000004152987,0.0001215018,1.605478e-7,0.1153837,0.002033748,0.877189,0.002805602,0.0008859708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001402117,0.0001989216,0.98373,0.001041362,0.001429004,0.000441905,0.000007722455,0.0002415243,0.0127693],"genre_scores_gemma":[0.4487894,0.0001339057,0.5459548,0.002865748,0.001006061,0.00002786271,0.000006002694,0.00008503681,0.001131256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8369197,"threshold_uncertainty_score":0.999695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02052824555327904,"score_gpt":0.2781065930185123,"score_spread":0.2575783474652333,"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."}}