{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00102608,0.0006709951,0.001139219,0.0009843596,0.001041583,0.001784384,0.001751065,0.0008764284,0.0124426],"category_scores_gemma":[0.004877076,0.0009145736,0.0009882108,0.00302813,0.001044117,0.002738931,0.002036253,0.00264707,0.001122195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008944814,"about_ca_system_score_gemma":0.0007846611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002617161,"about_ca_topic_score_gemma":0.00389167,"domain_scores_codex":[0.9989415,0.000332121,0.00006630716,0.0001526816,0.0003928901,0.0001145954],"domain_scores_gemma":[0.9974186,0.001761561,0.0001189068,0.0002275532,0.000356434,0.0001168919],"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.0001240224,0.00005925617,0.0002546061,0.0006388892,0.00003649825,0.0001284728,0.0003209072,0.03043329,0.003738657,0.8459789,0.02034495,0.09794156],"study_design_scores_gemma":[0.00004013544,0.00002172661,0.00013045,0.00005395286,0.000009161725,0.0000682162,0.00008319549,0.04468253,0.001163356,0.9409331,0.01280175,0.00001238575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06128198,0.001540845,0.7885959,0.001791116,0.0003094009,0.0001999823,0.001754575,0.0005982217,0.143928],"genre_scores_gemma":[0.4583171,0.001773686,0.4802731,0.0005713163,0.0002349261,0.0003874182,0.003428413,0.0005045865,0.05450955],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0124426,"threshold_uncertainty_score":0.04162461,"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."}}