{"id":"W2913893999","doi":"10.1007/978-3-030-25939-6_3","title":"Numerical Explorations of Feasibility Algorithms for Finding Points in the Intersection of Finite Sets","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Kelowna General Hospital; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Intersection (aeronautics); Constraint (computer-aided design); Algorithm; Convergence (economics); Projection (relational algebra); Point (geometry); Euclidean geometry; Mathematics; Set (abstract data type); Regular polygon; Hilbert space; Constellation; Mathematical optimization; Computer science; Pure mathematics","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.0004006723,0.0001038349,0.0002332795,0.0001766271,0.00003085074,0.00002557628,0.0003641947,0.00008898161,0.0001146445],"category_scores_gemma":[0.00008306829,0.00007594902,0.0001747459,0.0001487258,0.00002029527,0.0002044291,0.00005267014,0.00009165081,0.00001021323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005031446,"about_ca_system_score_gemma":0.00009564213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002452488,"about_ca_topic_score_gemma":0.00002649645,"domain_scores_codex":[0.9990101,0.00003573725,0.0004165237,0.0002365912,0.0002321172,0.00006893231],"domain_scores_gemma":[0.9987115,0.0004239673,0.0002907449,0.0003371145,0.0002212445,0.00001542291],"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.0000103019,0.00007489313,0.0001623369,0.0000390445,0.00005433164,1.927529e-7,0.001084028,0.01172987,0.000003928854,0.9844682,0.0002749811,0.00209786],"study_design_scores_gemma":[0.0002830195,0.0001050906,0.000525922,0.00004630545,0.00002715142,9.248328e-7,0.0000575995,0.9469253,0.00003501268,0.05132056,0.0005484795,0.000124593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00001680959,0.000005649928,0.9642974,0.0006775738,0.0001257679,0.0003167224,0.00002646462,0.00001109895,0.0345225],"genre_scores_gemma":[0.5071082,0.00003450434,0.4021524,0.0008414179,0.0001113495,0.00006396132,0.0004216705,0.00003658859,0.08922987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9351954,"threshold_uncertainty_score":0.3097111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09623378331770137,"score_gpt":0.3146707892107584,"score_spread":0.218437005893057,"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."}}