{"id":"W4225692987","doi":"10.1609/aaai.v36i9.21224","title":"Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Controllability; Leverage (statistics); Computer science; Graph; Scheduling (production processes); Benchmark (surveying); Search tree; Artificial intelligence; Search algorithm; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","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.000714934,0.0004190226,0.0004971829,0.0002146776,0.001001922,0.000318237,0.001761376,0.0001017285,0.00002746659],"category_scores_gemma":[0.0001176649,0.0003135725,0.0001487404,0.002368275,0.0008131979,0.0005116149,0.0008963713,0.001091337,7.436039e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001614384,"about_ca_system_score_gemma":0.0001564273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001754787,"about_ca_topic_score_gemma":0.00005656437,"domain_scores_codex":[0.996624,0.0001711355,0.0006329778,0.0009927758,0.0008248566,0.0007542843],"domain_scores_gemma":[0.9977288,0.0004615749,0.0004714426,0.0004812833,0.000671746,0.0001851588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000809125,0.0001377164,0.002323184,0.00001186351,0.00003152676,0.000002759558,0.0001957393,0.9398052,0.001849099,0.04079546,0.00001548439,0.01402292],"study_design_scores_gemma":[0.000164319,0.0006564644,0.0009647016,0.00007038227,0.00002776424,0.00001241407,0.0003907946,0.9789599,0.001689175,0.01671019,0.000002498305,0.0003513854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5020949,0.00008992597,0.494327,0.001702691,0.0003112883,0.001092858,0.000007907663,0.0001740343,0.0001994352],"genre_scores_gemma":[0.9961755,0.000008001589,0.003264076,0.0003768804,0.00006541656,0.00005676831,0.000002647268,0.00002820521,0.00002250229],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4940806,"threshold_uncertainty_score":0.9999316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04851391012186594,"score_gpt":0.2713783142420653,"score_spread":0.2228644041201994,"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."}}