{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001096095,0.0005415489,0.000448084,0.0005525671,0.000653824,0.001340768,0.002689357,0.0003841483,0.0001296031],"category_scores_gemma":[0.0004319469,0.0003299103,0.0001196946,0.001501751,0.0004892833,0.0007685135,0.001588119,0.001156709,0.00008377873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002854966,"about_ca_system_score_gemma":0.0008213216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002545306,"about_ca_topic_score_gemma":0.002091677,"domain_scores_codex":[0.9962995,0.00005326053,0.0006368484,0.001333613,0.0008172829,0.0008594907],"domain_scores_gemma":[0.9967152,0.001197742,0.0003698743,0.001206992,0.0002793295,0.0002308957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004635543,0.00002793618,0.00003061022,0.00002249863,0.00001876424,0.00005418652,0.001618334,0.3131663,0.0002110874,0.001935086,0.0002056401,0.6826632],"study_design_scores_gemma":[0.0003132735,0.0004235214,0.00009147781,0.0006295628,0.00001553401,0.00013221,5.802448e-7,0.9721677,0.0003896967,0.01174038,0.01339458,0.0007015116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002859149,0.00002866033,0.9902146,0.004301666,0.003317528,0.0009106827,0.000004124958,0.000185949,0.001008187],"genre_scores_gemma":[0.04441141,0.00003105222,0.9414634,0.01091667,0.001103063,0.00005048934,0.00001305617,0.00005561521,0.001955307],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6819617,"threshold_uncertainty_score":0.9999153,"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."}}