{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002987163,0.0009988472,0.001182661,0.004539018,0.002152917,0.004507933,0.001726646,0.001235771,0.01243855],"category_scores_gemma":[0.007399168,0.0006895294,0.001600746,0.003125854,0.004265273,0.006741802,0.005999331,0.005334252,0.001411985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002633499,"about_ca_system_score_gemma":0.0009373972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001267171,"about_ca_topic_score_gemma":0.000646691,"domain_scores_codex":[0.9982219,0.0005608268,0.0001154481,0.0003228728,0.0006412605,0.0001376355],"domain_scores_gemma":[0.9960874,0.002554005,0.0002017182,0.0001939853,0.0007045552,0.000258325],"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.000004543486,0.000005182335,0.00004571513,0.0000362537,0.000006127727,0.00002624759,0.00007379444,0.0005903488,0.0001228199,0.9946176,0.0007351422,0.003736183],"study_design_scores_gemma":[0.000006708095,0.000008951444,0.00009154756,0.00003894186,0.00000694783,0.00009573756,0.0001043421,0.009130836,0.0003164069,0.9792395,0.01095205,0.0000079896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03990783,0.02401558,0.6720459,0.004149727,0.000632819,0.0001045924,0.000455632,0.0003761968,0.2583117],"genre_scores_gemma":[0.7304997,0.01889932,0.186448,0.001147268,0.00206614,0.0006375831,0.001058177,0.0004812123,0.05876267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01243855,"threshold_uncertainty_score":0.04161108,"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."}}