{"id":"W2963978854","doi":"10.1016/j.dam.2019.03.016","title":"Polynomial size linear programs for problems in P","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Polytope; Combinatorics; Birkhoff polytope; Disjoint sets; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Logarithm; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.0003187224,0.0001781377,0.0002879711,0.0000677016,0.00005278189,0.0001145725,0.0007992181,0.00007693865,0.00001331292],"category_scores_gemma":[0.00002275616,0.0001573422,0.00009834616,0.0003386687,0.00004419537,0.0001363603,0.0002327382,0.0001362761,0.00007684901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002484192,"about_ca_system_score_gemma":0.00003652279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005175079,"about_ca_topic_score_gemma":0.00000870622,"domain_scores_codex":[0.9986823,0.000006862736,0.0003503918,0.0003588576,0.0002210172,0.0003805665],"domain_scores_gemma":[0.9989526,0.00023874,0.0001160007,0.0006013864,0.00002846072,0.00006281609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000306584,0.001012231,0.0004102764,0.001637741,0.00007489385,0.000003454327,0.009639678,0.0006916024,0.006060084,0.910799,0.001262106,0.06837822],"study_design_scores_gemma":[0.003397882,0.0003284614,0.0002776481,0.000254843,0.00002023423,0.00001249167,0.0006162822,0.6627471,0.002733087,0.3096931,0.01886502,0.001053864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0528196,0.00004658263,0.9222224,0.0004164179,0.0004207036,0.00423832,0.00001237175,0.0003991746,0.01942444],"genre_scores_gemma":[0.2665568,0.000003553545,0.732582,0.00009847813,0.00007266561,0.0003443708,0.000009287708,0.00002432426,0.0003085032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6620555,"threshold_uncertainty_score":0.6416228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02177863928550337,"score_gpt":0.2518625722155449,"score_spread":0.2300839329300415,"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."}}