{"id":"W2060309802","doi":"10.5555/338219.338663","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Linear programming; Oracle; Convergence (economics); Polynomial; Time complexity; Mathematics; Construct (python library); Algorithm; Computer science; Mathematical optimization; Discrete mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003791972,0.0002749816,0.0003266468,0.00009010206,0.0005299855,0.0003558594,0.001012645,0.0001436096,0.0001493669],"category_scores_gemma":[0.00002946821,0.000269735,0.0002883335,0.0002986754,0.00008777543,0.0003530465,0.0001208528,0.0001643297,0.00001705592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006021634,"about_ca_system_score_gemma":0.0002017258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003971606,"about_ca_topic_score_gemma":0.00018207,"domain_scores_codex":[0.9977645,0.00003014574,0.0004768975,0.0007221889,0.000224464,0.0007818253],"domain_scores_gemma":[0.9986907,0.000261404,0.0001186902,0.0006077563,0.0001411057,0.0001803813],"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.0002833062,0.0002034871,0.00005154607,0.00003652921,0.00007869839,0.000002386846,0.0005750827,0.007203805,0.0002087757,0.001834708,0.04345575,0.9460659],"study_design_scores_gemma":[0.001067465,0.0003315242,0.00004073179,0.0000162694,0.00001519527,0.00000421795,0.00003509942,0.7660515,0.002239773,0.00012796,0.2297507,0.0003195845],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01628984,0.0001774365,0.9787321,0.0018593,0.0009285223,0.001348129,0.00006390459,0.0003128624,0.0002879285],"genre_scores_gemma":[0.1687891,0.0000266129,0.8166444,0.001758828,0.002650084,0.0004968475,0.00003708462,0.00005085608,0.009546224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9457464,"threshold_uncertainty_score":0.9999755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02927926635376855,"score_gpt":0.2800338732180439,"score_spread":0.2507546068642754,"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."}}