{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001695778,0.001608101,0.001431903,0.001179699,0.001761168,0.00562303,0.00274323,0.002316306,0.01975081],"category_scores_gemma":[0.01589266,0.001107849,0.001945748,0.002683805,0.002326619,0.01081698,0.003170465,0.008074791,0.002388573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004114016,"about_ca_system_score_gemma":0.002713706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003831389,"about_ca_topic_score_gemma":0.006284131,"domain_scores_codex":[0.9974914,0.0005727523,0.0001097238,0.0007682904,0.0005883966,0.0004694625],"domain_scores_gemma":[0.985517,0.0121111,0.0006576691,0.0007711722,0.0005154673,0.000427633],"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.0007990942,0.0007015872,0.001552746,0.001404517,0.0001231656,0.0001846992,0.0007541284,0.06346587,0.004089382,0.8015187,0.03663112,0.08877495],"study_design_scores_gemma":[0.0001746976,0.000068754,0.0004301143,0.00005894373,0.00005687115,0.0001251263,0.0001563085,0.1189884,0.002267516,0.8678368,0.009813585,0.00002287386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1523502,0.002243163,0.6915571,0.02545112,0.0005540521,0.0009046097,0.003982219,0.002587634,0.12037],"genre_scores_gemma":[0.6714418,0.002259411,0.2441023,0.002185436,0.001347786,0.001214019,0.004265136,0.001259537,0.07192457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01975081,"threshold_uncertainty_score":0.066073,"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."}}