{"id":"W2599474588","doi":"10.1090/crmp/048/01","title":"On combinatorial properties of linear program digraphs","year":2009,"lang":"en","type":"article","venue":"CRM proceedings & lecture notes","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Digraph; Polytope; Mathematics; Directed graph; Simplex; Bounded function; Discrete mathematics; Regular polygon; Property (philosophy)","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.0001260916,0.0002373589,0.0002846142,0.0001354111,0.0000823353,0.00004709702,0.0001883304,0.0001725336,0.000006554444],"category_scores_gemma":[0.0001261001,0.0001843014,0.0001141004,0.0003624029,0.00005399693,0.0001093068,0.00000799056,0.0002585783,0.000008093679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000165694,"about_ca_system_score_gemma":0.000008537204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000220447,"about_ca_topic_score_gemma":3.668954e-7,"domain_scores_codex":[0.9990623,0.00000574256,0.0002477573,0.0001921729,0.0002102883,0.0002817143],"domain_scores_gemma":[0.9996296,0.00002335863,0.00005640379,0.0001022235,0.0001208569,0.00006760781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000300522,0.0004100098,0.0006978771,0.0007971908,0.0001301709,0.000002868532,0.004626655,0.001256024,0.3456485,0.6140726,0.0001283003,0.03192926],"study_design_scores_gemma":[0.0005747885,0.001074198,0.0004042942,0.0004066657,0.00003806634,0.000009114223,0.00007255041,0.001550015,0.6992121,0.2951273,0.001148271,0.0003826056],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9842163,0.0006507031,0.0001140963,0.00008438536,0.0005446316,0.0004651741,0.000001966829,0.000756456,0.01316632],"genre_scores_gemma":[0.9995704,0.00001101823,0.0000356306,0.0000465339,0.0002671894,0.00003721995,0.000002041114,0.00002902405,9.614513e-7],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3535636,"threshold_uncertainty_score":0.7515594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008437755765550543,"score_gpt":0.2042983752986322,"score_spread":0.1958606195330817,"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."}}