{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007556987,0.001088386,0.00102818,0.0004067805,0.0003084613,0.0006050199,0.001234181,0.001390012,0.000112888],"category_scores_gemma":[0.0000624977,0.001092006,0.0005925967,0.0001903935,0.0001545073,0.0006324678,0.0003267855,0.001154892,0.0003259514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004346552,"about_ca_system_score_gemma":0.0001079128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005280209,"about_ca_topic_score_gemma":0.00001350802,"domain_scores_codex":[0.9959451,0.00004216365,0.001718607,0.0005321847,0.0005631957,0.001198761],"domain_scores_gemma":[0.9967103,0.000180519,0.0005390158,0.001606127,0.0005341504,0.0004298793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007005609,0.001550638,0.0006160196,0.007349961,0.002731849,0.00002177186,0.01339052,0.3481281,0.00005569564,0.002457889,0.2739551,0.3490419],"study_design_scores_gemma":[0.001901572,0.0004896583,0.00008534065,0.0004762129,0.0001372493,0.00001482842,0.0002210945,0.9396974,0.0001036513,0.0006279932,0.05509251,0.0011525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03670165,0.0001291083,0.9365816,0.0001059136,0.005517017,0.004448498,0.009565423,0.001387956,0.005562884],"genre_scores_gemma":[0.2988234,0.0009338756,0.5392111,0.006588127,0.0101465,0.004781397,0.1306647,0.002406717,0.006444157],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5915694,"threshold_uncertainty_score":0.9999064,"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."}}