{"id":"W2898517553","doi":"10.1080/03610918.2018.1468459","title":"Linear programming bounds on the union probability","year":2018,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Linear programming; Event (particle physics); Mathematics; Upper and lower bounds; Combinatorics; State (computer science); Discrete mathematics; Mathematical optimization; Algorithm; Statistics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0007387786,0.0001046996,0.00008672186,0.0001641222,0.0005045013,0.0002301659,0.0002485275,0.00003419746,0.00004373617],"category_scores_gemma":[0.0002739351,0.00008909689,0.00001550032,0.0004342321,0.0002628643,0.0002615733,0.0002107157,0.0001234387,0.00006763796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005052624,"about_ca_system_score_gemma":0.00001182151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009003956,"about_ca_topic_score_gemma":0.0002138308,"domain_scores_codex":[0.999157,0.00008649623,0.0002909546,0.0001739939,0.0001655025,0.0001260889],"domain_scores_gemma":[0.9987271,0.0004164625,0.0001510113,0.0004538867,0.0002430423,0.000008436125],"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.00002709834,0.0002422288,0.006791569,0.00005713639,0.00001232811,3.531784e-7,0.0004845185,0.03840394,0.000003221541,0.7927065,0.001225855,0.1600453],"study_design_scores_gemma":[0.0002361676,0.00002342936,0.01393906,0.00002786262,0.00001034822,8.968239e-8,0.0002022887,0.8683181,8.313517e-7,0.05985698,0.05729114,0.00009364967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1208969,0.00006773709,0.8463588,0.007475092,0.0004588039,0.001880942,0.00001287403,0.0002506592,0.02259823],"genre_scores_gemma":[0.9862758,0.000007062285,0.01217784,0.001104843,0.0001533631,0.00004509263,0.000168583,0.00001176719,0.00005564251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8653789,"threshold_uncertainty_score":0.3880267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1665004889693923,"score_gpt":0.3901588904644365,"score_spread":0.2236584014950442,"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."}}