{"id":"W2569250480","doi":"10.4230/lipics.stacs.2011.637","title":"Bounds on the maximum multiplicity of some common geometric graphs","year":2011,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Combinatorics; General position; Mathematics; Omega; Upper and lower bounds; Spanning tree; Multiplicity (mathematics); Regular polygon; Discrete mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042128,0.0002786949,0.0003272084,0.0006448831,0.0003820338,0.00017514,0.001349046,0.0001311649,0.00002803477],"category_scores_gemma":[0.0001179493,0.0002055245,0.0002559397,0.00118095,0.0001201997,0.001241872,0.0003499028,0.0002881322,0.00008135087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005800432,"about_ca_system_score_gemma":0.00006096293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003386363,"about_ca_topic_score_gemma":0.000008575521,"domain_scores_codex":[0.9977914,0.0000565574,0.0008875629,0.0002304253,0.0005832327,0.0004508042],"domain_scores_gemma":[0.9979311,0.000356673,0.0004915955,0.0008285836,0.0002668188,0.0001252505],"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.0002421164,0.001631538,0.009684219,0.0004164967,0.0003461514,0.000004712167,0.01489848,0.001220117,0.0002352059,0.8721766,0.006748535,0.09239577],"study_design_scores_gemma":[0.009097673,0.003816692,0.07798162,0.0003752954,0.0001497462,0.0001312767,0.00170974,0.5056493,0.08427462,0.2593086,0.05499045,0.00251501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.696433,0.0000556695,0.2956238,0.0003050222,0.001107318,0.001010259,0.0001602402,0.0001438543,0.005160791],"genre_scores_gemma":[0.9847826,0.00002088111,0.01357576,0.001290938,0.00006456328,0.00007053155,0.00009339008,0.00001549818,0.00008581751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6128681,"threshold_uncertainty_score":0.8381046,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03768576974394765,"score_gpt":0.2456183393488825,"score_spread":0.2079325696049348,"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."}}