{"id":"W4413019768","doi":"10.1016/j.tcs.2025.115502","title":"On the complexity of temporal arborescence reconfiguration","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Control reconfiguration; Computer science; Theoretical computer science; Mathematics; Combinatorics; Distributed computing; Embedded system","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009588479,0.00009340313,0.0001124607,0.0001561272,0.0003170565,0.0001770999,0.001261899,0.00002752039,0.00008044237],"category_scores_gemma":[0.0001784565,0.00006230039,0.00004081279,0.001208213,0.004444206,0.0002710022,0.0002422498,0.0001313047,0.00001551446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003673145,"about_ca_system_score_gemma":0.0001630794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004563585,"about_ca_topic_score_gemma":0.000001792,"domain_scores_codex":[0.9987473,0.000114034,0.0002366729,0.0003396708,0.000369849,0.0001924871],"domain_scores_gemma":[0.9987397,0.0003348333,0.00007706475,0.0005992906,0.0001935788,0.00005553025],"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.000005178524,0.00002286717,0.00007780362,0.000002692906,0.000001740807,3.780664e-7,0.00008326186,0.0002800976,0.000248085,0.9770541,0.00008352475,0.02214027],"study_design_scores_gemma":[0.00007528799,0.0000516502,0.004427812,0.0000295951,0.000001242728,0.000001795115,0.000004052205,0.5497103,0.006011894,0.4396089,0.00002091897,0.00005657187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008472284,0.000002989434,0.9677209,0.009276794,0.0004372275,0.000157844,9.199724e-7,0.00007510174,0.01385597],"genre_scores_gemma":[0.9455832,0.000001425064,0.05331545,0.001071932,0.00001268879,0.000003392522,4.392215e-7,0.000001404123,0.00001007638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9371109,"threshold_uncertainty_score":0.9982651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02032966206416888,"score_gpt":0.2598789923358944,"score_spread":0.2395493302717255,"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."}}