{"id":"W3047403295","doi":"10.7151/dmgt.2407","title":"Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs","year":2021,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg; University of Victoria","funders":"","keywords":"Cartesian product; Bijection; Combinatorics; Mathematics; Convexity; Regular polygon; Product (mathematics); Binary number; Convex hull; Convex set; Set (abstract data type); Discrete mathematics; Convex optimization; Geometry; Arithmetic; Computer science","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.001108479,0.0003604769,0.0008697715,0.0002406981,0.00009482432,0.0002798641,0.001039994,0.0001210513,0.000002561693],"category_scores_gemma":[0.0005761381,0.0002093693,0.000174717,0.0003908507,0.001228098,0.0004663841,0.002095125,0.0002504582,1.511322e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005211699,"about_ca_system_score_gemma":0.0001172208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005006446,"about_ca_topic_score_gemma":0.000001002616,"domain_scores_codex":[0.9975895,0.0002576508,0.0008636066,0.0006024999,0.0004620284,0.0002246641],"domain_scores_gemma":[0.996762,0.0005209516,0.001016907,0.001265411,0.000361355,0.00007333562],"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.00003186356,0.000585167,0.0006521841,0.01287027,0.0004044644,0.00001811972,0.03577537,0.000007538662,0.02373467,0.8509402,0.00005407321,0.07492613],"study_design_scores_gemma":[0.0001220821,0.00006565571,0.0010954,0.003190493,0.00006861721,0.00003481156,0.00197432,0.0008367923,0.02509434,0.9672223,0.000002623595,0.0002925906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7001222,0.007463942,0.2840273,0.001497723,0.0002622132,0.001824747,0.0002000193,0.0003481498,0.004253658],"genre_scores_gemma":[0.9200329,0.0001086117,0.07974185,0.00002450908,0.000004250285,0.00003498348,0.00001089814,0.00002610994,0.00001588056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2199107,"threshold_uncertainty_score":0.8537832,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01795779426189939,"score_gpt":0.2545900619337912,"score_spread":0.2366322676718919,"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."}}