{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469462,0.0004854151,0.000510902,0.001984914,0.001073729,0.002268597,0.0007244118,0.0007591152,0.008254979],"category_scores_gemma":[0.004617322,0.0006583213,0.0007385665,0.001804441,0.001395611,0.002885076,0.0009990142,0.00131519,0.0006602354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001409374,"about_ca_system_score_gemma":0.0006360666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002070632,"about_ca_topic_score_gemma":0.002975228,"domain_scores_codex":[0.9993316,0.0001697415,0.00005564706,0.0001917874,0.0001513949,0.00009982484],"domain_scores_gemma":[0.9966516,0.001860498,0.0005121306,0.0002663014,0.0003933706,0.0003161877],"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.00007191963,0.0001052831,0.002084669,0.0001720727,0.00003506801,0.0005311891,0.0003679805,0.03998113,0.003341679,0.9182623,0.002548759,0.03249786],"study_design_scores_gemma":[0.00004089292,0.00006854038,0.001393504,0.00007590188,0.00003904572,0.0005213723,0.0002166299,0.1565717,0.002382634,0.8253543,0.01330419,0.00003117173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497773,0.0004770532,0.6907041,0.000759932,0.00007790093,0.0002351844,0.001477992,0.0005738024,0.05591683],"genre_scores_gemma":[0.8380931,0.000686459,0.1456111,0.0002914497,0.0001063477,0.0003587413,0.00215399,0.0002003167,0.01249846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008254979,"threshold_uncertainty_score":0.02761567,"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."}}