{"id":"W2126874118","doi":"10.1145/2532645","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bounded function; Approximation algorithm; Bottleneck; Multiplicative function; Combinatorics; Logarithm; Time complexity; Discrete mathematics; Linear programming; Maximum flow problem; Mathematical optimization; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005366337,0.0003094883,0.0002996569,0.0004446316,0.0006247757,0.0002062041,0.001317749,0.0001503741,0.0000391346],"category_scores_gemma":[0.00007444815,0.0003002131,0.0002868995,0.0008305187,0.000089372,0.000447584,0.00002177665,0.0003576285,0.00009475736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007179908,"about_ca_system_score_gemma":0.00004409605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002867242,"about_ca_topic_score_gemma":0.00001623777,"domain_scores_codex":[0.9978797,0.00009525418,0.0003685833,0.0007430529,0.0004144351,0.0004989475],"domain_scores_gemma":[0.9975376,0.0005880643,0.0001008247,0.001460973,0.0001508963,0.0001616843],"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.00003228469,0.000464935,0.000001072676,0.00003344655,0.00004712639,0.000001329615,0.0002016714,0.01529477,0.00007275412,0.0444834,0.0001920909,0.9391751],"study_design_scores_gemma":[0.001108362,0.0009285769,0.00004705124,0.00004615515,0.00002176768,0.00001346841,0.00001588786,0.8182418,0.004296815,0.16589,0.009052031,0.000338033],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002929606,0.00002065321,0.9944653,0.002364957,0.001154201,0.0005987316,0.00005825083,0.0004963149,0.0005486563],"genre_scores_gemma":[0.060726,0.000033898,0.9368367,0.001132986,0.0001802417,0.0003884232,0.0000292216,0.00003722683,0.0006352754],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9388371,"threshold_uncertainty_score":0.999945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03811854143595254,"score_gpt":0.2740565768001746,"score_spread":0.235938035364222,"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."}}