{"id":"W4237140089","doi":"10.1137/1.9781611973068.77","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Logarithm; Approximation algorithm; Bounded function; Mathematics; Time complexity; Computer science; Discrete mathematics; Combinatorics; Algorithm","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.0009358659,0.0005725902,0.000595902,0.0004186315,0.0006062439,0.0003632158,0.003890609,0.0002256061,0.000006376719],"category_scores_gemma":[0.0002416508,0.0004301245,0.0006155947,0.001417666,0.0002178421,0.001182148,0.0005816868,0.0005188541,0.00001274305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009996136,"about_ca_system_score_gemma":0.00006364876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001462924,"about_ca_topic_score_gemma":7.974465e-7,"domain_scores_codex":[0.9961785,0.00003322771,0.0007667927,0.001088504,0.001052276,0.0008807104],"domain_scores_gemma":[0.9973916,0.0001807285,0.0006004391,0.0009156696,0.0006862469,0.0002253442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001117995,0.003314469,0.0002622116,0.000951014,0.0004480391,0.000005206286,0.008250826,0.004037729,0.01700828,0.6886829,0.03723971,0.2386816],"study_design_scores_gemma":[0.003336868,0.006191625,0.001166982,0.000759122,0.0001331517,0.00004009481,0.0004529696,0.4226677,0.08473625,0.4705079,0.008604472,0.001402963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1275838,0.001495315,0.6288965,0.1581687,0.01802529,0.02127545,0.002680823,0.004642523,0.03723161],"genre_scores_gemma":[0.4419288,0.000267142,0.5476041,0.004058007,0.001184241,0.0005206357,0.00008520541,0.0001397108,0.004212141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4186299,"threshold_uncertainty_score":0.999815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02003102456231295,"score_gpt":0.2649339222629797,"score_spread":0.2449028977006667,"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."}}