{"id":"W2952626446","doi":"10.48550/arxiv.1012.5664","title":"Bounds on the maximum multiplicity of some common geometric graphs","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"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":"Mathematics; Multiplicity (mathematics); Combinatorics; Discrete mathematics; Geometry","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.0002843843,0.0001016928,0.0001097762,0.0003701569,0.0002101044,0.00004374091,0.0007777275,0.00006011258,0.00002504585],"category_scores_gemma":[0.00005722012,0.00008682442,0.00009280856,0.001946325,0.00008939158,0.0003469769,0.0001707755,0.0002169091,0.00004471556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001971071,"about_ca_system_score_gemma":0.0000403807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005191535,"about_ca_topic_score_gemma":0.00003491413,"domain_scores_codex":[0.9992577,0.00006139968,0.000114872,0.0003013609,0.0001064186,0.0001582433],"domain_scores_gemma":[0.9988651,0.0003402339,0.0001071422,0.0005278226,0.00009224092,0.00006749062],"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.00001199149,0.0001122409,0.003204189,0.000003963125,0.00001560888,0.00000876748,0.00004478996,0.01618402,0.001804941,0.9752591,0.0001975479,0.003152877],"study_design_scores_gemma":[0.0008047568,0.0002532607,0.06557748,0.00001103113,0.00002332036,0.000008096862,0.00003938442,0.485079,0.0189495,0.4265915,0.002312306,0.0003503488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8954148,0.00000799593,0.1027897,0.0001969954,0.0003458776,0.0001009157,0.000003196849,0.00004929439,0.001091301],"genre_scores_gemma":[0.9989833,0.000009909683,0.0004889462,0.0002238425,0.00003615306,3.740706e-7,0.000003066849,0.000003797508,0.0002506453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5486676,"threshold_uncertainty_score":0.3540597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04330723801176086,"score_gpt":0.1801914841971991,"score_spread":0.1368842461854382,"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."}}