{"id":"W3013138006","doi":"10.1093/imrn/rnaa251","title":"Asymptotic Bounds on Graphical Partitions and Partition Comparability","year":2020,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Upper and lower bounds; Comparability; Frequency partition of a graph; Discrete mathematics; Joint probability distribution; Graph; Statistics; Line graph; Graph power","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008818466,0.001010902,0.002169337,0.003397881,0.002328252,0.005062752,0.004243148,0.002930282,0.01401918],"category_scores_gemma":[0.1202267,0.001120932,0.001515858,0.00221089,0.005846021,0.01046304,0.00482615,0.006583488,0.001134052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00517524,"about_ca_system_score_gemma":0.00148083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001623499,"about_ca_topic_score_gemma":0.001376296,"domain_scores_codex":[0.9905005,0.002731159,0.0002651232,0.002408895,0.002646237,0.001448165],"domain_scores_gemma":[0.837649,0.13384,0.007114219,0.0118733,0.005604023,0.003919412],"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.0009443235,0.0002632038,0.008493973,0.000498888,0.0001426423,0.0003272371,0.0008519464,0.0904176,0.01134353,0.8521785,0.006226975,0.0283112],"study_design_scores_gemma":[0.00008050126,0.0001843121,0.002930714,0.000111579,0.00007718818,0.0005234514,0.0001702389,0.3210898,0.00552576,0.6658228,0.003414229,0.00006941734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3718064,0.002424553,0.5531982,0.005806557,0.0003360034,0.0002119935,0.000990337,0.002025174,0.06320082],"genre_scores_gemma":[0.9684169,0.0005591091,0.02389147,0.0007502842,0.000324192,0.0002711171,0.000628966,0.000483041,0.00467491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01401918,"threshold_uncertainty_score":0.04689884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3874518741101598,"score_gpt":0.5102915029724255,"score_spread":0.1228396288622657,"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."}}