{"id":"W3196496659","doi":"10.1109/icccn52240.2021.9522225","title":"Timetable-based Routing in Fixed Schedule Dynamic Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Schedule; Node (physics); Routing (electronic design automation); Set (abstract data type); Path (computing); Mathematical optimization; Distributed computing; Algorithm; Computer network; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210848,0.000689837,0.000672815,0.001081201,0.001187019,0.001737269,0.002582385,0.0008107117,0.0033304],"category_scores_gemma":[0.003518201,0.0005581367,0.0005188207,0.002285986,0.0009063084,0.003445826,0.0009844092,0.0008910381,0.0004818685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425766,"about_ca_system_score_gemma":0.001908073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01276869,"about_ca_topic_score_gemma":0.01212016,"domain_scores_codex":[0.99903,0.0002475232,0.00005528607,0.0002002545,0.0002829363,0.0001839878],"domain_scores_gemma":[0.9982299,0.0007869631,0.0002316781,0.00038571,0.0002271095,0.0001385104],"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.00044368,0.0001114018,0.0007662333,0.0002395806,0.00006137063,0.0001635286,0.0002437453,0.7684408,0.005988815,0.08367524,0.01103383,0.1288317],"study_design_scores_gemma":[0.00008461985,0.0001719679,0.0003312257,0.00002448677,0.00003426851,0.0001738401,0.0001267396,0.9160748,0.004511419,0.06599766,0.01243521,0.00003376664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05508747,0.0009439053,0.9330115,0.0004587619,0.0001582092,0.0002216685,0.0005173329,0.001963568,0.00763773],"genre_scores_gemma":[0.5882911,0.001174691,0.4014356,0.000143602,0.0001221158,0.0002455438,0.001355284,0.000276554,0.006955482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01276869,"threshold_uncertainty_score":0.02538872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007584914592625482,"score_gpt":0.2291746980898766,"score_spread":0.2215897834972511,"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."}}