{"id":"W1540511301","doi":"10.1007/978-3-642-13059-5_12","title":"Finding a Single, All, or the Most Probable Solution to a Finite or Non-finite Interval Algebra Network","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Acadia University","funders":"","keywords":"Interval (graph theory); Computer science; Algebra over a field; Mathematics; Pure mathematics; Combinatorics","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.001441723,0.0007100056,0.001258715,0.001046641,0.0008958285,0.00191188,0.002563794,0.001769909,0.007564433],"category_scores_gemma":[0.007634005,0.0006414524,0.001663337,0.001287039,0.001304578,0.003842281,0.001050529,0.001517402,0.0006906794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055277,"about_ca_system_score_gemma":0.001628764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002897931,"about_ca_topic_score_gemma":0.00366682,"domain_scores_codex":[0.9992399,0.0002252027,0.00004554688,0.0003091077,0.0001039638,0.00007625675],"domain_scores_gemma":[0.9967787,0.002598166,0.0002078769,0.0001568123,0.0001594939,0.00009905855],"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.0002085587,0.000108299,0.002258115,0.0005628748,0.0002438165,0.0002002325,0.000370854,0.7679766,0.001946312,0.1111942,0.004106991,0.1108231],"study_design_scores_gemma":[0.00002720463,0.00005879766,0.000267385,0.00003881233,0.00005924972,0.0001242689,0.0002117528,0.7975737,0.001181964,0.1985597,0.001875203,0.00002197236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05258165,0.0004526712,0.9376333,0.001203441,0.00005331474,0.0001252547,0.0006935989,0.0003316949,0.00692505],"genre_scores_gemma":[0.3348526,0.0006321941,0.6576188,0.0001775118,0.0001148727,0.000191635,0.001345998,0.0001453021,0.004921087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007564433,"threshold_uncertainty_score":0.02530551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03095552379147703,"score_gpt":0.2552536660045475,"score_spread":0.2242981422130704,"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."}}