{"id":"W2244768816","doi":"10.35834/mjms/1449161367","title":"Intersection Theorems for Closed Convex Sets and Applications","year":2015,"lang":"en","type":"preprint","venue":"Missouri Journal of Mathematical Sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Kakutani fixed-point theorem; Fixed-point theorem; Brouwer fixed-point theorem; Danskin's theorem; Fixed-point property; Minimax theorem; Intersection (aeronautics); Intersection theorem; Krein–Milman theorem; Convex analysis; Pure mathematics; Lemma (botany); Closed graph theorem; Discrete mathematics; Banach space; Picard–Lindelöf theorem; Regular polygon; Minimax; Schauder fixed point theorem; Convex optimization; Mathematical economics","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.002560873,0.0001333571,0.0003445896,0.0002265713,0.000167736,0.0004248057,0.0008816225,0.0001002512,0.00003117025],"category_scores_gemma":[0.0003644117,0.00009168295,0.0001536146,0.0002768191,0.0001878521,0.0002494109,0.0002848237,0.0001861843,0.000004327277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004826462,"about_ca_system_score_gemma":0.0002481986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000178098,"about_ca_topic_score_gemma":7.322096e-7,"domain_scores_codex":[0.9984579,0.00008127857,0.0005487784,0.0002501447,0.0005170926,0.0001448086],"domain_scores_gemma":[0.9979929,0.0003991369,0.0006643874,0.0001756143,0.0005879606,0.0001800029],"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.00001804408,0.0003005467,0.00007221849,0.0002431786,0.000181868,0.000002309627,0.002986397,0.01198127,0.00008277023,0.9669949,0.002228659,0.0149078],"study_design_scores_gemma":[0.000176621,0.0000858511,0.0000254838,0.00006942555,0.00004766937,0.00004419464,0.0001157736,0.3227919,0.00003552949,0.6752152,0.001290994,0.0001013083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001787286,0.0002136436,0.9919003,0.003601153,0.0001647403,0.000238789,0.000005978905,0.00001897214,0.002069181],"genre_scores_gemma":[0.4048928,0.00006581746,0.5940917,0.0002922966,0.0003622296,0.00004310834,0.000004030246,0.000009853042,0.0002381962],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4031055,"threshold_uncertainty_score":0.4096411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05090825191119554,"score_gpt":0.3249398287832382,"score_spread":0.2740315768720427,"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."}}