{"id":"W4414404317","doi":"10.21203/rs.3.rs-7483054/v1","title":"A sub-quadratic algorithm for the minsum one sink location problem on balanced binary tree networks","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Sink (geography); Time complexity; Binary number; Tree (set theory); Tree network; Binary tree; Path (computing); Focus (optics)","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.001627912,0.001477141,0.002454912,0.001061208,0.001126157,0.002212014,0.003545572,0.002279633,0.01492333],"category_scores_gemma":[0.005903425,0.0008915863,0.0008886754,0.002441654,0.001038606,0.004319923,0.003040394,0.002666696,0.002631425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019181,"about_ca_system_score_gemma":0.002447644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006514986,"about_ca_topic_score_gemma":0.009522706,"domain_scores_codex":[0.9988012,0.000343547,0.00005633412,0.0003131762,0.00025118,0.0002344508],"domain_scores_gemma":[0.9968727,0.002168124,0.0001699668,0.0003186763,0.0002865054,0.0001840049],"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.0008784342,0.0005328999,0.0005964941,0.0005699872,0.0000792286,0.00009978109,0.0002700971,0.6586951,0.003558711,0.04209228,0.02691642,0.2657106],"study_design_scores_gemma":[0.0001482788,0.00007777292,0.0001321758,0.00001658838,0.0000149812,0.00003731561,0.00006701415,0.9669588,0.0004748142,0.03035787,0.00170477,0.00000961362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02559639,0.0005622537,0.961503,0.001129545,0.0001615814,0.0002600493,0.0005650219,0.00134528,0.008876747],"genre_scores_gemma":[0.1952191,0.0003260974,0.7896183,0.000478668,0.0001581329,0.0005084206,0.001434383,0.0005887346,0.01166822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01492333,"threshold_uncertainty_score":0.04992354,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07293459140874814,"score_gpt":0.338197865971225,"score_spread":0.2652632745624768,"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."}}