{"id":"W2250281898","doi":"","title":"Finding the most probable solution to a probabilistic temporal interval algebra network","year":2006,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University","funders":"","keywords":"Probabilistic logic; Implementation; Computer science; Theoretical computer science; Constraint satisfaction problem; Constraint programming; Domain (mathematical analysis); Constraint (computer-aided design); Constraint logic programming; Constraint satisfaction; Interval (graph theory); Binary number; Simplicity; Programming language; Algorithm; Mathematical optimization; Mathematics; Arithmetic; Artificial intelligence; Stochastic programming","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":[],"consensus_categories":[],"category_scores_codex":[0.0002901772,0.00009200296,0.000077547,0.00004385506,0.0002522182,0.000258218,0.0002968154,0.00003278501,0.00007508638],"category_scores_gemma":[0.00003359865,0.00006522542,0.00003379405,0.0005913856,0.00002941113,0.0002863422,0.0001432039,0.00007614057,0.0000760561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007205271,"about_ca_system_score_gemma":0.00006315068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002157966,"about_ca_topic_score_gemma":0.001297107,"domain_scores_codex":[0.9990958,0.00005005631,0.0002038331,0.0002445553,0.0001594213,0.0002463473],"domain_scores_gemma":[0.9995269,0.00004831118,0.00005450091,0.0002624111,0.00006245443,0.00004547764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000926547,0.00005641219,0.01102348,0.00001094105,0.0000104619,0.000003430645,0.0002839517,0.2408815,0.0001154749,0.6408719,0.06565773,0.04107549],"study_design_scores_gemma":[0.0002578322,0.00008499977,0.01910865,0.00003900762,0.000007108942,0.00003182956,0.00002882052,0.9439433,0.0001010632,0.02492185,0.01120442,0.0002711283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003363706,0.000009359559,0.9813141,0.0050987,0.0003474681,0.0004052299,4.750663e-7,0.0002234376,0.009237582],"genre_scores_gemma":[0.8763188,4.752764e-7,0.1209085,0.0007555271,0.000150362,0.0000388993,0.000006017252,0.000005575606,0.001815858],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8729551,"threshold_uncertainty_score":0.2659816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01517741712374708,"score_gpt":0.2288040644606515,"score_spread":0.2136266473369044,"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."}}