{"id":"W2807502981","doi":"10.4230/lipics.isaac.2018.14","title":"An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Sink (geography); Path (computing); Aggregate (composite); Minimax; Computer science; Operations research; Mathematical economics; Economics; Mathematics; Computer network; Geography; Cartography; Machine learning; Materials science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001821012,0.002651841,0.002087933,0.0008600192,0.0009848581,0.001662899,0.002462767,0.002523404,0.01157936],"category_scores_gemma":[0.004372567,0.0007663373,0.001352434,0.001266394,0.0009747053,0.003631299,0.002468175,0.002275874,0.002228443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001918178,"about_ca_system_score_gemma":0.002038301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002904989,"about_ca_topic_score_gemma":0.005923247,"domain_scores_codex":[0.9989063,0.0003390583,0.00004505936,0.0002965671,0.000167259,0.000245769],"domain_scores_gemma":[0.9982609,0.00122875,0.0001294499,0.0001959393,0.00009718885,0.0000877248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006827305,0.0002533667,0.000737215,0.0004438229,0.0001260625,0.0001570836,0.0002599802,0.7537723,0.002211193,0.0461688,0.02405739,0.17113],"study_design_scores_gemma":[0.00008395788,0.00008872499,0.0001431137,0.00001851535,0.00002208651,0.00005939606,0.00005280256,0.9415724,0.0008279027,0.05446641,0.002651805,0.00001290863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02461041,0.000701178,0.9598832,0.001497331,0.0001636053,0.0002941907,0.0006063287,0.003696802,0.008546985],"genre_scores_gemma":[0.26966,0.0005208158,0.711797,0.0005759968,0.0001958226,0.0006540277,0.001867691,0.0009715336,0.01375705],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01157936,"threshold_uncertainty_score":0.03873682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01064140316944364,"score_gpt":0.2468988075519385,"score_spread":0.2362574043824949,"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."}}