{"id":"W2798368826","doi":"10.1007/s10107-020-01562-6","title":"Complete positivity and distance-avoiding sets","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Universidade de São Paulo; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Cone (formal languages); Mathematics; Regular polygon; Euclidean distance; Euclidean space; Dual cone and polar cone; Characterization (materials science); Space (punctuation); Euclidean geometry; Convex cone; Combinatorics; Convex optimization; Convex set; Mathematical optimization; Computer science; Algorithm; Geometry; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001459192,0.0008460162,0.0006896891,0.001430776,0.0008382162,0.002423413,0.001346262,0.0006181717,0.003205997],"category_scores_gemma":[0.004307776,0.0003373247,0.0005746495,0.0009739209,0.002512674,0.003043377,0.002025164,0.001960151,0.0004463039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009482083,"about_ca_system_score_gemma":0.0006717767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008513847,"about_ca_topic_score_gemma":0.000650663,"domain_scores_codex":[0.9988669,0.0002897227,0.00004041849,0.0002073643,0.0004610664,0.000134592],"domain_scores_gemma":[0.9973524,0.001087712,0.0003591572,0.0001980085,0.0006004012,0.0004023863],"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.00001452105,0.00001330643,0.0002326515,0.0000303469,0.00000686134,0.00005771195,0.00006345766,0.006972439,0.001058462,0.9868095,0.0006468393,0.004093945],"study_design_scores_gemma":[0.000008553023,0.0000267867,0.0004074619,0.000030832,0.000005988171,0.0001404479,0.00007665889,0.07176519,0.001030576,0.9219603,0.004531726,0.00001539355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1433489,0.001302698,0.8078124,0.0007866483,0.0001120271,0.00005317614,0.0003614138,0.0001286138,0.04609413],"genre_scores_gemma":[0.8959773,0.001671856,0.08600134,0.0004151662,0.000253891,0.0001720392,0.000451497,0.0001431384,0.01491373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003205997,"threshold_uncertainty_score":0.01072508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1462178423531028,"score_gpt":0.3562012396172815,"score_spread":0.2099833972641786,"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."}}